Example 4.  Use the modified Newton's method to find the double root  [Graphics:Images/NewtonAccelerateMod_gr_233.gif],  of the cubic polynomial  [Graphics:Images/NewtonAccelerateMod_gr_234.gif].  Use the starting value  [Graphics:Images/NewtonAccelerateMod_gr_235.gif]

Solution 4.

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


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

Graph the function.

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


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

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


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

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

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

The modified Newton-Raphson iteration formula  g[x]  is found.

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


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

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

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

Investigate quadratic convergence at the double root  [Graphics:../Images/NewtonAccelerateMod_gr_248.gif],  using the starting value  [Graphics:../Images/NewtonAccelerateMod_gr_249.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_250.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_251.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_252.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_253.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_254.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_255.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_256.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_257.gif]

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

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



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

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

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

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

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

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

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

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

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

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

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


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

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


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

 

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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004