Davidson's method and preconditioning for generalized eigenvalue problems
From MaRDI portal
Publication:915368
DOI10.1016/0021-9991(90)90124-JzbMath0702.65038OpenAlexW1993598022MaRDI QIDQ915368
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
Related Items (8)
A subspace preconditioning algorithm for eigenvector/eigenvalue computation ⋮ Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices ⋮ Efficient solution of the simplified \(P_N\) equations ⋮ Davidson method for eigenpairs and their partial derivatives of generalized eigenvalue problems ⋮ Mesh independence of the generalized Davidson algorithm ⋮ New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem ⋮ A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc ⋮ Preconditioning eigenvalues and some comparison of solvers
Cites Work
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Super-matrix methods
- Block Preconditioning for the Conjugate Gradient Method
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- A method for calculating the extreme eigensolution of a real symmetric matrix of high order
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
This page was built for publication: Davidson's method and preconditioning for generalized eigenvalue problems
