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

Arnoldi's algorithmChebyshev polynomialconvergencedefectiveeigenvalueseigenvectorserror boundsIOMsKrylov subspaceLanczos methodslarge unsymmetric matricesnonderogatoryorthogonal projectionorthonormal basisRitz valuesRitz vectors

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

(43)

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