Abstract
We propose an eigenvalue contractor for symmetric matrices. Given a symmetric interval matrix A and an interval approximation of its eigenvalue sets the contractor reduces the entries of A such that no matrix with eigenvalues in the eigenvalue sets is omitted.
Our contractor is based on sequentially reducing theentries of A. We discuss properties of the methodand demonstrate its performance on examples.