Example 3. Use the
accelerated Newton's method to find the double
root
, and
triple root
, of
the cubic polynomial
.
Solution 3.
Graph the function.
![[Graphics:../Images/NewtonAccelerateMod_gr_164.gif]](../Images/NewtonAccelerateMod_gr_164.gif)
Since the double root
has
order
, the
accelerated Newton-Raphson iteration formula g[x] is
Investigate quadratic convergence at the double
root
, using
the starting value ![]()
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.
Notice that convergence is much faster than the standard Newton-Raphson iteration.
At the double root
we
can explore the ratio
.
![[Graphics:../Images/NewtonAccelerateMod_gr_194.gif]](../Images/NewtonAccelerateMod_gr_194.gif)
Therefore, the accelerated Newton-Raphson iteration is converging quadratically.
Now investigate the other root.
Since the triple root
has
order
, the
accelerated Newton-Raphson iteration formula g[x] is
Investigate quadratic convergence at the triple
root
, using
the starting value ![]()
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.
Notice that convergence is much faster than the standard Newton-Raphson iteration.
At the triple root
we
can explore the ratio
.
![[Graphics:../Images/NewtonAccelerateMod_gr_222.gif]](../Images/NewtonAccelerateMod_gr_222.gif)
Therefore, the accelerated Newton-Raphson iteration is converging quadratically.
(c) John H. Mathews 2004