Example 3.  Use the accelerated Newton's method to find the double root  [Graphics:Images/NewtonAccelerateMod_gr_158.gif],  and triple root   [Graphics:Images/NewtonAccelerateMod_gr_159.gif],  of the cubic polynomial  [Graphics:Images/NewtonAccelerateMod_gr_160.gif].  

Solution 3.

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


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

Graph the function.

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


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

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


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

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


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

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

Investigate quadratic convergence at the double root  [Graphics:../Images/NewtonAccelerateMod_gr_171.gif],  using the starting value  [Graphics:../Images/NewtonAccelerateMod_gr_172.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_173.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_174.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_175.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_176.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_177.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_178.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_179.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_180.gif]

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

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



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

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

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

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

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

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

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

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

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


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

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


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

 

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

 

 

 

Now investigate the other root.
Since the triple root  [Graphics:../Images/NewtonAccelerateMod_gr_195.gif]  has order  [Graphics:../Images/NewtonAccelerateMod_gr_196.gif],  the accelerated Newton-Raphson iteration formula  g[x]  is

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


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

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

Investigate quadratic convergence at the triple root  [Graphics:../Images/NewtonAccelerateMod_gr_200.gif],  using the starting value  [Graphics:../Images/NewtonAccelerateMod_gr_201.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_202.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_203.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_204.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_205.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_206.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_207.gif]

[Graphics:../Images/NewtonAccelerateMod_gr_208.gif]
[Graphics:../Images/NewtonAccelerateMod_gr_209.gif]

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

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



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

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

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

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

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

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

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

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


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

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


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

 

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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004