Convergence estimates of nonrestarted and restarted block-Lanczos methods.

DOI10.1002/NLA.2182OpenAlexW2898934941WikidataQ129970836 ScholiaQ129970836MaRDI QIDQ4558719FDOQ4558719

Authors: Ming Zhou 

Publication date: 29 November 2018

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.2182

Recommendations

• Convergence of the block Lanczos method for eigenvalue clusters
• Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
• scientific article; zbMATH DE number 147692
• Generalized block Lanczos methods for large unsymmetric eigenproblems
• Restarting the nonsymmetric Lanczos algorithm for eigenvalues and linear equations including multiple right-hand sides

zbMATH Keywords

multigridKrylov subspaceLanczos methodRayleigh quotientelliptic eigenvalue problemRayleigh-Ritz procedureblock iterative methods

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited In (8)

• Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers
• Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers
• Theoretical error bounds on the convergence of the Lanczos and block-Lanczos methods
• Convergence of the block Lanczos method for eigenvalue clusters
• Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
• Convergence analysis of the nonlinear block scaled ABS methods
• Dealing with linear dependence during the iterations of the restarted block Lanczos methods
• Cluster robust estimates for block gradient-type eigensolvers

This page was built for publication: Convergence estimates of nonrestarted and restarted block-Lanczos methods.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558719)