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 ...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. [ABSTRACT FROM AUTHOR]展开更多
基金National Natural Science Foundation of ChinaJiangsu Province Natural Science FoundationJiangsu Province "333 Engineering
文摘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. [ABSTRACT FROM AUTHOR]
