pith. sign in

arxiv: 1309.2877 · v1 · pith:KHHMEAAWnew · submitted 2013-09-11 · 💻 cs.SC · math.NT

Rigorous high-precision computation of the Hurwitz zeta function and its derivatives

classification 💻 cs.SC math.NT
keywords zetafunctionarbitraryderivativeshurwitzimplementationrigorousalgorithms
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Fast Ramanujan--type Series for Logarithms. Part II

    math.NT 2025-06 unverdicted novelty 6.0

    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...