A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigenproblems

摘要

The harmonic block Arnoldi method can be used to find interior eigenpairs of large matrices. Given a target point or shift τ to which the needed interior eigenvalues are close, the desired interior eigenpairs are the eigenvalues nearest τ and the associated eigenvectors. However, it has been shown that the harmonic Ritz vectors may converge erratically and even may fail to do so. To do a better job, a modified harmonic block Arnoldi method is coined that replaces the harmonic Ritz vectors by some modified harmonic Ritz vectors. The relationships between the modified harmonic block Arnoldi method and the original one are analyzed. Moreover, how to adaptively adjust shifts during iterations so as to improve convergence is also discussed. Numerical results on the efficiency of the new algorithm are reported.