Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm

DOI10.1016/S0024-3795(98)10197-0zbMath0939.65056MaRDI QIDQ1301301

Zhongxiao Jia

Publication date: 13 July 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

shiftspolynomial characterizationrefined Arnoldi methodimplicit restarting scheme

Mathematics Subject Classification ID

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

Related Items (24)

Data Driven Modal Decompositions: Analysis and Enhancements ⋮ On refined Ritz vectors and polynomial characterization ⋮ A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices ⋮ Hybrid iterative refined restarted Lanczos bidiagonalization methods ⋮ A new shift strategy for the implicitly restarted refined harmonic Lanczos method ⋮ A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems ⋮ A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices ⋮ A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems. ⋮ An analysis of the Rayleigh--Ritz method for approximating eigenspaces ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ Augmented block Householder Arnoldi method ⋮ Applications of the Conjugate Gradient method in optimal surface parameterizations ⋮ A refined Jacobi-Davidson method and its correction equation ⋮ The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors ⋮ Residuals of refined projection methods for large matrix eigenproblems ⋮ An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets ⋮ 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 ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ 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 ⋮ A Hessenberg-type algorithm for computing PageRank problems

Uses Software

• eigs
• ARPACK
• JDQZ
• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing interior eigenvalues of large matrices
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
• Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
• Generalized block Lanczos methods for large unsymmetric eigenproblems
• Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
• 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
• Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
• A refined subspace iteration algorithm for large sparse eigenproblems
• Implicitly Restarted Arnoldi Methods and Subspace Iteration
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• ARPACK Users' Guide
• The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
• Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
• A new method for diagonalising large matrices
• The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• Harmonic projection methods for large non-symmetric eigenvalue problems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm