View source for Conjugate Gradient Method

From Cohen Courses

← Conjugate Gradient Method

You do not have permission to edit this page, for the following reason:

---

You can view and copy the source of this page.

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 that are too large to be handled by direct methods such as the Cholesky decomposition. Such systems often arise when numerically solving partial differential equations.

Return to Conjugate Gradient Method.