Metraipolis › archive › dc_52abd96ef9de
Conjugate gradient method — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Conjugate_gradient_method
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T23:14:36.294Z
- SHA-256 of the archived text
de23f22dce6bfa06779cbad02a6a1719e4bf1df9ab6be6c82b3b63cf02b2f53e- Stable URL of this page
https://metraipolis.com/documento/dc_52abd96ef9de
How to cite
Conjugate gradient method — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Conjugate_gradient_method (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_52abd96ef9de (Metraipolis archive dc_52abd96ef9de, sha256 de23f22dce6bfa06779cbad02a6a1719e4bf1df9ab6be6c82b3b63cf02b2f53e)
BibTeX
@misc{dc52abd96ef9de,
title = {Conjugate gradient method — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Conjugate_gradient_method},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_52abd96ef9de; sha256 de23f22dce6bfa06779cbad02a6a1719e4bf1df9ab6be6c82b3b63cf02b2f53e},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Conjugate_gradient_method. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is positive-semidefinite. The conjugate gradient method is often implemented as an iterative algorithm, applicable to sparse systems that are too large to be handled by a direct implementation or other direct methods such as the Cholesky decomposition. Large sparse systems often arise when numerically solving partial differential equations or optimization problems. The conjugate gradient method can also be used to solve unconstrained optimization problems such as energy minimization. It is commonly attributed to Magnus Hestenes and Eduard Stiefel, who programmed it on the Z4, and extensively researched it. The biconjugate gradient method provides a generalization to non-symmetric matrices. Various nonlinear conjugate gradient methods seek minima of nonlinear optimization problems. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»). Fonte: Wikipedia in inglese, voce «Conjugate gradient method» — https://en.wikipedia.org/wiki/Conjugate_gradient_method Wikidata Q1191895 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1191895 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Conjugate_gradient_method?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1377170376, consultata il 2026-10-07T22:53:13.225Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: f4d60bd5a669b58cf93d1f59e7150eb0c5704b2d8cc9fef50b88302bcc19d8fe