• DOI:10.1007/s11075-007-9153-8
Corpus ID: 15131811

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

@article{Vepstas2007AnEA,
  title={An efficient algorithm for accelerating the convergence of oscillatory series, useful for computing the polylogarithm and Hurwitz zeta functions},
  author={L. Vepstas},
  journal={Numerical Algorithms},
  year={2007},
  volume={47},
  pages={211-252}
}

• L. Vepstas
• Published 2007
• Computer Science, Mathematics
• Numerical Algorithms

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 Lis(z) for general… Expand

View on Springer

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed