Conjugate gradient squared method: Difference between revisions

Content deleted Content added
-- Draft creation using the WP:Article wizard --
 
Added links
Line 1:
{{AfC submission|t||ts=20230126112013|u=MtPenguinMonster|ns=118|demo=}}<!-- Important, do not remove this line before article has been created. -->
 
TheIn [[numerical linear algebra]], the '''conjugate gradient squared method (CGS)''' is an [[iterative method|iterative]] algorithm for solving systems of linear equations.<ref>https://mathworld.wolfram.com/ConjugateGradientSquaredMethod.html</ref> The CGS method was developed as an improvement to the [[Biconjugate gradient method]].<ref>https://au.mathworks.com/help/matlab/ref/cgs.html</ref><ref>{{cite book|author=[[Henk van der Vorst]]|title=Iterative Krylov Methods for Large Linear Systems|chapter=Bi-Conjugate Gradients|year=2003|isbn=0-521-81828-1}}</ref>
 
<!--
== The Algorithm ==
 
Whereas the [[biconjugate gradient method]]. -->
 
== See Also ==