Example 6.  Consider the function  [Graphics:Images/NewtonAccelerateMod_gr_334.gif].  
6 (b).  Use the accelerated Newton's method to find the multiple root  [Graphics:Images/NewtonAccelerateMod_gr_336.gif].  

Solution 6 (b).

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


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

Graph the function.

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


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

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

How would we determine the order of the root ?
In practice, this must be known in advance.
For this example, the function was  [Graphics:../Images/NewtonAccelerateMod_gr_386.gif].

 

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


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

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

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

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


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

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

Investigate quadratic convergence at the double root  [Graphics:../Images/NewtonAccelerateMod_gr_395.gif],  using the starting value  [Graphics:../Images/NewtonAccelerateMod_gr_396.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_397.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_398.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_399.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_400.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_401.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_402.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_403.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_404.gif]

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

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



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

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

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

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

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

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

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

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

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



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

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


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

 

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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004