In mathematics and numerical analysis, the van Wijngaarden transformation is a variant on the Euler transform used to accelerate the convergence of an alternating series.

One algorithm to compute Euler's transform runs as follows:

Compute a row of partial sums $${\displaystyle s_{0,k}=\sum _{n=0}^{k}(-1)^{n}a_{n}}$$ and form rows of averages between neighbors $${\displaystyle s_{j+1,k}={\frac {s_{j,k}+s_{j,k+1}}{2}}}$$ The first column ${\displaystyle s_{j,0}}$ then contains the partial sums of the Euler transform.

Adriaan van Wijngaarden's contribution was to point out that it is better not to carry this procedure through to the very end, but to stop two-thirds of the way.^[1] If ${\displaystyle a_{0},a_{1},\ldots ,a_{12}}$ are available, then ${\displaystyle s_{8,4}}$ is almost always a better approximation to the sum than ${\displaystyle s_{12,0}}$. In many cases the diagonal terms do not converge in one cycle so process of averaging is to be repeated with diagonal terms by bringing them in a row. (For example, this will be needed in a geometric series with ratio ${\displaystyle -4}$.) This process of successive averaging of the average of partial sum can be replaced by using the formula to calculate the diagonal term.

For a simple-but-concrete example, recall the Leibniz formula for pi

${\displaystyle 1-{\frac {1}{3}}+{\frac {1}{5}}-{\frac {1}{7}}+\cdots ={\frac {\pi }{4}}=0.7853981\ldots }$

1

The algorithm described above produces the following table:

These correspond to the following algorithmic outputs:

Accuracy of final results

Algorithm	Term used	Value for ${\displaystyle \pi /4}$	Relative error
Naïve partial sums	${\displaystyle s_{0,12}}$	0.8046006...	+2.4%
Euler transform	${\displaystyle s_{12,0}}$	0.7854002...	+2.6×10−6
van Wijngaarden result	${\displaystyle s_{8,4}}$	0.7853982...	+4.7×10−8

• Euler summation