Generalized block Lanczos methods for large unsymmetric eigenproblems

DOI10.1007/S002110050367MaRDI QIDQ1266316zbMATH OpenOpenAlexFDO

Authors Zhongxiao Jia

Publication date 9 April 1999

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002110050367

zbMATH Keywords

block Arnoldi methodsblock Krylov subspaceclustered eigenvalueseigenvectorserror boundsgeneralized block Lanczos methodsRitz elements

Mathematics Subject Classification ID

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

Review text

The author analyzes the convergence of the methods named in the title for diagonalizable matrices. Upper bounds for the distances between normalized eigenvectors and a block Krylov subspace are derived, and a priori theoretical error bounds for Ritz elements are established. Some emphasis is given to problems with multiple or clustered eigenvalues for which the classical (nonblock) generalized Lanczos methods strike difficulties.

Recommendations

• The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
• scientific article; zbMATH DE number 805080
• scientific article; zbMATH DE number 147692

Cited in

(26)

• A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems
• Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
• Composite orthogonal projection methods for large matrix eigenproblems
• A block Lanczos method for the linear response eigenvalue problem
• An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
• The block Lanczos method for linear systems with multiple right-hand sides
• A block incomplete orthogonalization method for large nonsymmetric eigenproblems
• A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
• Convergence properties of block GMRES and matrix polynomials
• scientific article; zbMATH DE number 4143345 (Why is no real title available?)
• scientific article; zbMATH DE number 3932293 (Why is no real title available?)
• scientific article; zbMATH DE number 4070184 (Why is no real title available?)
• scientific article; zbMATH DE number 147692 (Why is no real title available?)
• Convergence estimates of nonrestarted and restarted block-Lanczos methods.
• The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
• ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
• Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
• The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
• scientific article; zbMATH DE number 805080 (Why is no real title available?)
• Convergence of the block Lanczos method for eigenvalue clusters
• scientific article; zbMATH DE number 238289 (Why is no real title available?)
• Residuals of refined projection methods for large matrix eigenproblems
• Deflated block Krylov subspace methods for large scale eigenvalue problems
• A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems

Describes a project that uses

Uses Software

• eigs

This page was built for publication: Generalized block Lanczos methods for large unsymmetric eigenproblems

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