Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
From MaRDI portal
(Redirected from Publication:5453549)
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
Cited in
(26)- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
- Multigrid deflation for lattice QCD
- Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers
- Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
- A new subspace iteration algorithm for solving generalized eigenvalue problems in vibration analysis
- 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 note on harmonic Ritz values and their reciprocals
- A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- 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
- EPIC: a provable accelerated eigensolver based on preconditioning and implicit convexity
- A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
- Increasing the performance of the Jacobi-Davidson method by blocking
- A block preconditioned harmonic projection method for large-scale nonlinear eigenvalue problems
- 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
- A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides.
- PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations
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)
