arXiv Analytics

Sign in

arXiv:1910.03293 [math.NA]AbstractReferencesReviewsResources

The conjugate gradient method with various viewpoints

Xuping Zhang, Jiefei Yang, Ziying Liu

Published 2019-10-08Version 1

Connections of the conjugate gradient (CG) method with other methods in computational mathematics are surveyed, including the connections with the conjugate direction method, the subspace optimization method and the quai-Newton method BFGS in numrical optimization, and the Lanczos method in numerical linear algebra. Two sequences of polynomials related to residual vectors and conjugate vectors are reviewed, where the residual polynomials are similar to orthogonal polynomials in the approximation theory and the roots of the polynomials reveal certain information of the coefficient matrix. The convergence rates of the steepest descent and CG are reconsidered in a viewpoint different from textbooks. The connection of infinite dimensional CG with finite dimensional preconditioned CG is also reviewed via numerical solution of an elliptic equation.

Related articles: Most relevant | Search more
arXiv:2008.03225 [math.NA] (Published 2020-08-07)
A Probabilistic Numerical Extension of the Conjugate Gradient Method
arXiv:1908.10110 [math.NA] (Published 2019-08-27)
Convergence of the conjugate gradient method with unbounded operators
arXiv:2210.16660 [math.NA] (Published 2022-10-29)
Alya towards Exascale: Algorithmic Scalability using PSCToolkit