Acta Numerica

Research Article

Iterative solution of linear systems

Roland W. Freunda1*, Gene H. Goluba2 and Noël M. Nachtigala3

a1 RIACS, Mail Stop Ellis Street NASA Ames Research Center Moffett Field, CA 94035, USA, E-mail: na.freund@na-net.ornl.gov

a2 Computer Science Department Stanford University, Stanford, CA 94305, USA, E-mail: golub@sccm.stanford.edu

a3 RIACS, Mail Stop Ellis Street NASA Ames Research Center Moffett Field, CA 94035, USA, E-mail: na.nachtigal@na-net.ornl.gov

Abstract

Recent advances in the field of iterative methods for solving large linear systems are reviewed. The main focus is on developments in the area of conjugate gradient-type algorithms and Krylov subspace methods for nonHermitian matrices.

Footnotes

* The work of this author was supported by DARPA via Cooperative Agreement NCC 2-387 between NASA and the Universities Space Research Association (USRA).

† The work of this author was supported in part by the National Science Foundation under Grant NSF CCR-8821078.

‡ The work of this author was supported by Cooperative Agreement NCC 2-387 between NASA and the Universities Space Research Association (USRA).