In this paper, a rigorous computational method to enclose eigenpairs of complex interval matrices is proposed. Each eigenpair $x=(\lambda ,)$ is found by solving a nonlinear equation of the form $f\left(x\right)=0$ via a contraction argument. The set-up of the method relies on the notion of $radiipolynomials$, which provide an efficient mean of determining a domain on which the contraction mapping theorem is applicable.

EUDML-ID : urn:eudml:doc:287778
Mots clés:
Mots clés:

@article{702928,
     title = {A method to rigorously enclose eigenpairs of complex interval matrices},
     booktitle = {Applications of Mathematics 2013},
     series = {GDML\_Books},
     publisher = {Institute of Mathematics AS CR},
     address = {Prague},
     year = {2013},
     pages = {21-32},
     mrnumber = {MR3204427},
     zbl = {1340.65057},
     url = {http://dml.mathdoc.fr/item/702928}
}

Castelli, Roberto; Lessard, Jean-Philippe. A method to rigorously enclose eigenpairs of complex interval matrices, dans Applications of Mathematics 2013, GDML_Books,  (2013), pp. 21-32. http://gdmltest.u-ga.fr/item/702928/