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.
Soumitra Sitole (2021). Conjugate Gradient Method (Solving Quadratic Equations with Two Varaibles) (https://www.mathworks.com/matlabcentral/fileexchange/62011-conjugate-gradient-method-solving-quadratic-equations-with-two-varaibles), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform CompatibilityWindows macOS Linux
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!