TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems

DOI10.1137/17M1157568zbMATH Open1431.65047arXiv1711.10128OpenAlexW2964305349WikidataQ128085717 ScholiaQ128085717MaRDI QIDQ4632005FDOQ4632005

Author name not available (Why is that?)

Publication date: 25 April 2019

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1711.10128

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

zbMATH Keywords

thick-restartsymmetric eigenvalue problemsglobal quasi optimalitypreconditioned Lanczos

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited In (5)

• Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers
• 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
• Preconditioners for Krylov subspace methods: An overview
• A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems

Uses Software

• EIGIFP
• SLEPc
• eigs
• PRIMME
• BLOPEX
• TRLan
• IRAM
• SYM-ILDL
• PHSVDS
• PRIMME_SVDS
• DVDSON
• lobpcg.m

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)