Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- 1 July 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 13 (3) , 926-943
- https://doi.org/10.1137/0613056
Abstract
The Lanczos or biconjugate gradient method is often an effective means for solving nonsymmetric systems of linear equations. However, the method sometimes experiences breakdown, a near division by zero which may hinder or preclude convergence. In this paper we present some theoretical results on the nature and likelihood of the phenomenon of breakdown. We also define several new algorithms that substantially mitigate the problem of breakdown. Numerical comparisons of the new algorithms and the standard algorithms are given.Keywords
This publication has 27 references indexed in Scilit:
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient MatricesSIAM Journal on Scientific and Statistical Computing, 1992
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- A Taxonomy for Conjugate Gradient MethodsSIAM Journal on Numerical Analysis, 1990
- A generalized nonsymmetric Lanczos procedureComputer Physics Communications, 1989
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrencesLinear Algebra and its Applications, 1989
- Orthogonal Error MethodsSIAM Journal on Numerical Analysis, 1987
- A Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric MatricesNorth-Holland Mathematics Studies, 1986
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient MethodSIAM Journal on Numerical Analysis, 1984
- Conjugate gradient methods for indefinite systemsLecture Notes in Mathematics, 1976
- On Lanczos’ Algorithm for Tridiagonalizing MatricesSIAM Review, 1961