An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices
暂无分享，去创建一个
[1] Matrices and Tensors , 1963 .
[2] R. Nesbet. Algorithm for Diagonalization of Large Matrices , 1965 .
[3] I. Shavitt. Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices , 1970 .
[4] Poul Jørgensen,et al. Time‐dependent Hartree–Fock calculations in the Pariser–Parr–Pople model. Applications to aniline, azulene and pyridine , 1970 .
[5] C. Bender,et al. An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix , 1970 .
[6] R. Nisbet. Acceleration of the convergence in Nesbet's algorithm for eigenvalues and eigenvectors of large matrices , 1972 .
[7] C. Bender,et al. The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices , 1973 .
[8] E. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices , 1975 .
[9] R. Mcweeny,et al. The use of biorthogonal sets in valence bond calculations , 1975 .
[10] R. Raffenetti. A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems , 1979 .
[11] J. Flament,et al. Equations‐of‐motion method: Calculation of the k lowest or highest solutions , 1979 .
[12] E. Davidson. Comments on the Kalamboukis tests of the Davidson algorithm , 1980 .