A convergence proof of an iterative subspace method for eigenvalues problems
From MaRDI portal
A bound on the rate of convergence for Davidson type algorithms is given. Theoretical results proving convergence rates are shown. The use of multigrid as a preconditioner for the iterative subspace method and the advantages of implicit restarts are investigated. A new algorithm for calculating some other eigenvalues and their eigenvectors is described. For the entire collection see [Zbl 0857.00037].
Recommendations
- On the convergence rate of a preconditioned subspace eigensolver
- scientific article; zbMATH DE number 4078636
- scientific article; zbMATH DE number 766233
- Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems II: The Subspace Acceleration
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
Cited in
(7)- A parallel Davidson-type algorithm for several eigenvalues
- On the convergence rate of a preconditioned subspace eigensolver
- Smoothed-adaptive perturbed inverse iteration for elliptic eigenvalue problems
- scientific article; zbMATH DE number 4076522 (Why is no real title available?)
- Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems II: The Subspace Acceleration
- scientific article; zbMATH DE number 766233 (Why is no real title available?)
- On global convergence of subspace projection methods for Hermitian eigenvalue problems
This page was built for publication: A convergence proof of an iterative subspace method for eigenvalues problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336111)