Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices

DOI10.1016/0021-9991(70)90010-0zbMath0209.17701OpenAlexW2065916059MaRDI QIDQ2543549

I. Shavitt

Publication date: 1970

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(70)90010-0

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Related Items

Super-matrix methods ⋮ The method of coordinate overrelaxation for \((A-\lambda B)x = 0\) ⋮ A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems ⋮ Computational methods of linear algebra ⋮ An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices ⋮ The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices ⋮ A new approach to the determination of several eigenvectors of a large Hermitian matrix ⋮ An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix ⋮ The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order ⋮ Acceleration of the convergence in Nesbet's algorithm for eigenvalues and eigenvectors of large matrices ⋮ The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:3926873 Simultane Iterationsverfahren f�r gro�e allgemeine Eigenwertprobleme] ⋮ Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix

Cites Work

• Round-off errors in variational calculations
• Unnamed Item