Conjugate gradient method

In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is symmetric and positive definite. The conjugate gradient method is an iterative method, so it can be applied to sparse systems which are too large to be handled by direct methods such as the Cholesky decomposition. Such system arise regularly when numerically solving partial differential equations.

The conjugate gradient method can also be used to solve unconstrained optimization problems.

Contents

1 Description of the method 1.1 The conjugate gradient method as a direct method 1.2 The conjugate gradient method as an iterative method 1.3 The resulting algorithm 2 References

Description of the method

Suppose we want to solve the following system of linear equations

where the n-by-n matrix A is symmetric (i.e., A^T = A), positive definite (i.e., x^TAx > 0 for all non-zero vectors x in Rⁿ), and real.

We denote the unique solution of this system by x_*.

The conjugate gradient method as a direct method

We say that two vectors u and v are conjugate if

Since A is symmetric and positive definite, the left-hand side defines an inner product

So, two vectors are conjugate if they are orthogonal with respect to this inner product.

Suppose that {p_k} is a sequence of n conjugate directions. Then the p_k form a basis of Rⁿ, so we can expand the solution x_* of Ax = b in this basis:

The coefficients are given by

This result is perhaps most transparent by considering the inner product defined above.

This gives the following method for solving the equation Ax = b. We first find a sequence of n conjugate direction and then we compute the coefficients α_k.

The conjugate gradient method as an iterative method

If we choose the conjugate directions p_k carefully, then we may not need all of them to obtain a good approximation to the solution x_*. So, we want to regard the conjugate gradient method as an iterative method. This also allows us to solve systems where n is so large that the direct method would take too much time.

We denote the initial guess for x_* by x₀. We can assume without loss of generality that x₀ = 0 (otherwise, consider the system Az = b − Ax₀ instead). Note that the solution x_* is also the unique minimizer of

This suggests taking the first direction p₁ to be the gradient of f at x = x₀, which equals b. The other directions will be conjugate to the gradient, hence the name conjugate gradient method.

Let r_k be the residual at the kth step:

Note that r_k is the gradient of f at x = x_k, so the gradient descent method would be to move in the direction r_k. Here, we insist that the directions p_k are conjugate to each other, so we take the direction closest to the gradient r_k under the conjugacy constraint. This gives the following expression:

The resulting algorithm

After some simplifications, this results in the following algorithm for solving Ax = b where A is a real, symmetric, positive-definite matrix.

x₀ := 0

k := 0

r₀ := b

repeat until r_k is "sufficiently small":

k := k + 1

if k = 1

p₁ := r₀

else

end if

x_k := x_k-1 + α_k p_k

r_k := r_k-1 - α_k A p_k

end repeat

The result is x_k

References

The conjugate gradient method was originally proposed in

• Magnus R. Hestenes and Eduard Stiefel (1952), Methods of conjugate gradients for solving linear systems, J. Research Nat. Bur. Standards 49, 409–436.

A description of method can be found in the following text books:

• Kendell A. Atkinson (1988), An introduction to numerical analysis (2nd ed.), Section 8.9, John Wiley and Sons. ISBN 0-471-50023-2.
• Gene H. Golub and Charles F. Van Loan, Matrix computations (3rd ed.), Chapter 10, John Hopkins University Press. ISBN 0-8018-5414-8.