An efficient algorithm for the Hurwitz zeta and related functions

A simple class of algorithms for the efficient computation of the Hurwitz zeta and related special functions is given. The algorithms also provide a means of computing fundamental mathematical constants to arbitrary precision. A number of extensions as well as numerical examples are briefly described. The algorithms are easy to implement and compete with Euler–Maclaurin summation-based methods.