Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
Authors:
- Jane CullumJCJane Cullum
- Anne GreenbaumAGAnne Greenbaum
- 1 April 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 17 (2) , 223-247
Abstract
Several iterative methods for solving linear systems $Ax = b$ first construct a basis for a Krylov subspace and then use the basis vectors, together with the Hessenberg (or tridiagonal) matrix generated during that construction, to obtain an approximate solution to the linear system. To determine the approximate solution, it is necessary to solve either a linear system with the Hessenberg matrix as coefficient matrix or an extended Hessenberg least squares problem. In the first case, referred to as a Galerkin method, the residual is orthogonal to the Krylov subspace, whereas in the second case, referred to as a norm-minimizing method, the residual (or a related quantity) is minimized over the Krylov subspace. Examples of such pairs include the full orthogonalization method (FOM) (Arnoldi) and generalized minimal residual (GMRES) algorithms, the biconjugate gradient (BCG) and quasi-minimal residual (QMR) algorithms, and their symmetric equivalents, the Lanczos and minimal residual (MINRES) algorithms. A re...
Keywords
This publication has 23 references indexed in Scilit:
- Numerical stability of GMRESBIT Numerical Mathematics, 1995
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear SystemsSIAM Journal on Scientific Computing, 1993
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian MatricesSIAM Journal on Scientific Computing, 1993
- A breakdown-free Lanczos type algorithm for solving linear systemsNumerische Mathematik, 1992
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- A Theoretical Comparison of the Arnoldi and GMRES AlgorithmsSIAM Journal on Scientific and Statistical Computing, 1991
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrencesLinear Algebra and its Applications, 1989
- Conjugate gradient methods for indefinite systems1976
- Calculating the Singular Values and Pseudo-Inverse of a MatrixJournal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1965
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951