Example 2.  Use the accelerated Newton's method to find the double root  [Graphics:Images/NewtonAccelerateMod_gr_118.gif],  of the cubic polynomial  [Graphics:Images/NewtonAccelerateMod_gr_119.gif].  Use the starting value  [Graphics:Images/NewtonAccelerateMod_gr_120.gif]

Solution 2.

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


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

Graph the function.

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


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

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


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

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

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

Since the  double root  [Graphics:../Images/NewtonAccelerateMod_gr_129.gif]  has order  double root  [Graphics:../Images/NewtonAccelerateMod_gr_130.gif],  the accelerated Newton-Raphson iteration formula  g[x]  is

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


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

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

Investigate quadratic convergence at the double root  [Graphics:../Images/NewtonAccelerateMod_gr_134.gif],  using the starting value  [Graphics:../Images/NewtonAccelerateMod_gr_135.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_136.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_137.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_138.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_139.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_140.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_141.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_142.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_143.gif]

Notice that convergence is much faster than the standard Newton-Raphson iteration.

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



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

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

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

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

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

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

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

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

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


At the double root  [Graphics:../Images/NewtonAccelerateMod_gr_154.gif]  we can explore the ratio [Graphics:../Images/NewtonAccelerateMod_gr_155.gif].

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


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

 

 

Therefore, the accelerated Newton-Raphson iteration is converging quadratically.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004