Conjugate Gradient Method - The Flexible Preconditioned Conjugate Gradient Method

The Flexible Preconditioned Conjugate Gradient Method

In numerically challenging applications, sophisticated preconditioners are used, which may lead to variable preconditioning, changing between iterations. Even if the preconditioner is symmetric positive-definite on every iteration, the fact that it may change makes the arguments above invalid, and in practical tests leads to a significant slow down of the convergence of the algorithm presented above. Using the Polak–Ribière formula

instead of the Fletcher–Reeves formula

may dramatically improve the convergence in this case. This version of the preconditioned conjugate gradient method can be called flexible, as it allows for variable preconditioning. The implementation of the flexible version requires storing an extra vector. For a fixed preconditioner, so both formulas for are equivalent in exact arithmetic, i.e., without the round-off error.

The mathematical explanation of the better convergence behavior of the method with the Polak–Ribière formula is that the method is locally optimal in this case, in particular, it converges not slower than the locally optimal steepest descent method.

Read more about this topic:  Conjugate Gradient Method

Famous quotes containing the words flexible and/or method:

    Freedom is the essence of this faith. It has for its object simply to make men good and wise. Its institutions then should be as flexible as the wants of men. That form out of which the life and suitableness have departed should be as worthless in its eyes as the dead leaves that are falling around us.
    Ralph Waldo Emerson (1803–1882)

    The method of painting is the natural growth out of a need. I want to express my feelings rather than illustrate them. Technique is just a means of arriving at a statement.... I can control the flow of paint: there is no accident, just as there is no beginning and no end.
    Jackson Pollock (1912–1956)