A filtering method for the interval eigenvalue problem
Overview & Synopsis
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.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | A filtering method for the interval eigenvalue problem |
|---|---|
| Author / Organization | Milan Hladik, David Daney, Elias P. Tsigaridas |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2009 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-201250 |
| Original Source Link | Visit Source Page on hal.science » |