A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
From MaRDI portal
Publication:1416322
DOI10.1016/S0898-1221(02)00220-1zbMath1035.65036MaRDI QIDQ1416322
Publication date: 14 December 2003
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
algorithm; comparison of methods; numerical examples; eigenvalues; eigenvectors; Convergence; Arnoldi method; singular value decompositions; Ritz vector; Ritz value; Large generalized eigenproblem; Matrix pair; Refined Arnoldi method; Shift-and-invert
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
An Inexact Shift-and-Invert Arnoldi Algorithm for Large Non-Hermitian Generalised Toeplitz Eigenproblems, A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm, A new algorithm for computing the inertia of eigenproblems \((Ax=\lambda x)\) and \((Ax=\lambda Bx)\), The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices, Regularized least squares locality preserving projections with applications to image recognition, Convergence of Arnoldi's method for generalized eigenvalue problems, Successive linear Newton interpolation methods for solving the large-scale nonlinear eigenvalue problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Rational Krylov sequence methods for eigenvalue computation
- Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
- 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
- Composite orthogonal projection methods for large matrix eigenproblems
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- A refined subspace iteration algorithm for large sparse eigenproblems
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Matrix Algorithms
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- Residuals of refined projection methods for large matrix eigenproblems