期刊
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
卷 43, 期 1, 页码 68-93出版社
SIAM PUBLICATIONS
DOI: 10.1137/20M1385330
关键词
subspace iteration; Arnoldi; shift-and-invert; rational filters; FEAST; CIRR
资金
- NSF [DMS-1818757]
We analyze the stability of eigensolvers that use rational filters to target interior eigenvalues. The results show that subspace iteration with a rational filter remains robust even when an eigenvalue is close to a filter's pole, and these dangerous eigenvalues self-correct in subsequent iterations.
We analyze the stability of a class of eigensolvers that target interior eigenvalues with rational filters. We show that subspace iteration with a rational filter is robust even when an eigenvalue is near a filter's pole. These dangerous eigenvalues contribute to large round-off errors in the first iteration but are self-correcting in later iterations. For matrices with orthogonal eigenvectors (e.g., real-symmetric or complex Hermitian), two iterations are enough to reduce round-off errors to the order of the unit round-off. In contrast, Krylov methods accelerated by rational filters with fixed poles typically fail to converge to unit round-off accuracy when an eigenvalue is close to a pole. In the context of Arnoldi with shift-and-invert enhancement, we demonstrate a simple restart strategy that recovers full precision in the target eigenpairs.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据