Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices
Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices
复制标题
DOI：
10.1137/0907054
复制
发表时间：
1986-07
期刊：
影响因子：
--
通讯作者：
R. Morgan;D. Scott
中科院分区：
文献类型：
--
作者：
R. Morgan;D. Scott
This paper analyzes Davidson’s method for computing a few eigenpairs of large sparse symmetric matrices. An explanation is given for why Davidson’s method often performs well but occasionally performs very badly. Davidson’s method is then generalized to a method which offers a powerful way of applying preconditioning techniques developed for solving systems of linear equations to solving eigenvalue problems.
