A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems

作者:

Highlights:

摘要

The inverse-free preconditioned Krylov subspace method of Golub and Ye [G.H. Golub, Q. Ye, An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems, SIAM J. Sci. Comp. 24 (2002) 312–334] is an efficient algorithm for computing a few extreme eigenvalues of the symmetric generalized eigenvalue problem. In this paper, we first present an analysis of the preconditioning strategy based on incomplete factorizations. We then extend the method by developing a block generalization for computing multiple or severely clustered eigenvalues and develop a robust black-box implementation. Numerical examples are given to illustrate the analysis and the efficiency of the block algorithm.

论文关键词:Eigenvalue problem,Block Krylov subspace method,Arnoldi algorithm,Preconditioning

论文评审过程:Received 27 April 2007, Available online 27 February 2009.

论文官网地址:https://doi.org/10.1016/j.cam.2008.10.071