Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method
From MaRDI portal
Publication:2989111
DOI10.1145/1824801.1824805zbMath1364.65089OpenAlexW2039917338WikidataQ59359370 ScholiaQ59359370MaRDI QIDQ2989111
Kesheng Wu, Horst D. Simon, Zhaojun Bai, Lin-Wang Wang, Ichitaro Yamazaki
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc899585/
Related Items (15)
Basic singular spectrum analysis and forecasting with R ⋮ A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems ⋮ A compact heart iteration for low-rank approximations of large matrices ⋮ Computing the smallest singular triplets of a large matrix ⋮ Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems ⋮ A block Chebyshev-Davidson method for linear response eigenvalue problems ⋮ A block Lanczos method for the linear response eigenvalue problem ⋮ The numerical rank of Krylov matrices ⋮ On convergence of iterative projection methods for symmetric eigenvalue problems ⋮ A cross-product approach for low-rank approximations of large matrices ⋮ A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems ⋮ An Out-of-Core Eigen-Solver with OpenMP Parallel Scheme for Large Spare Damped System ⋮ The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software ⋮ Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs ⋮ Computing interior eigenvalues of large sparse symmetric matrices
Uses Software
This page was built for publication: Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method
