The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems

DOI10.1137/S0895479893246753MaRDI QIDQ4842568zbMATH OpenOpenAlexFDO

Authors Zhongxiao Jia

Publication date 31 March 1996

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479893246753

zbMATH Keywords

convergenceeigenvalueserror boundseigenvectorsorthonormal basisChebyshev polynomialKrylov subspaceRitz valuesorthogonal projectiondefectivenonderogatoryRitz vectorsLanczos methodsArnoldi's algorithmlarge unsymmetric matricesIOMs

Mathematics Subject Classification ID

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

Recommendations

• Generalized block Lanczos methods for large unsymmetric eigenproblems
• scientific article; zbMATH DE number 147692
• Sharpness in rates of convergence for the symmetric Lanczos method
• scientific article; zbMATH DE number 4143345
• scientific article; zbMATH DE number 805080

Cited in

(38)

• scientific article; zbMATH DE number 1500885 (Why is no real title available?)
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
• A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems.
• A refined shifted block inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
• scientific article; zbMATH DE number 147692 (Why is no real title available?)
• A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
• Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem
• Adaptation of the Lanczos and Arnoldi methods to the spectrum, or why the two Krylov subspace methods are powerful
• Residuals of refined projection methods for large matrix eigenproblems
• The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems
• Uniform accuracy of eigenpairs from a shift‐invert Lanczos method
• Theoretical and computable optimal subspace expansions for matrix eigenvalue problems
• An analysis of the Rayleigh-Ritz method for approximating eigenspaces
• A Convergence Analysis for Nonsymmetric Lanczos Algorithms
• The convergence of harmonic Ritz vectors and harmonic Ritz values, revisited
• A refined Jacobi-Davidson method and its correction equation
• GMRES and the minimal polynomial
• A block incomplete orthogonalization method for large nonsymmetric eigenproblems
• Composite orthogonal projection methods for large matrix eigenproblems
• scientific article; zbMATH DE number 4143345 (Why is no real title available?)
• A new method for accelerating Arnoldi algorithms for large scale eigenproblems
• Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
• The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
• 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
• scientific article; zbMATH DE number 5283736 (Why is no real title available?)
• A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
• A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
• Convergence of Arnoldi's method for generalized eigenvalue problems
• An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
• A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems
• On convergence of the generalized Lanczos trust-region method for trust-region subproblems
• A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
• The convergence of Krylov subspace methods for large unsymmetric linear systems
• The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
• A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm

Describes a project that uses

Uses Software

• eigs

This page was built for publication: The Convergence of Generalized 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 Q4842568)