Convergence Analysis of Shift-Inverse Method with Richardson Iteration For Eigenvalue Problem

Provides theoretical convergence analysis for a specific iterative eigenvalue solver, which is incremental for numerical linear algebra researchers.

The paper analyzes the convergence of the shift-inverse method with Richardson iteration for eigenvalue problems, showing that convergence speed depends heavily on the eigenvalue gap between the desired and undesired eigenvalues.