An efficient algorithm for accelerating the convergence of oscillatory series,useful for computing the polylogarithm and Hurwitz zeta functions

This paper sketches a technique for improving the rate of convergence of a general oscillatory sequence, and then applies this series acceleration algorithm to the polylogarithm and the Hurwitz zeta function. As such, it may be taken as an extension of the techniques given by Borwein’s “An efficient algorithm for computing the Riemann zeta function” by Borwein for computing the Riemann zeta function, to more general series. The algorithm provides a rapid means of evaluating Li _s (z) for general values of complex s and a kidney-shaped region of complex z values given by ∣z ²/(z–1)∣<4. By using the duplication formula and the inversion formula, the range of convergence for the polylogarithm may be extended to the entire complex z-plane, and so the algorithms described here allow for the evaluation of the polylogarithm for all complex s and z values. Alternatively, the Hurwitz zeta can be very rapidly evaluated by means of an Euler–Maclaurin series. The polylogarithm and the Hurwitz zeta are related, in that two evaluations of the one can be used to obtain a value of the other; thus, either algorithm can be used to evaluate either function. The Euler–Maclaurin series is a clear performance winner for the Hurwitz zeta, while the Borwein algorithm is superior for evaluating the polylogarithm in the kidney-shaped region. Both algorithms are superior to the simple Taylor’s series or direct summation. The primary, concrete result of this paper is an algorithm allows the exploration of the Hurwitz zeta in the critical strip, where fast algorithms are otherwise unavailable. A discussion of the monodromy group of the polylogarithm is included.