Example 5.  Use the modified Newton's method to find the double root  [Graphics:Images/NewtonAccelerateMod_gr_274.gif],  and triple root   [Graphics:Images/NewtonAccelerateMod_gr_275.gif],  of the cubic polynomial  [Graphics:Images/NewtonAccelerateMod_gr_276.gif].  

Solution 5.

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


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

Graph the function.

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


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

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

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

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


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

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

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

Investigate quadratic convergence at the double root  [Graphics:../Images/NewtonAccelerateMod_gr_286.gif],  using the starting value  [Graphics:../Images/NewtonAccelerateMod_gr_287.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_288.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_289.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_290.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_291.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_292.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_293.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_294.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_295.gif]

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

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



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

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

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

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

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

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

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

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

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


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

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


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

 

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

 

 

 

Now investigate the other root.
Investigate quadratic convergence at the triple root  [Graphics:../Images/NewtonAccelerateMod_gr_310.gif],  using the starting value  [Graphics:../Images/NewtonAccelerateMod_gr_311.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_312.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_313.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_314.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_315.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_316.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_317.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_318.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_319.gif]


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

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



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

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

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

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

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

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

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

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

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


At the triple root  [Graphics:../Images/NewtonAccelerateMod_gr_330.gif]  we can explore the ratio [Graphics:../Images/NewtonAccelerateMod_gr_331.gif].

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


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

 

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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004