Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Conjugate gradient squared method
open-in-new
<p>In <a href="/facts/Numerical_linear_algebra/jnS6Tteb">numerical linear algebra</a>, the conjugate gradient squared method (CGS) is an <a href="/facts/Iterative_method/uKMAJhEh">iterative</a> algorithm for solving <a href="/facts/Systems_of_linear_equations/fk9CFdgp">systems of linear equations</a> of the form A x = b {\displaystyle A{\mathbf {x}}={\mathbf {b}}} , particularly in cases where computing the <a href="/facts/Transpose/8wmsagGS">transpose</a> A T {\displaystyle A^{T}} is impractical. The CGS method was developed as an improvement to the <a href="/facts/Biconjugate_gradient_method/m1n1pSla">biconjugate gradient method</a>. </p>