Conjugate Gradient Method (Solving Quadratic Equations with Two Varaibles)

The algorithm summarizes the Conjugate Gradient method.

The code highlights the Fletcher Reeve's Method or Conjugate Gradient Method. This method exploits the advantage of conjugate directions and hence is quadratically convergent. It takes only 3 iterations or 2 searches to solve a quadratic equation. The optimum for the same example as shown in this algorithm took 56 iterations with Steepest Descent.(Refer Steepest Descent Code); while this algorithm converges in only 3 iterations same initial guess or start point.