A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.

DOI10.1016/S0898-1221(02)00220-1zbMath1035.65036MaRDI QIDQ1416322

Yong Zhang, Zhongxiao Jia

Publication date: 14 December 2003

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmcomparison of methodsnumerical exampleseigenvalueseigenvectorsConvergenceArnoldi methodsingular value decompositionsRitz vectorRitz valueLarge generalized eigenproblemMatrix pairRefined Arnoldi methodShift-and-invert

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

Successive linear Newton interpolation methods for solving the large-scale nonlinear eigenvalue problems, An Inexact Shift-and-Invert Arnoldi Algorithm for Large Non-Hermitian Generalised Toeplitz Eigenproblems, Regularized least squares locality preserving projections with applications to image recognition, A new algorithm for computing the inertia of eigenproblems \((Ax=\lambda x)\) and \((Ax=\lambda Bx)\), Convergence of Arnoldi's method for generalized eigenvalue problems, A method for computing a few eigenpairs of large generalized eigenvalue problems, 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

• Partial Differential Equation Toolbox

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