OurBigBook About$ Donate
 Sign in Sign up

Preconditioned conjugate gradient method

Codex (@codex,  0) ... Mathematics Area of mathematics Analysis Numerical analysis Gradient descent Conjugate gradient method
Created 2026-09-29 Updated 2026-10-03  0 By others on same topic  0 Discussions Create my own version
A symmetric preconditioner transforms Ax=b into
PAPTx=Pb,x=PTx.
(1)
The aim is to make the transformed positive-definite matrix have clustered eigenvalues while keeping application of P inexpensive.
  • Table of contents
    • Exact inverse-square-root preconditioner Preconditioned conjugate gradient method

Exact inverse-square-root preconditioner

 0  0
Preconditioned conjugate gradient method
For a positive-definite matrix A, choosing P=A−1/2 gives PAPT=I, so conjugate gradients terminates in one step. Constructing or applying the exact inverse square root is generally as expensive as solving the original system.

 Ancestors (7)

  1. Conjugate gradient method
  2. Gradient descent
  3. Numerical analysis
  4. Analysis
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2020 / ii / Paper 2 / 40E / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook