Generalized block Lanczos methods for large unsymmetric eigenproblems
From MaRDI portal
Publication:1266316
DOI10.1007/s002110050367zbMath0910.65018OpenAlexW2039510785MaRDI QIDQ1266316
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
eigenvectorserror boundsblock Krylov subspaceblock Arnoldi methodsclustered eigenvaluesgeneralized block Lanczos methodsRitz elements
Related Items
The block Lanczos method for linear systems with multiple right-hand sides ⋮ 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 ⋮ Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method ⋮ 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 ⋮ 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 ⋮ An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems ⋮ Convergence properties of block GMRES and matrix polynomials ⋮ 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
Uses Software
