Abstract
This paper presents a unified formulation of a class of the conjugate gradient-like algorithms for solving nonsymmetric linear systems. The common framework is the Petrov- Galerkin method on Krylov subspaces. We discuss some practical points concerning the methods and point out some of the interrelations between them.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 417-424 |
| Number of pages | 8 |
| Journal | Mathematics of Computation |
| Volume | 44 |
| Issue number | 170 |
| DOIs | |
| State | Published - Apr 1985 |