2000 character limit reached
Rapid computation of special values of Dirichlet -functions
Published 20 Oct 2021 in math.NA, cs.NA, math.CA, and math.NT | (2110.10583v1)
Abstract: We consider computing the Riemann zeta function and Dirichlet -functions to -bit accuracy for large . Using the approximate functional equation together with asymptotically fast computation of the incomplete gamma function, we observe that bit complexity can be achieved if is an algebraic number of fixed degree and with algebraic height bounded by . This is an improvement over the complexity of previously published algorithms and yields, among other things, complexity algorithms for Stieltjes constants and complexity algorithms for computing the th Bernoulli number or the th Euler number exactly.
Paper Prompts
Sign up for free to create and run prompts on this paper.