A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix

DOI10.1016/0010-4655(94)90073-6zbMath0878.65029MaRDI QIDQ1365898

Charlotte Froese Fischer, Andreas Stathopoulos

Publication date: 9 September 1997

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4655(94)90073-6

zbMATH Keywords

algorithm; Lanczos method; eigenvectors; sparse matrix; Davidson method; matrix-vector multiplication; selected eigenvalues; large, real, symmetric matrix; Davidson program

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

15-04: Software, source code, etc. for problems pertaining to linear algebra

Related Items

Charlotte Froese Fischer -- some personal reflections, RELCI: A program for relativistic configuration interaction calculations, JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices, An object-oriented C++ implementation of Davidson method for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix, The grasp2k relativistic atomic structure package, A parallel Davidson-type algorithm for several eigenvalues, New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem, Implementation of time-dependent density functional response equations, Robust preconditioning of large, sparse, symmetric eigenvalue problems, Solution of large eigenvalue problems in electronic structure calculations

Uses Software

• HSL
• LAPACK
• BLAS
• EISPACK
• DVDSON

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Super-matrix methods
• SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS
• The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• An extended set of FORTRAN basic linear algebra subprograms
• A method for calculating the extreme eigensolution of a real symmetric matrix of high order
• Basic Linear Algebra Subprograms for Fortran Usage
• Computational Variants of the Lanczos Method for the Eigenproblem