Conjugate gradient-like algorithms for solving nonsymmetric linear systems

Source 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.