A priori error bounds on invariant subspace approximations by block Krylov subspaces

DOI10.1016/S0024-3795(02)00266-5zbMath1009.65021MaRDI QIDQ1611877

R. Smith

Publication date: 28 August 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

convergencespectruminvariant subspaceerror boundsprojection methodsblock Krylov subspace methodcluster of eigenvalues

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
• A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
• Arnoldi-Faber method for large non Hermitian eigenvalue problems
• Riccati-based preconditioner for computing invariant subspaces of large matrices
• An adaptive block Lanczos algorithm
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods

This page was built for publication: A priori error bounds on invariant subspace approximations by block Krylov subspaces