Example.Use Newton's method to
construct a linearly convergent sequencewhich
converges slowly to the multiple rootof.
Then use the Aitken
process to constructwhich
converges faster to the root.
Solution.
Graph the function.
Starting with,
use the Newton-Raphson method to find a numerical approximation to the root.
Since we know the root is,we
can determine the error for each iteration.
Newton's method is converging linearly (or slowly), the error at each step is
being reduced by approximately one-half.Let us apply Aitken's acceleration
process to a sequenceof
iterations generated by Newton's method.
Again, we can determine the error for each term.
The sequenceis
converging topfaster than the sequenceconverges
top.
Back.
|