Implementation of the GMRES Method Using Householder Transformations
Author:
- Homer F. WalkerHWHomer F. Walker
- 1 January 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 9 (1) , 152-163
Abstract
The standard implementation of the GMRES method for solving large nonsymmetric linear systems involves a Gram-Schmidt process which is a potential source of significant numerical error. An alternative implementation is outlined here in which orthogonalization by Householder transformations replaces the Gram-Schmidt process. This implementation requires slightly less storage but somewhat more arithmetic than the standard one; however, numerical experiments suggest that it is more stable, especially as the limits of residual reduction are reached. The extra arithmetic required may be less significant when products of the coefficient matrix with vectors are expensive or on vector and, in particular, parallel machines.Keywords
This publication has 6 references indexed in Scilit:
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1986
- Matrix-Free Methods for Stiff Systems of ODE’sSIAM Journal on Numerical Analysis, 1986
- GMRES acceleration of computational fluid dynamics codes1985
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1984
- Krylov subspace methods for solving large unsymmetric linear systemsMathematics of Computation, 1981
- Solving linear least squares problems by Gram-Schmidt orthogonalizationBIT Numerical Mathematics, 1967