.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Interval matrix
Symmetric matrix
Interval analysis
Eigenvalue
Eigenvalue bounds
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Determination of Velocity Distributions in Molecular Beam Frequency Standards from Measured Resonance Curves.png)
Metrologia
MetrologiaIF0
PREAI
分享收藏
查看更多内容