Example 1. Use
Newton's method to find the roots of the cubic
polynomial
.
1 (b) Slow
Convergence. Investigate linear convergence at
the double root
, using
the starting value ![]()
Solution 1 (b).
Graph the function.
![[Graphics:../Images/NewtonAccelerateMod_gr_80.gif]](../Images/NewtonAccelerateMod_gr_80.gif)
![[Graphics:../Images/NewtonAccelerateMod_gr_83.gif]](../Images/NewtonAccelerateMod_gr_83.gif)
The Newton-Raphson iteration formula g[x] is
Investigate linear 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 slow, but the sequence is converging
to the double root
At the double root
we
can explore the relationship
for k sufficiently
large.
This will be done by investigating the ratio
for k sufficiently
large.
![[Graphics:../Images/NewtonAccelerateMod_gr_111.gif]](../Images/NewtonAccelerateMod_gr_111.gif)
(c) John H. Mathews 2004