TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
From MaRDI portal
Publication:4632005
Abstract: The Lanczos method is one of the standard approaches for computing a few eigenpairs of a large, sparse, symmetric matrix. It is typically used with restarting to avoid unbounded growth of memory and computational requirements. Thick-restart Lanczos is a popular restarted variant because of its simplicity and numerically robustness. However, convergence can be slow for highly clustered eigenvalues so more effective restarting techniques and the use of preconditioning is needed. In this paper, we present a thick-restart preconditioned Lanczos method, TRPL+K, that combines the power of locally optimal restarting (+K) and preconditioning techniques with the efficiency of the thick-restart Lanczos method. TRPL+K employs an inner-outer scheme where the inner loop applies Lanczos on a preconditioned operator while the outer loop augments the resulting Lanczos subspace with certain vectors from the previous restart cycle to obtain eigenvector approximations with which it thick restarts the outer subspace. We first identify the differences from various relevant methods in the literature. Then, based on an optimization perspective, we show an asymptotic global quasi-optimality of a simplified TRPL+K method compared to an unrestarted global optimal method. Finally, we present extensive experiments showing that TRPL+K either outperforms or matches other state-of-the-art eigenmethods in both matrix-vector multiplications and computational time.
Recommendations
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- A scalable eigenvalue solver for symmetric tridiagonal matrices
- scientific article; zbMATH DE number 1507105
- Lanczos algorithms for large scale symmetric and nonsymmetric matrix eigenvalue problems
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Exploiting the Laguerre iteration for solving the symmetric tridiagonal eigenproblem
Cites work
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Computational Variants of the Lanczos Method for the Eigenproblem
- Computational methods for large eigenvalue problems
- Data mining. Concepts and techniques
- Deflated and Augmented Krylov Subspace Techniques
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
- Limited memory block Krylov subspace optimization for computing dominant singular value decompositions
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
- Nested Krylov methods based on GCR
- Numerical methods for large eigenvalue problems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
- SYM-ILDL: Incomplete LDL\(^{\mathrm T}\) factorization of symmetric indefinite and skew-symmetric matrices
- Spectral Schur complement techniques for symmetric eigenvalue problems
- State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems
- The Davidson Method
- The Geometry of Algorithms with Orthogonality Constraints
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Truncation Strategies for Optimal Krylov Subspace Methods
Cited in
(6)- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers
- Adaptive projection subspace dimension for the thick-restart Lanczos method
- A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
- Preconditioners for Krylov subspace methods: An overview
Describes a project that uses
Uses Software
This page was built for publication: TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632005)
