Look-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences

Authors:
Martin H. Gutknecht;Klaus J. Ressel
Affiliations:
-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2000

Citing 0
Cited 3

VPAStab(J,L): An iterative method with look-ahead for the solution of large sparse linear systems

Journal of Computational and Applied Mathematics
Exploiting BiCGstab($\ell$) Strategies to Induce Dimension Reduction

SIAM Journal on Scientific Computing
Restarting the Nonsymmetric Lanczos Algorithm for Eigenvalues and Linear Equations Including Multiple Right-Hand Sides

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lanczos-type product methods for the solution of large sparse non-Hermitian linear systems either square the Lanczos process or combine it with a local minimization of the residual. They inherit from the underlying Lanczos process the danger of breakdown. For various Lanczos-type product methods that are based on the Lanczos three-term recurrence, look-ahead versions are presented which avoid such breakdowns or near-breakdowns at the cost of a small computational overhead. Different look-ahead strategies are discussed and their efficiency is demonstrated by several numerical examples.