Journal
NUMERICAL ALGORITHMS
Volume 69, Issue 2, Pages 253-270Publisher
SPRINGER
DOI: 10.1007/s11075-014-9893-1
Keywords
Hurwitz zeta function; Riemann zeta function; Arbitrary-precision arithmetic; Rigorous numerical evaluation; Fast polynomial arithmetic; Power series
Categories
Funding
- Austrian Science Fund (FWF) [Y464-N18]
- Austrian Science Fund (FWF) [Y464] Funding Source: Austrian Science Fund (FWF)
Ask authors/readers for more resources
We study the use of the Euler-Maclaurin formula to numerically evaluate the Hurwitz zeta function zeta(s, a) for , 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available