Files:

(unavailable)

Abstract:

We consider the general problem of computing intervals that contain the real eigenvalues of interval matrices. Given an outer estimation of the real eigenvalue set of an interval matrix, we propose a filtering method that improves the estimation. Even though our method is based on an sufficient regularity condition, it is very efficient in practice, and our experimental results suggest that, in general, improves significantly the input estimation. The proposed method works for general, as well as for symmetric matrices.

BibTeX:
@Article{hdt-amc-2010,
  author =       {Milan Hlad{\'i}k and David Daney and
                  Elias~P. Tsigaridas},
  title =        {A filtering method for the interval eigenvalue
                  problem},
  journal =      {Applied Mathematics and Computation},
  volume =       217,
  number =       12,
  pages =        "5236-5242",
  year =         2011,
  abstract =     "We consider the general problem of computing {\em
                  intervals} that contain the real eigenvalues of {\em
                  interval} matrices.  Given an outer estimation of
                  the real eigenvalue set of an interval matrix, we
                  propose a filtering method that improves the
                  estimation.  Even though our method is based on an
                  sufficient regularity condition, it is very
                  efficient in practice, and our experimental results
                  suggest that, in general, improves significantly the
                  input estimation.  The proposed method works for
                  general, as well as for symmetric matrices.  ",
}

Generated by bib2html.pl (written by Patrick Riley , modified by Elias ) on Wed Oct 23, 2019 21:41:02