AngouriMath

Navigation

← Back to list of members

HurwitzZeta​(AngouriMath.​Entity.​Number.​Complex,​AngouriMath.​Entity.​Number.​Complex)

 Method (no overloads)

Summary

The Hurwitz zeta function zeta(s, a) at the working precision, NaN at its pole s = 1 and where a is 0, -1, -2, ..., or null where it is not computed: an
infinite argument, or an s so far out that the sum would take too long.

Remarks

By the Euler–Maclaurin formula (DLMF 25.11.5 summed to N and 2.10.1 for the rest),
zeta(s, a) = sum_(k < N) (a + k)^(-s) + w^(1 - s)/(s - 1) + w^(-s)/2
+ sum_(j >= 1) B_(2j)/(2j)! s (s + 1) ... (s + 2j - 2) w^(-s - 2j + 1)
with w = a + N, which is
the analytic continuation for every s but 1 and every a but the poles, powers being
principal. N is taken with w at least 0.4 W + |s|/2 for W working digits: the
terms of the last sum fall until 2j is about 2 pi w - |s|, the smallest about
e^(-(2 pi w - |s|)) of the first, which is below 10^(-W).
Where the terms are much larger than the value, as they are for Re s below 0 or near a zero, the
digits lost to cancellation are counted and the sum is taken again with as many more. The Riemann zeta
function left of 0 is instead reflected (DLMF 25.4.1),
zeta(s) = 2^s pi^(s - 1) sin(pi s/2) Gamma(1 - s) zeta(1 - s), which loses nothing.
https://github.com/asc-community/AngouriMath/issues/2182

























Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 6003 pages online