Davidson's method and preconditioning for generalized eigenvalue problems

DOI10.1016/0021-9991(90)90124-JMaRDI QIDQ915368zbMATH OpenOpenAlexFDO

Authors Ronald B. Morgan

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0021-9991(90)90124-j

zbMATH Keywords

Davidson's methodgeneralized eigenvalue problempreconditionersquantum chemistry

Mathematics Subject Classification ID

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

Review text

The generalized eigenvalue problem (1) \(Az=\lambda Sz\) is solved, where A is symmetric and S is symmetric and positive definite. Davidson's method and a generalized Davidson's method with different preconditioners are considered. These methods for problem (1) in quantum chemistry are discussed and compared.

Recommendations

• Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems I: The Preconditioning Aspect
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• The Davidson Method
• Inexact Newton preconditioning techniques for large symmetric eigenvalue problems
• Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems II: The Subspace Acceleration

Cites work

• A method for calculating the extreme eigensolution of a real symmetric matrix of high order
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Block Preconditioning for the Conjugate Gradient Method
• Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• Super-matrix methods
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems

Cited in

(15)

• Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
• New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem
• Preconditioning eigenvalues and some comparison of solvers
• scientific article; zbMATH DE number 2127802 (Why is no real title available?)
• scientific article; zbMATH DE number 5013160 (Why is no real title available?)
• Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems I: The Preconditioning Aspect
• Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems II: The Subspace Acceleration
• Davidson method for eigenpairs and their partial derivatives of generalized eigenvalue problems
• A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
• Fault-tolerant parallel multigrid method on unstructured adaptive mesh
• A subspace preconditioning algorithm for eigenvector/eigenvalue computation
• A subspace method for large-scale trace ratio problems
• Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections
• Efficient solution of the simplified \(P_N\) equations
• Mesh independence of the generalized Davidson algorithm

This page was built for publication: Davidson's method and preconditioning for generalized eigenvalue problems

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