<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Conjugate gradient method - Page 12 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Conjugate_gradient_method&amp;p=11">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Conjugate_gradient_method&amp;p=13">3.Next</a>
</p>
<p>of the conjugacy constraint on convergence). Following this direction, the next optimal location is given by<br/>
:with <br/>
:</p>

<p>where the last equality follows from the definition of  .The expression for  can be derived if one substitutes the expression for <b>x</b><sub>k+1</sub> into f and minimizing it with respect to <br/>
:</p>

<p><big>The resulting algorithm</big></p>
<p>The above algorithm gives the most straightforward explanation of the conjugate gradient method.  Seemingly, the algorithm as stated requires storage of all previous searching</p><p>
<a accesskey="1" href="page.php?w=Conjugate_gradient_method&amp;p=11">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Conjugate_gradient_method&amp;p=13">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
