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

DOI10.1016/0021-9991(89)90043-0MaRDI QIDQ1122939zbMATH OpenOpenAlexFDO

Authors 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

algorithmeigenvaluesGauss- Seidel relaxationiterative methodsymmetric matrices

Mathematics Subject Classification ID

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

Review text

This work is directed towards obtaining an algorithm for matrix eigenvalues that arise from the discretization of self-adjoint partial differential equations. The most time-consuming parts of the proposed algorithm are a matrix multiplication and a Gauss-Seidel relaxation step which are performed on each iteration. The described method represents a reasonable compromise between simplicity, efficiency and robustness; it can handle matrices that exceed the physical memory size without serious performance degradation.

Recommendations

• A numerical method of determining eigenvalues of matrices of arbitrary large size
• An algorithm for computing eigenvalues and eigenvectors of real and symmetric matrix
• A simple iterative algorithm for generating selected eigenspaces of large matrices
• scientific article; zbMATH DE number 4090688
• scientific article; zbMATH DE number 2206802

Cites work

• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• A new method for diagonalising large matrices
• A new splitting to solve a large Hermitian eigenproblem
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• scientific article; zbMATH DE number 3917549 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• Matrix eigensystem routines. EISPACK guide extension
• Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices

Cited in

(4)

• Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
• Solution of large eigenvalue problems in electronic structure calculations
• A simple iterative algorithm for generating selected eigenspaces of large matrices
• A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc

Describes a project that uses

Uses Software

• EISPACK

This page was built for publication: A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122939)