Bootstrapped block Lanczos for large-dimension eigenvalue problems
From MaRDI portal
Publication:6112688
DOI10.1016/j.cpc.2023.108835zbMath1522.65053arXiv2210.15763OpenAlexW4381547409MaRDI QIDQ6112688
Ryan M. Zbikowski, Calvin W. Johnson
Publication date: 7 August 2023
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.15763
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations
- A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors
This page was built for publication: Bootstrapped block Lanczos for large-dimension eigenvalue problems