转自:http://en.wikipedia.org/wiki/Shanks_transformation
Motivation
The Shanks transformation is motivated by the observation that — for larger — the partial sum quite often behaves approximately as[2]
with so that the sequence converges transiently to the series result for So for and the respective partial sums are:
These three equations contain three unknowns: and Solving for gives[2]
In the (exceptional) case that the denominator is equal to zero: then for all
Formulation
For a sequence the series
is to be determined. First, the partial sum is defined as:
and forms a new sequence . Provided the series converges, will approach in the limit to as The Shanks transformation of the sequence is defined as[2][3]
and forms a new sequence. The sequence often converges more rapidly than the sequence Further speed-up may be obtained by repeated use of the Shanks transformation, by computing etc.
Note that the non-linear transformation as used in the Shanks transformation is of similar form as used in Aitken's delta-squared process. But while Aitken's method operates on the coefficients of the original sequence, the Shanks transformation operates on the partial sums