Reeb sphere theorem

In numerical analysis, pairwise summation, also called cascade summation, is a technique to sum a sequence of finite-precision floating-point numbers that substantially reduces the accumulated round-off error compared to naively accumulating the sum in sequence. Although there are other techniques such as Kahan summation that typically have even smaller round-off errors, pairwise summation is nearly as good (differing only by a logarithmic factor) while having much lower computational cost—it can be implemented so as to have nearly the same cost (and exactly the same number of arithmetic operations) as naive summation.

In particular, pairwise summation of a sequence of n numbers x_n works by recursively breaking the sequence into two halves, summing each half, and adding the two sums: a divide and conquer algorithm. Its roundoff errors grow asymptotically as at most O(ε log n), where ε is the machine precision (assuming a fixed condition number, as discussed below). In comparison, the naive technique of accumulating the sum in sequence (adding each x_i one at a time for i = 1, ..., n) has roundoff errors that grow at worst as O(εn). Kahan summation has a worst-case error of roughly O(ε), independent of n, but requires several times more arithmetic operations. If the roundoff errors are random, and in particular have random signs, then they form a random walk and the error growth is reduced to an average of $O(\epsilon \sqrt{\log n})$ for pairwise summation.

A very similar recursive structure of summation is found in many fast Fourier transform (FFT) algorithms, and is responsible for the same slow roundoff accumulation of those FFTs.

The algorithm

In pseudocode, the pairwise summation algorithm for an array x of length n can be written:

s = pairwise(x[1…n])
      if n ≤ N                    base case: naive summation for a sufficiently small array
          s = x[1]
          for i = 2 to n
              s = s + x[i]
      else                        divide and conquer: recursively sum two halves of the array
          m = floor(n / 2)
          s = pairwise(x[1…m]) + pairwise(x[m+1…n])
      endif

For some sufficiently small N, this algorithm switches to a naive loop-based summation as a base case, whose error bound is O(εN). Therefore, the entire sum has a worst-case error that grows asymptotically as O(εN log n) for large n, for a given condition number (see below), and the smallest error bound is attained for N = 1.

In an algorithm of this sort (as for divide and conquer algorithms in general), it is desirable to use a larger base case in order to amortize the overhead of the recursion. If N = 1, then there is roughly one recursive subroutine call for every input, but more generally there is one recursive call for (roughly) every N/2 inputs if the recursion stops at exactly n = N. By making N sufficiently large, the overhead of recursion can be made negligible (precisely this technique of a large base case for recursive summation is employed by high-performance FFT implementations).

Regardless of N, exactly n−1 additions are performed in total, the same as for naive summation, so if the recursion overhead is made negligible then pairwise summation has essentially the same computational cost as for naive summation.

A variation on this idea is to break the sum into b blocks at each recursive stage, summing each block recursively, and then summing the results, which was dubbed a "superblock" algorithm by its proposers. The above pairwise algorithm corresponds to b = 2 for every stage except for the last stage which is b = N.

Pairwise summation can be done non-recursively using a working array of partial sums, where sum[i] holds the sum of 2ⁱ values. For example, when 11 values have been accumulated, sum[3] will hold the sum of the first 8, sum[2] will not be in use, sum[1] will hold the sum of the next 2 values, and sum[0] will hold the one remaining value:

for i = 0 to n - 1:
    value = x[i]
    place = 0
    while (i & (1 << place)):
        value += sum[place]
        ++place
    sum[place] = value
value = 0
place = 0
while (1 << place) ≤ n
    if (n & (1 << place)):
        value += sum[place]
    ++place
return value

Accuracy

Suppose that one is summing n values x_i, for i = 1, ..., n. The exact sum is:

$S_n=\sum _{i=1}^n{x}_i$

(computed with infinite precision).

With pairwise summation for a base case N = 1, one instead obtains $S_n+E_n$, where the error $E_n$ is bounded above by:

$\left|E_n\right|\le \frac{\epsilon {\log }_{2}n}{1-\epsilon {\log }_{2}n}\sum _{i=1}^n\left|x_i\right|$

where ε is the machine precision of the arithmetic being employed (e.g. ε ≈ 10⁻¹⁶ for standard double precision floating point). Usually, the quantity of interest is the relative error $\left|E_n\right|/\left|S_n\right|$, which is therefore bounded above by:

$\frac{\left|E_n\right|}{\left|S_n\right|}\le \frac{\epsilon {\log }_{2}n}{1-\epsilon {\log }_{2}n}\left(\frac{\sum _{i=1}^n\left|x_i\right|}{\left|\sum _{i=1}^n{x}_i\right|}\right).$

In the expression for the relative error bound, the fraction (Σ|x_i|/|Σx_i|) is the condition number of the summation problem. Essentially, the condition number represents the intrinsic sensitivity of the summation problem to errors, regardless of how it is computed. The relative error bound of every (backwards stable) summation method by a fixed algorithm in fixed precision (i.e. not those that use arbitrary precision arithmetic, nor algorithms whose memory and time requirements change based on the data), is proportional to this condition number. An ill-conditioned summation problem is one in which this ratio is large, and in this case even pairwise summation can have a large relative error. For example, if the summands x_i are uncorrelated random numbers with zero mean, the sum is a random walk and the condition number will grow proportional to $\sqrt{n}$. On the other hand, for random inputs with nonzero mean the condition number asymptotes to a finite constant as $n\to \mathrm{\infty }$. If the inputs are all non-negative, then the condition number is 1.

Note that the $1-\epsilon {\log }_{2}n$ denominator is effectively 1 in practice, since $\epsilon {\log }_{2}n$ is much smaller than 1 until n becomes of order 2^1/ε, which is roughly 10¹⁰¹⁵ in double precision.

In comparison, the relative error bound for naive summation (simply adding the numbers in sequence, rounding at each step) grows as $O(\epsilon n)$ multiplied by the condition number. In practice, it is much more likely that the rounding errors have a random sign, with zero mean, so that they form a random walk; in this case, naive summation has a root mean square relative error that grows as $O(\epsilon \sqrt{n})$ and pairwise summation as an error that grows as $O(\epsilon \sqrt{\log n})$ on average.