Changing poles in the rational Lanczos method for the Hermitian eigenvalue problem

DOI<link itemprop=identifier href="https://doi.org/10.1002/1099-1506(200101/02)8:1<33::AID-NLA226>3.0.CO;2-B" /><33::AID-NLA226>3.0.CO;2-B 10.1002/1099-1506(200101/02)8:1<33::AID-NLA226>3.0.CO;2-BzbMath1051.65040OpenAlexW2080606886MaRDI QIDQ4814571

Karl Meerbergen

Publication date: 7 September 2004

Full work available at URL: https://doi.org/10.1002/1099-1506(200101/02)8:1<33::aid-nla226>3.0.co;2-b

zbMATH Keywords

Lanczos methodeigenvectorsspectral transformationHermitian eigenvalue problemrational Krylov sequence

Mathematics Subject Classification ID

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

Related Items (5)

Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems ⋮ Strategies for spectrum slicing based on restarted Lanczos methods ⋮ On convergence of iterative projection methods for symmetric eigenvalue problems ⋮ Generalized Rational Krylov Decompositions with an Application to Rational Approximation ⋮ On the computation of a very large number of eigenvalues for selfadjoint elliptic operators by means of multigrid methods

Uses Software

• HSL
• ARPACK
• mctoolbox

Cites Work

• ARPACK Users' Guide
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Changing poles in the rational Lanczos method for the Hermitian eigenvalue problem