Davidson's method and preconditioning for generalized eigenvalue problems
From MaRDI portal
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 Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
Cited in
(13)- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
- Fault-tolerant parallel multigrid method on unstructured adaptive mesh
- Mesh independence of the generalized Davidson algorithm
- New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem
- 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
- Preconditioning eigenvalues and some comparison of solvers
- A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
- Davidson method for eigenpairs and their partial derivatives of generalized eigenvalue problems
- Efficient solution of the simplified \(P_N\) equations
- scientific article; zbMATH DE number 2127802 (Why is no real title available?)
- scientific article; zbMATH DE number 5013160 (Why is no real title available?)
- A subspace preconditioning algorithm for eigenvector/eigenvalue computation
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)