An efficient algorithm for accelerating the convergence of oscillatory series, useful for computing the polylogarithm and Hurwitz zeta functions (Q2483049): Difference between revisions

In this paper the author studies 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. Both the Borwein and the Euler-McLaurin algorithms appears to offer a stable and fast way of computing the Hurwitz zeta function and the polylogarithm. The Euler-McLaurin algorithm offers superior performance for the Huwitz zeta. It should be possible to extend the techniques in this paper to provide a rapid globally convergent algorithm for the Lerch transcendental, thus enabling a deeper numerical exploration of its peculiarities.