Low-Rank Modification of the Unsymmetric Lanczos Algorithm

DOI10.2307/2153372zbMath0848.65020OpenAlexW2085613098MaRDI QIDQ4878513

Thomas Kilian Huckle

Publication date: 14 May 1996

Full work available at URL: https://doi.org/10.2307/2153372

zbMATH Keywords

convergencenumerical exampleseigenvaluesLanczos methodunsymmetric matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Related Items

A linear system solver based on a modified Krylov subspace method for breakdown recovery

Cites Work

• Unnamed Item
• Unnamed Item
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
• Reduction to Tridiagonal Form and Minimal Realizations
• A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices

This page was built for publication: Low-Rank Modification of the Unsymmetric Lanczos Algorithm