Jump to content

Conjugate gradient squared method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by MtPenguinMonster (talk | contribs) at 11:20, 26 January 2023 (-- Draft creation using the WP:Article wizard --). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The conjugate gradient squared method (CGS) is an iterative algorithm for solving systems of linear equations.[1] The CGS method was developed as an improvement to the Biconjugate gradient method.[2][3]

See Also

References

  1. ^ https://mathworld.wolfram.com/ConjugateGradientSquaredMethod.html
  2. ^ https://au.mathworks.com/help/matlab/ref/cgs.html
  3. ^ Henk van der Vorst (2003). "Bi-Conjugate Gradients". Iterative Krylov Methods for Large Linear Systems. ISBN 0-521-81828-1.