Conjugate gradient-like algorithms for solving nonsymmetric linear systems

Research output: Contribution to journalArticlepeer-review

132 Scopus citations

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 languageEnglish (US)
Pages (from-to)417-424
Number of pages8
JournalMathematics of Computation
Volume44
Issue number170
DOIs
StatePublished - Apr 1985

Fingerprint Dive into the research topics of 'Conjugate gradient-like algorithms for solving nonsymmetric linear systems'. Together they form a unique fingerprint.

Cite this