Example 3. Compare
the secant method with the inverse quadratic method for finding the
roots of the cubic polynomial
.
3 (b) Investigate
slow convergence at the double root
.
Solution 3 (b).
Graph the function.
![[Graphics:../Images/BrentMethodMod_gr_160.gif]](../Images/BrentMethodMod_gr_160.gif)
![[Graphics:../Images/BrentMethodMod_gr_161.gif]](../Images/BrentMethodMod_gr_161.gif)
Slow
Convergence. Investigate slow convergence at
the double root
, using
the starting values ![]()
Use the subroutine for the inverse quadratic method.
![[Graphics:../Images/BrentMethodMod_gr_166.gif]](../Images/BrentMethodMod_gr_166.gif)
![[Graphics:../Images/BrentMethodMod_gr_167.gif]](../Images/BrentMethodMod_gr_167.gif)
Compare with the slightly slower secant method.
![[Graphics:../Images/BrentMethodMod_gr_169.gif]](../Images/BrentMethodMod_gr_169.gif)
![[Graphics:../Images/BrentMethodMod_gr_170.gif]](../Images/BrentMethodMod_gr_170.gif)
![[Graphics:../Images/BrentMethodMod_gr_171.gif]](../Images/BrentMethodMod_gr_171.gif)
(c) John H. Mathews 2005