Example 1.  Use Newton's method to find the roots of the cubic polynomial  [Graphics:Images/NewtonAccelerateMod_gr_31.gif].  
1 (b) Slow Convergence.  Investigate linear convergence at the double root  [Graphics:Images/NewtonAccelerateMod_gr_34.gif],  using the starting value  [Graphics:Images/NewtonAccelerateMod_gr_35.gif]

Solution 1 (b).

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

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

Graph the function.

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


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

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


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

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

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

The Newton-Raphson iteration formula  g[x]  is

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


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

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

Investigate linear convergence at the double root  [Graphics:../Images/NewtonAccelerateMod_gr_88.gif],  using the starting value  [Graphics:../Images/NewtonAccelerateMod_gr_89.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_90.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_91.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_92.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_93.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_94.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_95.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_96.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_97.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_98.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_99.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_100.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_101.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_102.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_103.gif]

Notice that convergence is slow, but the sequence is converging to  the double root  [Graphics:../Images/NewtonAccelerateMod_gr_104.gif]  

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



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


At the double root  [Graphics:../Images/NewtonAccelerateMod_gr_107.gif]  we can explore the relationship  [Graphics:../Images/NewtonAccelerateMod_gr_108.gif]  for  k  sufficiently large.

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

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


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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004