Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
type: Item
instance of: scholarly article
title: Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
zbMATH Open document ID: 0939.65056
DOI: 10.1016/S0024-3795(98)10197-0
author: Zhongxiao Jia
published in: Linear Algebra and its Applications
publication date: 2000-07-13T00:00:00Z
review text: A polynomial characterization of the refined Arnoldi method is given and the implicit restarting scheme of \textit{D. C. Sørensen} is applied [SIAM J. Matrix Anal. Appl. 13, No. 1, 357-385 (1992; Zbl 0763.65025)]. The roots of the polynomial are used as shifts.
Mathematics Subject Classification ID: 65F15
zbMATH DE Number: 1331752
zbMATH Keywords: polynomial characterization
zbMATH Keywords: refined Arnoldi method
zbMATH Keywords: implicit restarting scheme
zbMATH Keywords: shifts
reviewed by: F. Szidarovszky
describes a project that uses: eigs
describes a project that uses: IRAM
describes a project that uses: ARPACK
describes a project that uses: JDQZ
MaRDI profile type: Publication
cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem
cites work: Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
cites work: Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
cites work: Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
cites work: Q3359644
cites work: Q4851796
cites work: The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
cites work: Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
cites work: A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
cites work: Generalized block Lanczos methods for large unsymmetric eigenproblems
cites work: Q4719191
cites work: Composite orthogonal projection methods for large matrix eigenproblems
cites work: A refined subspace iteration algorithm for large sparse eigenproblems
cites work: The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
cites work: Implicitly restarted Arnoldi methods and subspace iteration
cites work: ARPACK Users' Guide
cites work: Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
cites work: On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
cites work: Computing interior eigenvalues of large matrices
cites work: On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
cites work: Harmonic projection methods for large non-symmetric eigenvalue problems
cites work: Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
cites work: Approximate solutions and eigenvalue bounds from Krylov subspaces
cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations
cites work: Numerical methods for large eigenvalue problems
cites work: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
cites work: Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
cites work: Q5558176
cites work: A new method for diagonalising large matrices
description: scientific article; zbMATH DE number 1331752