Linearizing the Method of Conjugate Gradients

Serge Gratton, David Titley-Peloquin, Philippe Toint, Jean Tshimanga Ilunga

Research output: Contribution to journalArticlepeer-review

47 Downloads (Pure)

Abstract

The method of conjugate gradients (CG) is widely used for the iterative solution of large sparse systems of equations Ax=b, where A is symmetric positive definite. Let xk denote the k-th iterate of CG. In this paper we obtain an expression for Jk, the Jacobian matrix of xk with respect to b. We use this expression to obtain computable bounds on the spectral norm condition number of xk, and to design algorithms to compute or estimate Jk.v and JkT.v for a given vector v. We also discuss several applications in which these ideas may be used. Numerical experiments are performed to illustrate the theory.
Original languageEnglish
Pages (from-to)110-126
JournalSIAM Journal on Matrix Analysis and Applications
Volume35
Issue number1
Early online date14 Feb 2014
DOIs
Publication statusPublished - 2014

Keywords

  • linear algebra
  • conjugate gradients
  • sesnistivity analysis

Fingerprint Dive into the research topics of 'Linearizing the Method of Conjugate Gradients'. Together they form a unique fingerprint.

Cite this