摘要

The block Arnoldi method is one of the most commonly used techniques for large eigenproblems. In this paper, we exploit certain modified Ritz vectors to take the place of Ritz vectors in the thick-restarted block Arnoldi algorithm, and propose a modified thick-restarted block Arnoldi algorithm for large eigenproblems. We then consider how to periodically combine the refined subspace iterative method with the modified thick-restarting block Arnoldi algorithm for computing a few dominant eigenpairs of a large matrix. The resulting algorithm is called a Subspace-Block Arnoldi algorithm. Numerical experiments show the efficiency of our new algorithms.