A method to rigorously enclose eigenpairs of complex interval matrices

Castelli, Roberto, and Lessard, Jean-Philippe. "A method to rigorously enclose eigenpairs of complex interval matrices." Applications of Mathematics 2013. Prague: Institute of Mathematics AS CR, 2013. 21-32. <http://eudml.org/doc/287778>.

@inProceedings{Castelli2013,
abstract = {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(x)=0$ via a contraction argument. The set-up of the method relies on the notion of $\{\em radii polynomials\}$, which provide an efficient mean of determining a domain on which the contraction mapping theorem is applicable.},
author = {Castelli, Roberto, Lessard, Jean-Philippe},
booktitle = {Applications of Mathematics 2013},
keywords = {eigenvalue; eigenvector; interval arithmetic; complex matrix},
location = {Prague},
pages = {21-32},
publisher = {Institute of Mathematics AS CR},
title = {A method to rigorously enclose eigenpairs of complex interval matrices},
url = {http://eudml.org/doc/287778},
year = {2013},
}

TY - CLSWK
AU - Castelli, Roberto
AU - Lessard, Jean-Philippe
TI - A method to rigorously enclose eigenpairs of complex interval matrices
T2 - Applications of Mathematics 2013
PY - 2013
CY - Prague
PB - Institute of Mathematics AS CR
SP - 21
EP - 32
AB - 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(x)=0$ via a contraction argument. The set-up of the method relies on the notion of ${\em radii polynomials}$, which provide an efficient mean of determining a domain on which the contraction mapping theorem is applicable.
KW - eigenvalue; eigenvector; interval arithmetic; complex matrix
UR - http://eudml.org/doc/287778
ER -