An invert-free Arnoldi method for computing interior eigenpairs of large matrices

DOI10.1080/00207160701210331MaRDI QIDQ5297939zbMATH OpenOpenAlexFDO

Authors Qiang Niu, Linzhang Lu

Publication date 16 July 2007

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160701210331

zbMATH Keywords

interior eigenprobleminvert-free Arnoldi methodlarge symmetric matricesnumerical examplesshifted Krylov subspace method

Mathematics Subject Classification ID

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

Recommendations

• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
• A simpler harmonic Arnoldi method for computing interior eigenvalues of large matrices
• A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
• A variant on harmonic Arnoldi method
• Computing interior eigenvalues of large sparse symmetric matrices

Cites work

• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• A simpler GMRES
• An analysis of the Rayleigh-Ritz method for approximating eigenspaces
• An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
• An optimal bound for the spectral variation of two matrices
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• ARPACK Users' Guide
• Computing interior eigenvalues of large matrices
• Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
• Convergence of Restarted Krylov Subspaces to Invariant Subspaces
• Harmonic projection methods for large non-symmetric eigenvalue problems
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
• Numerical methods for large eigenvalue problems
• Sparse matrix test problems
• The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
• The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
• Thick-restart Lanczos method for large symmetric eigenvalue problems
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices

Cited in

(11)

• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
• A refined Arnoldi type method for large scale eigenvalue problems
• An extended shift-invert residual Arnoldi method
• A modified second-order Arnoldi method for solving the quadratic eigenvalue problems
• Computing interior eigenvalues of large sparse symmetric matrices
• Computing interior eigenvalues of conservative gyroscopic problems
• A simpler harmonic Arnoldi method for computing interior eigenvalues of large matrices
• Developing an improved shift-and-invert Arnoldi method
• scientific article; zbMATH DE number 2069268 (Why is no real title available?)
• Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method
• Computing interior eigenvalues of large matrices

Describes a project that uses

Uses Software

• ARPACK
• MatrixMarket
• Harwell-Boeing sparse matrix collection

This page was built for publication: An invert-free Arnoldi method for computing interior eigenpairs of large matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5297939)