Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
From MaRDI portal
Publication:3525960
DOI10.1137/060661910zbMath1151.65320OpenAlexW4232347666MaRDI QIDQ3525960
Andreas Stathopoulos, James R. McCombs
Publication date: 23 September 2008
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060661910
eigenvaluespreconditioningoptimalityconjugate gradient methodNewton methodJacobi-Davidson methodARPACK
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Increasing the Performance of the Jacobi--Davidson Method by Blocking, Accelerating large partial EVD/SVD calculations by filtered block Davidson methods, Trace-penalty minimization for large-scale eigenspace computation, 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 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, Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method, 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, Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation, On convergence of iterative projection methods for symmetric eigenvalue problems, A note on harmonic Ritz values and their reciprocals, 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
Uses Software
