Lanczos-type solvers for nonsymmetric linear systems of equations
- 1 January 1997
- journal article
- research article
- Published by Cambridge University Press (CUP) in Acta Numerica
- Vol. 6, 271-397
- https://doi.org/10.1017/s0962492900002737
Abstract
Among the iterative methods for solving large linear systems with a sparse (or, possibly, structured) nonsymmetric matrix, those that are based on the Lanczos process feature short recurrences for the generation of the Krylov space. This means low cost and low memory requirement. This review article introduces the reader not only to the basic forms of the Lanczos process and some of the related theory, but also describes in detail a number of solvers that are based on it, including those that are considered to be the most efficient ones. Possible breakdowns of the algorithms and ways to cure them by look-ahead are also discussed.Keywords
This publication has 113 references indexed in Scilit:
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue ProblemMathematics of Computation, 1994
- A Breakdown-Free Variation of the Nonsymmetric Lanczos AlgorithmsMathematics of Computation, 1994
- A Convergence Analysis for Nonsymmetric Lanczos AlgorithmsMathematics of Computation, 1991
- A Look-Ahead Lanczos Algorithm for Unsymmetric MatricesMathematics of Computation, 1985
- The Lanczos Algorithm With Partial ReorthogonalizationMathematics of Computation, 1984
- Krylov Subspace Methods for Solving Large Unsymmetric Linear SystemsMathematics of Computation, 1981
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric MatricesMathematics of Computation, 1979
- The Lanczos Algorithm with Selective OrthogonalizationMathematics of Computation, 1979
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-MatrixMathematics of Computation, 1977
- Estimates for Some Computational Techniques in Linear AlgebraMathematics of Computation, 1966