Fast methods to compute the Riemann zeta function
From MaRDI portal
Publication:640804
DOI10.4007/ANNALS.2011.174.2.4zbMATH Open1243.11118arXiv0711.5005OpenAlexW2138245810MaRDI QIDQ640804FDOQ640804
Publication date: 20 October 2011
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Abstract: The Riemann zeta function on the critical line can be computed using a straightforward application of the Riemann-Siegel formula, Sch"onhage's method, or Heath-Brown's method. The complexities of these methods have exponents 1/2, 3/8 (=0.375), and 1/3 respectively. In this paper, three new fast and potentially practical methods to compute zeta are presented. One method is very simple. Its complexity has exponent 2/5. A second method relies on this author's algorithm to compute quadratic exponential sums. Its complexity has exponent 1/3. The third method employs an algorithm, developed in this paper, to compute cubic exponential sums. Its complexity has exponent 4/13 (approximately, 0.307).
Full work available at URL: https://arxiv.org/abs/0711.5005
(zeta (s)) and (L(s, chi)) (11M06) Weyl sums (11L15) Number-theoretic algorithms; complexity (11Y16) Analytic computations (11Y35)
Cites Work
- Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
- Computational methods and experiments in analytic number theory
- Some Calculations of the Riemann Zeta-Function
- Riemann's zeta function
- Numerics of analytic functions and complexity
- A nearly-optimal method to compute the truncated theta function, its derivatives, and integrals
- A new asymptotic representation for ζ(½ + i t ) and quantum spectral determinants
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- An alternative to Riemann-Siegel type formulas
- Computing Dirichlet character sums to a power-full modulus
- An explicit van der Corput estimate for \(\zeta(1/2+it)\)
- Fast computation of the Riemann zeta-function \(\zeta (s)\) for integer values of the argument \(s\)
- A nearly-optimal method to compute the truncated theta function, its derivatives, and integrals
- Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
- Error functions, Mordell integrals and an integral analogue of a partial theta function
- Zeros of partial sums of \(L\)-functions
- New Computations of the Riemann Zeta Function on the Critical Line
- Good-to-Bad Gram Point Ratio for Riemann Zeta Function
- A fast algorithm to compute \(L(1/2, f\times \chi_q)\)
- Lower bounds for Z-numbers
- Fast computation of \(\zeta(3)\) and of some special integrals using the Ramanujan formula and polylogarithms
- Limit theorems for the coefficients of the modified Borwein method for the calculation of the Riemann zeta-function values
- Isolating some non-trivial zeros of zeta
- Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
- On the evaluation of some sparse polynomials
- Book review of: H. Iwaniec, Lectures on the Riemann zeta function
- Asymptotics and formulas for cubic exponential sums
- Computing the truncated theta function via Mordell integral
This page was built for publication: Fast methods to compute the Riemann zeta function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640804)
