Yunhui He, Hehu Xie
Abstract
Open-access reader
In this paper, we consider the shift-inverse method with Richardson iteration step for the eigenvalue problems. It will be shown that the convergence speed depends heavily on the eigenvalue gap between the desired eigenvalue and undesired ones.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we consider the shift-inverse method with Richardson iteration step for the eigenvalue problems. It will be shown that the convergence speed depends heavily on the eigenvalue gap between the desired eigenvalue and undesired ones.
Key concepts: Inverse iteration, Eigenvalues and eigenvectors, Convergence (economics), Divide-and-conquer eigenvalue algorithm, Inverse, Rayleigh quotient iteration, Mathematics, Applied mathematics