A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
From MaRDI portal
Publication:1377506
DOI10.1016/S0024-3795(97)00023-2zbMath0896.65035MaRDI QIDQ1377506
Publication date: 22 September 1998
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
convergencesingular value decompositioneigenvectorArnoldi methodKrylov subspaceRitz vectorRitz valueunsymmetric eigenproblem
Related Items (20)
A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems ⋮ A new shift strategy for the implicitly restarted refined harmonic Lanczos method ⋮ A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems. ⋮ An analysis of the Rayleigh--Ritz method for approximating eigenspaces ⋮ On expansion of search subspaces for large non-Hermitian eigenproblems ⋮ Augmented block Householder Arnoldi method ⋮ Deflated block Krylov subspace methods for large scale 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 ⋮ An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets ⋮ An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems ⋮ Deflation in Krylov subspace methods and distance to uncontrollability ⋮ 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 ⋮ On the use of harmonic Ritz pairs in approximating internal eigenpairs ⋮ 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
Cites Work
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Large-scale complex eigenvalue problems
- Generalized block Lanczos methods for large unsymmetric eigenproblems
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Tchebychev acceleration technique for large scale nonsymmetric matrices
- A block incomplete orthogonalization method for large nonsymmetric eigenproblems
- A refined subspace iteration algorithm for large sparse eigenproblems
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
