Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
DOI10.1137/050631574zbMATH Open1137.65019OpenAlexW1965358692MaRDI QIDQ5453549FDOQ5453549
Authors: Andreas Stathopoulos 
Publication date: 3 April 2008
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050631574
Recommendations
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. II. Interior eigenvalues
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
numerical examplespreconditioningJacobi-Davidson conjugate gradient methodlarge, sparse, Hermitian eigenvalue problemsnearly optimal methods
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)
Cited In (23)
- Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers
- Multigrid deflation for lattice QCD
- A multigrid accelerated eigensolver for the Hermitian Wilson-Dirac operator in lattice QCD
- A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
- A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems
- A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods
- A note on harmonic Ritz values and their reciprocals
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices
- On preconditioned eigensolvers and invert-Lanczos processes
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
- On convergence of iterative projection methods for symmetric eigenvalue problems
- A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices
- PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
- A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
- Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
- State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems
- Increasing the Performance of the Jacobi--Davidson Method by Blocking
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
This page was built for publication: Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453549)
