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
31 Citations
Fast and Rigorous Computation of Special Functions to High Precision
  • 6
  • PDF
The Polylogarithm Function in Julia
  • 1
  • PDF
Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
  • 29
  • PDF
Series with Binomial-Like Coefficients for Evaluation and 3D Visualization of Zeta Functions
  • PDF
Modern Computer Arithmetic
  • 178
  • PDF
THE BERNOULLI OPERATOR
  • PDF
A new non-negative distribution with both finite and infinite support
  • PDF
...
1
2
3
4
...

References

SHOWING 1-10 OF 47 REFERENCES
...
1
2
3
4
5
...