Conjugate gradient squared method

This is an old revision of this page, as edited by MtPenguinMonster (talk | contribs) at 03:40, 13 March 2023 (Added links). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In numerical linear algebra, 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.