# Series acceleration

In mathematics, series acceleration is one of a collection of sequence transformations for improving the rate of convergence of a series. Techniques for series acceleration are often applied in numerical analysis, where they are used to improve the speed of numerical integration. Series acceleration techniques may also be used, for example, to obtain a variety of identities on special functions. Thus, the Euler transform applied to the hypergeometric series gives some of the classic, well-known hypergeometric series identities.

## Definition

Given a sequence

${\displaystyle S=\{s_{n}\}_{n\in \mathbb {N} }}$

having a limit

${\displaystyle \lim _{n\to \infty }s_{n}=\ell ,}$

an accelerated series is a second sequence

${\displaystyle S'=\{s'_{n}\}_{n\in \mathbb {N} }}$

which converges faster to ${\displaystyle \ell }$  than the original sequence, in the sense that

${\displaystyle \lim _{n\to \infty }{\frac {s'_{n}-\ell }{s_{n}-\ell }}=0.}$

If the original sequence is divergent, the sequence transformation acts as an extrapolation method to the antilimit ${\displaystyle \ell }$ .

The mappings from the original to the transformed series may be linear (as defined in the article sequence transformations), or non-linear. In general, the non-linear sequence transformations tend to be more powerful.

## Overview

Two classical techniques for series acceleration are Euler's transformation of series[1] and Kummer's transformation of series.[2] A variety of much more rapidly convergent and special-case tools have been developed in the 20th century, including Richardson extrapolation, introduced by Lewis Fry Richardson in the early 20th century but also known and used by Katahiro Takebe in 1722; the Aitken delta-squared process, introduced by Alexander Aitken in 1926 but also known and used by Takakazu Seki in the 18th century; the epsilon method given by Peter Wynn in 1956; the Levin u-transform; and the Wilf-Zeilberger-Ekhad method or WZ method.

For alternating series, several powerful techniques, offering convergence rates from ${\displaystyle 5.828^{-n}}$  all the way to ${\displaystyle 17.93^{-n}}$  for a summation of ${\displaystyle n}$  terms, are described by Cohen et al..[3]

## Euler's transform

A basic example of a linear sequence transformation, offering improved convergence, is Euler's transform. It is intended to be applied to an alternating series; it is given by

${\displaystyle \sum _{n=0}^{\infty }(-1)^{n}a_{n}=\sum _{n=0}^{\infty }(-1)^{n}{\frac {\Delta ^{n}a_{0}}{2^{n+1}}}}$

where ${\displaystyle \Delta }$  is the forward difference operator:

${\displaystyle \Delta ^{n}a_{0}=\sum _{k=0}^{n}(-1)^{k}{n \choose k}a_{n-k}.}$

If the original series, on the left hand side, is only slowly converging, the forward differences will tend to become small quite rapidly; the additional power of two further improves the rate at which the right hand side converges.

A particularly efficient numerical implementation of the Euler transform is the van Wijngaarden transformation.[4]

## Conformal mappings

A series

${\displaystyle S=\sum _{n=0}^{\infty }a_{n}}$

can be written as f(1), where the function f(z) is defined as

${\displaystyle f(z)=\sum _{n=0}^{\infty }a_{n}z^{n}}$

The function f(z) can have singularities in the complex plane (branch point singularities, poles or essential singularities), which limit the radius of convergence of the series. If the point z = 1 is close to or on the boundary of the disk of convergence, the series for S will converge very slowly. One can then improve the convergence of the series by means of a conformal mapping that moves the singularities such that the point that is mapped to z = 1, ends up deeper in the new disk of convergence.

The conformal transform ${\displaystyle z=\Phi (w)}$  needs to be chosen such that ${\displaystyle \Phi (0)=0}$ , and one usually chooses a function that has a finite derivative at w = 0. One can assume that ${\displaystyle \Phi (1)=1}$  without loss of generality, as one can always rescale w to redefine ${\displaystyle \Phi }$ . We then consider the function

${\displaystyle g(w)=f\left(\Phi (w)\right)}$

Since ${\displaystyle \Phi (1)=1}$ , we have f(1) = g(1). We can obtain the series expansion of g(w) by putting ${\displaystyle z=\Phi (w)}$  in the series expansion of f(z) because ${\displaystyle \Phi (0)=0}$ ; the first n terms of the series expansion for f(z) will yield the first n terms of the series expansion for g(w) if ${\displaystyle \Phi '(0)\neq 0}$ . Putting w = 1 in that series expansion will thus yield a series such that if it converges, it will converge to the same value as the original series.

## Non-linear sequence transformations

Examples of such nonlinear sequence transformations are Padé approximants, the Shanks transformation, and Levin-type sequence transformations.

Especially nonlinear sequence transformations often provide powerful numerical methods for the summation of divergent series or asymptotic series that arise for instance in perturbation theory, and may be used as highly effective extrapolation methods.

### Aitken method

A simple nonlinear sequence transformation is the Aitken extrapolation or delta-squared method,

${\displaystyle \mathbb {A} :S\to S'=\mathbb {A} (S)={(s'_{n})}_{n\in \mathbb {N} }}$

defined by

${\displaystyle s'_{n}=s_{n+2}-{\frac {(s_{n+2}-s_{n+1})^{2}}{s_{n+2}-2s_{n+1}+s_{n}}}.}$

This transformation is commonly used to improve the rate of convergence of a slowly converging sequence; heuristically, it eliminates the largest part of the absolute error.

• Brezinski, C., & Redivo-Zaglia, M. (2019). The genesis and early developments of Aitken's process, Shanks transformation, the ${\displaystyle \epsilon }$ -algorithm, and related fixed point methods. Numerical Algorithms, 80(1), 11-133.