Preconditioning Block Lanczos Algorithm for Solving Symmetric Eigenvalue Problems

Author(s)

Abstract

A preconditioned iterative method for computing a few eigenpairs of large sparse symmetric matrices is presented in this paper. The proposed method which combines the preconditioning techniques with the efficiency of block Lanczos algorithm is suitable for determination of the extreme eigenvalues as well as their multiplicities. The global convergence and the asymptotically quadratic convergence of the new method are also demonstrated.  

About this article

Abstract View

  • 33611

Pdf View

  • 3628

How to Cite

Preconditioning Block Lanczos Algorithm for Solving Symmetric Eigenvalue Problems. (2000). Journal of Computational Mathematics, 18(4), 365-374. https://global-sci.com/index.php/JCM/article/view/11373