Derivation of the conjugate gradient method
In numerical linear algebra, the conjugate gradient method is an iterative method for numerically solving the linear system where is symmetric positive-definite. The conjugate gradient method can be derived from several different perspectives, including specialization of the for optimization, and variation of the Arnoldi/Lanczos iteration for eigenvalue problems. The intent of this article is to document the important steps in these derivations.
Link from a Wikipage to another Wikipage
primaryTopic
Derivation of the conjugate gradient method
In numerical linear algebra, the conjugate gradient method is an iterative method for numerically solving the linear system where is symmetric positive-definite. The conjugate gradient method can be derived from several different perspectives, including specialization of the for optimization, and variation of the Arnoldi/Lanczos iteration for eigenvalue problems. The intent of this article is to document the important steps in these derivations.
has abstract
In numerical linear algebra, t ...... nt steps in these derivations.
@en
在数值线性代数中，共轭梯度法是一种求解对称正定线性方程组 的 ...... 值问题的/迭代的变种。 本条目记述这些推导方法中的重要步骤。
@zh
Link from a Wikipage to an external page
Wikipage page ID
26,956,978
page length (characters) of wiki page
Wikipage revision ID
925,704,270
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In numerical linear algebra, t ...... nt steps in these derivations.
@en
在数值线性代数中，共轭梯度法是一种求解对称正定线性方程组 的 ...... 值问题的/迭代的变种。 本条目记述这些推导方法中的重要步骤。
@zh
label
Derivation of the conjugate gradient method
@en
共轭梯度法的推导
@zh