The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
From MaRDI portal
Publication:4842568
DOI10.1137/S0895479893246753zbMath0834.65021OpenAlexW1990972291MaRDI QIDQ4842568
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
convergenceeigenvalueseigenvectorserror boundsorthonormal basisRitz valuesLanczos methodsChebyshev polynomialorthogonal projectionKrylov subspacedefectivenonderogatoryRitz vectorsArnoldi's algorithmlarge unsymmetric matricesIOMs
Related Items
The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems, Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems, Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems, A block incomplete orthogonalization method for large nonsymmetric eigenproblems, A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems, A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems, The Convergence of Harmonic Ritz Vectors and Harmonic Ritz Values, Revisited, A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems, A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems., An analysis of the Rayleigh--Ritz method for approximating eigenspaces, Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method, Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems, A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems, A refined Jacobi-Davidson method and its correction equation, The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors, A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices, Residuals of refined projection methods for large matrix eigenproblems, Convergence of Arnoldi's method for generalized eigenvalue problems, An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems, A new method for accelerating Arnoldi algorithms for large scale eigenproblems, GMRES and the minimal polynomial, Composite orthogonal projection methods for large matrix 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, The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem, The convergence of Krylov subspace methods for large unsymmetric linear systems, The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices, A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
Uses Software
