Example 3.  Compare the secant method with the inverse quadratic method for finding the roots of the cubic polynomial  [Graphics:Images/BrentMethodMod_gr_142.gif].  

3 (b)  Investigate slow convergence at the double root  [Graphics:Images/BrentMethodMod_gr_157.gif].  

Solution 3 (b).

[Graphics:../Images/BrentMethodMod_gr_158.gif]

[Graphics:../Images/BrentMethodMod_gr_159.gif]

Graph the function.

[Graphics:../Images/BrentMethodMod_gr_160.gif]

[Graphics:../Images/BrentMethodMod_gr_161.gif]

[Graphics:../Images/BrentMethodMod_gr_162.gif]

Slow Convergence.  Investigate slow convergence at the double root  [Graphics:../Images/BrentMethodMod_gr_163.gif],  using the starting values  [Graphics:../Images/BrentMethodMod_gr_164.gif]

Use the subroutine for the inverse quadratic method.  

[Graphics:../Images/BrentMethodMod_gr_165.gif]

[Graphics:../Images/BrentMethodMod_gr_166.gif]

[Graphics:../Images/BrentMethodMod_gr_167.gif]

 

 

Compare with the slightly slower secant method.

[Graphics:../Images/BrentMethodMod_gr_168.gif]

[Graphics:../Images/BrentMethodMod_gr_169.gif]

[Graphics:../Images/BrentMethodMod_gr_170.gif]

[Graphics:../Images/BrentMethodMod_gr_171.gif]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2005