For positive definite matrices only.
TODO application.
www.studentclustercompetition.us/ comments:
The HPCG benchmark uses a preconditioned conjugate gradient (PCG) algorithm to measure the performance of HPC platforms with respect to frequently observed but challenging patterns of computing, communication, and memory access. While HPL provides an optimistic performance target for applications, HPCG can be considered as a lower bound on performance. Many of the top 500 supercomputers also provide their HPCG performance as a reference.
Articles by others on the same topic
The conjugate gradient method solves for a real symmetric positive-definite matrix by minimizing over expanding affine Krylov subspaces. Its successive nonzero search directions are A-conjugate directions, so a new line minimization preserves the optimality already obtained along earlier directions.
Start with and stop if it is zero; otherwise put . The recurrence isStop when the new residual is zero, before attempting another division. Each step uses a matrix-vector product, a few inner products and vector updates; a sparse or implicit linear operator can therefore be used without forming its inverse.[ref]
https://netlib.org/templates/templates.html. Templates for the Solution of Linear Systems, §2.3.1, conjugate gradients and symmetric positive-definite assumptions
For , and , the first step has , and . The next conjugate direction is and its step size is , giving the exact solution . Finite termination of the conjugate gradient method is an exact-arithmetic statement; floating-point loss of orthogonality changes the practical stopping analysis.
The Conjugate Gradient (CG) method is an iterative algorithm primarily used for solving systems of linear equations whose coefficient matrix is symmetric and positive-definite. It is particularly effective for large-scale problems, where direct methods (like Gaussian elimination) can be computationally expensive or infeasible due to memory requirements. ### Key Features of the Conjugate Gradient Method: 1. **Iteration**: The CG method generates a sequence of approximations to the solution.