Difference between revisions of "Conjugate Gradient Method"

From Cohen Courses
Jump to navigationJump to search
(Created page with '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. …')
 
(No difference)

Latest revision as of 02:48, 4 October 2012

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.