Example 1.  Use Newton's method to find the roots of the cubic polynomial  [Graphics:Images/NewtonAccelerateMod_gr_31.gif].  
1 (a) Fast Convergence.  Investigate quadratic convergence at the simple root  [Graphics:Images/NewtonAccelerateMod_gr_32.gif],  using the starting value  [Graphics:Images/NewtonAccelerateMod_gr_33.gif]

Solution 1 (a).

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

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

Graph the function.

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


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

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


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

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

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


The Newton-Raphson iteration formula  g[x]  is

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



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

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


Investigate quadratic convergence at the simple root  [Graphics:../Images/NewtonAccelerateMod_gr_47.gif],  using the starting value  [Graphics:../Images/NewtonAccelerateMod_gr_48.gif]

First, do the iteration one step at a time.  
Type each of the following commands in a separate cell and execute them one at a time.

[Graphics:../Images/NewtonAccelerateMod_gr_49.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_50.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_51.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_52.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_53.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_54.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_55.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_56.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_57.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_58.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_59.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_60.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_61.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_62.gif]

Notice that convergence is fast and the sequence is converging to the simple root  [Graphics:../Images/NewtonAccelerateMod_gr_63.gif]  

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



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


At the simple root  [Graphics:../Images/NewtonAccelerateMod_gr_66.gif]  we can explore the relationship  [Graphics:../Images/NewtonAccelerateMod_gr_67.gif]  for  k  sufficiently large.

This will be done by investigating the ratio  [Graphics:../Images/NewtonAccelerateMod_gr_68.gif]  for  k  sufficiently large.

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


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

 

 

Evaluate the quantity  [Graphics:../Images/NewtonAccelerateMod_gr_71.gif] at the root  [Graphics:../Images/NewtonAccelerateMod_gr_72.gif].

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


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

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

Which is close to the computed value  [Graphics:../Images/NewtonAccelerateMod_gr_76.gif]  

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004