Krylov subspace methods for solving large unsymmetric linear systems

Research output: Contribution to journalArticlepeer-review

339 Scopus citations


Some algorithms based upon a projection process onto the Krylov subspace are developed, generalizing the method of conjugate gradients to unsymmetric systems. These methods are extensions of Arnoldis algorithm for solving eigenvalue problems. The convergence is analyzed in terms of the distance of the solution to the subspace Km and some error bounds are established showing, in particular, a similarity with the conjugate gradient method (for symmetric matrices) when the eigenvalues are real. Several numerical experiments are described and discussed.

Original languageEnglish (US)
Pages (from-to)105-126
Number of pages22
JournalMathematics of Computation
Issue number155
StatePublished - Jul 1981


Dive into the research topics of 'Krylov subspace methods for solving large unsymmetric linear systems'. Together they form a unique fingerprint.

Cite this