Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



A look-ahead Lánczos algorithm for unsymmetric matrices

Authors: Beresford N. Parlett, Derek R. Taylor and Zhishun A. Liu
Journal: Math. Comp. 44 (1985), 105-124
MSC: Primary 65F15
MathSciNet review: 771034
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The two-sided Lanczos algorithm sometimes suffers from serious breakdowns. These occur when the associated moment matrix does not permit triangular factorization. We modify the algorithm slightly so that it corresponds to using a $2 \times 2$ pivot in triangular factorization whenever a $1 \times 1$ pivot would be dangerous. The likelihood of breakdown is greatly reduced. The price paid is that the tridiagonal matrix produced by the algorithm now has bumps whenever a $2 \times 2$ pivot is used. Experiments with several versions of the algorithm on a variety of matrices are described, including some large problems arising in the study of plasma instability.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F15

Retrieve articles in all journals with MSC: 65F15

Additional Information

Article copyright: © Copyright 1985 American Mathematical Society