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 (a)  Investigate fast convergence at the simple root  [Graphics:Images/BrentMethodMod_gr_143.gif].  

Solution 3 (a).

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

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

Graph the function.

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

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

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

Fast Convergence.  Investigate fast convergence at the simple root  [Graphics:../Images/BrentMethodMod_gr_149.gif],  using the starting values  [Graphics:../Images/BrentMethodMod_gr_150.gif]

Use the subroutine for the inverse quadratic method.  

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

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

 

 

Use the efficient version for the inverse quadratic method.  

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

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

 

 

Compare with the slower secant method.

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

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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2005