Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
From MaRDI portal
Publication:5453549
DOI10.1137/050631574zbMath1137.65019OpenAlexW1965358692MaRDI QIDQ5453549
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
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)
Related Items
A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices, Increasing the Performance of the Jacobi--Davidson Method by Blocking, A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems, A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems, A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods, A multigrid accelerated eigensolver for the Hermitian Wilson-Dirac operator in lattice QCD, Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers, Block Krylov-Schur method for large symmetric eigenvalue problems, TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems, State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems, Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems, A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation, JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices, On convergence of iterative projection methods for symmetric eigenvalue problems, On preconditioned eigensolvers and invert-Lanczos processes, PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations, A note on harmonic Ritz values and their reciprocals, A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices, Multigrid deflation for lattice QCD, A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc, Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides
