The Zetafast algorithm for computing zeta functions

Publication date 4 March 2017

Abstract: We express the Riemann zeta function

z e t a l e f t (s i g h t)

of argument

s = s i g m a + i a u

with imaginary part

a u

in terms of three absolutely convergent series. The resulting simple algorithm allows to compute, to arbitrary precision,

z e t a l e f t (s i g h t)

and its derivatives using at most

C l e f t (e p s i l o n i g h t) l e f t | a u i g h t |^{f r a c 12 + e p s i l o n}

summands for any

e p s i l o n > 0

, with explicit error bounds. It can be regarded as a quantitative version of the approximate functional equation. The numerical implementation is straightforward. The approach works for any type of zeta function with a similar functional equation such as Dirichlet

L

-functions, or the Davenport-Heilbronn type zeta functions.

This page was built for publication: The Zetafast algorithm for computing zeta functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283884)