Previous |  Up |  Next


eigenvalue; eigenvector; interval arithmetic; complex matrix
In this paper, a rigorous computational method to enclose eigenpairs of complex interval matrices is proposed. Each eigenpair $x=(\lambda,\rv)$ 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.
Partner of
EuDML logo