A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices

DOI10.1016/0021-9991(89)90043-0zbMath0676.65026OpenAlexW2010404145MaRDI QIDQ1122939

Ramesh Natarajan, David Vanderbilt

Publication date: 1989

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

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

zbMATH Keywords

algorithmeigenvaluesiterative methodsymmetric matricesGauss- Seidel relaxation

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

Iterative methods for the computation of a few eigenvalues of a large symmetric matrix, A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc

Uses Software

• EISPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Matrix eigensystem routines. EISPACK guide extension
• A new splitting to solve a large Hermitian eigenproblem
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• A new method for diagonalising large matrices