论文信息 - Iterative calculation of eigenvalues and eigenvectors of large, real matrix systems with overlap

Iterative calculation of eigenvalues and eigenvectors of large, real matrix systems with overlap

An improved method for obtaining a few eigenvalues and eigenvectors of the symmetric matrix system is presented: \documentclass{article}\pagestyle{empty}\begin{document}$$(A - \lambda S)c = 0$$\end{document} where S ≠ I. The method allows us to handle larger systems more easily than any other known to the author. It requires the inversion of S, and N3 step, but thereafter each eigenvector and eigenvalue is obtained in a length of time proportional to N2. The relation of this method to the MOR and MMOR methods developed recently for handling the case, S = I, is discussed.

G. Gallup

[1] C. Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[2] J. H. Wilkinson. The algebraic eigenvalue problem , 1966 .

[3] C. Bender,et al. The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices , 1973 .

[4] G. G. Hall,et al. The generalized eigenvalue problem in quantum chemistry , 1974 .

[5] E. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices , 1975 .

[6] W. Butscher,et al. Modification of Davidson's Method for the Calculation of Eigenvalues and Eigenvectors of Large Real-Symmetric Matrices: , 1976 .

[7] G. Gallup. The intermolecular potential and its angular dependence for two H2 molecules , 1977 .

[8] D. M. Bishop,et al. The group-coordinate relaxation method for solving the generalized eigenvalue problem for large real-symmetric matrices , 1977 .