A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
DOI10.1016/0010-4655(94)90073-6zbMATH Open0878.65029OpenAlexW2001557869MaRDI QIDQ1365898FDOQ1365898
Authors: Andreas Stathopoulos, Charlotte Froese Fischer 
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
Recommendations
- Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems
- An object-oriented C++ implementation of Davidson method for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- The Davidson Method
sparse matrixeigenvectorsalgorithmmatrix-vector multiplicationLanczos methodDavidson methodselected eigenvalueslarge, real, symmetric matrixDavidson program
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cites Work
- Title not available (Why is that?)
- An extended set of FORTRAN basic linear algebra subprograms
- Basic Linear Algebra Subprograms for Fortran Usage
- Title not available (Why is that?)
- Computational Variants of the Lanczos Method for the Eigenproblem
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Super-matrix methods
- Matrix eigensystem routines. EISPACK guide extension
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
- A method for calculating the extreme eigensolution of a real symmetric matrix of high order
- SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS
Cited In (24)
- Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
- Solution of large eigenvalue problems in electronic structure calculations
- An efficient Gauss-Newton algorithm for symmetric low-rank product matrix approximations
- GRASP2018 -- a Fortran 95 version of the general relativistic atomic structure package
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- Reducing the computational load -- atomic multiconfiguration calculations based on configuration state function generators
- 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
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
- Algorithm 827
- A block preconditioned harmonic projection method for large-scale nonlinear eigenvalue problems
- The grasp2k relativistic atomic structure package
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- RELCI: A program for relativistic configuration interaction calculations
- Stochastic Gauss-Newton algorithms for online PCA
- An object-oriented C++ implementation of Davidson method for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- Charlotte Froese Fischer -- some personal reflections
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- The subspace projected approximate matrix (SPAM) modification of the Davidson method
- UKRmol+: a suite for modelling electronic processes in molecules interacting with electrons, positrons and photons using the R-matrix method
- Accelerating convergence by augmented Rayleigh-Ritz projections for large-scale eigenpair computation
- The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
Uses Software
This page was built for publication: A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365898)
