For a real symmetric positive-definite matrix in exact arithmetic, iteration of the conjugate gradient method satisfies
and itself lies in . These Galerkin conditions imply finite termination once the Krylov subspace becomes invariant under .
The residual orthogonality is the first-order optimality condition for minimizing the quadratic objective on . Floating-point roundoff can destroy exact residual orthogonality, so the identity is a structural exact-arithmetic result.

Articles by others on the same topic (0)

There are currently no matching articles.