Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
read the original abstract
We study the use of the Euler-Maclaurin formula to numerically evaluate the Hurwitz zeta function $\zeta(s,a)$ for $s, a \in \mathbb{C}$, along with an arbitrary number of derivatives with respect to $s$, to arbitrary precision with rigorous error bounds. Techniques that lead to a fast implementation are discussed. We present new record computations of Stieltjes constants, Keiper-Li coefficients and the first nontrivial zero of the Riemann zeta function, obtained using an open source implementation of the algorithms described in this paper.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Fast Ramanujan--type Series for Logarithms. Part II
Optimized multiseries hypergeometric formulas for single and multiple logarithms, found via integer programming on a lattice, enable efficient high-precision computation with demonstrated results exceeding 10^11 digit...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.