Aitken's
Process and Steffensen's Acceleration Method
Background for Aitken's
Process
We have seen that Newton�s method converges slowly at a multiple root and
the sequence of iteratesexhibits
linear convergence.A technique called Aitken's
process can be used to speed up convergence of any
sequence that is linearly convergent.In order to proceed, we will need a
definition.
Definition (Forward
Difference).Given the sequence
,define
the forward differenceby
for.
Higher powersare
defined recursively by
for.
Whenk=2we have the useful formulawhich
simplifies to be:
for.
Theorem (Aitken's
Acceleration).Assume that the
sequenceconverges
linearly to the limit p
and thatfor
all.
If there exists a real number A
withsuch
that
then the sequencedefined
by
converges to p
faster than,in
the sense that
.
Steffensen's Acceleration
When Aitken's process is combined with the fixed point iteration in Newton�s
method, the result is called Steffensen's acceleration.Starting with
,
two steps of Newton's method are used to computeand,then
Aitken's
process is used to compute.To
continue the iteration set
and repeat the previous steps.
Mathematica Subroutine (Newton-Raphson Iteration).
Mathematica Subroutine (Steffensen's Method).
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.
|