.png){kind=icon}
Return
A filtering method for the interval eigenvalue problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2010.09.066.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the general problem of computing intervals that contain the real eigenvalues of interval matrices. Given an outer approximation (superset) of the real eigenvalue set of an interval matrix, we propose a filtering method that iteratively improves the approximation. Even though our method is based on a sufficient regularity condition, it is very efficient in practice and our experimental results suggest that it improves, in general, significantly the initial outer approximation. The proposed method works for general, as well as for symmetric interval matrices. (C) 2010 Elsevier Inc. All rights reserved.
Keywords:
Interval matrix
Symmetric matrix
Interval analysis
Eigenvalue
Eigenvalue bounds
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
Determination of Velocity Distributions in Molecular Beam Frequency Standards from Measured Resonance Curves.png)
Metrologia
MetrologiaIF0
PREAI
ShareSaveShareSaveShareSaveShareSave
View more