Fast methods to compute the Riemann zeta function
From MaRDI portal
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).
Recommendations
- Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
- New computations of the Riemann zeta function on the critical line
- An amortized-complexity method to compute the Riemann zeta function
- High precision computation of Riemann's zeta function by the Riemann-Siegel formula. I
- scientific article; zbMATH DE number 1787206
Cites work
- scientific article; zbMATH DE number 3968684 (Why is no real title available?)
- scientific article; zbMATH DE number 3786901 (Why is no real title available?)
- scientific article; zbMATH DE number 1542664 (Why is no real title available?)
- scientific article; zbMATH DE number 194767 (Why is no real title available?)
- scientific article; zbMATH DE number 818427 (Why is no real title available?)
- 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
- Computational methods and experiments in analytic number theory
- Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
- Numerics of analytic functions and complexity
- Riemann's zeta function
- Some Calculations of the Riemann Zeta-Function
Cited in
(23)- An alternative to Riemann-Siegel type formulas
- Computing Dirichlet character sums to a power-full modulus
- An explicit van der Corput estimate for (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
- scientific article; zbMATH DE number 1787206 (Why is no real title available?)
- Error functions, Mordell integrals and an integral analogue of a partial theta function
- On the Cohen--Olivier algorithm for computing \(\zeta (s)\): error analysis in the real case for an arbitrary precision
- Zeros of partial sums of L-functions
- A fast algorithm to compute \(L(1/2, f\times \chi_q)\)
- Lower bounds for Z-numbers
- Good-to-bad Gram point ratio for Riemann zeta function
- An amortized-complexity method to compute the Riemann zeta function
- Fast computation of \(\zeta(3)\) and of some special integrals using the Ramanujan formula and polylogarithms
- Isolating some non-trivial zeros of zeta
- Limit theorems for the coefficients of the modified Borwein method for the calculation of the Riemann zeta-function values
- Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
- New computations of the Riemann zeta function on the critical line
- Asymptotics and formulas for cubic exponential sums
- Book review of: H. Iwaniec, Lectures on the Riemann zeta function
- On the evaluation of some sparse polynomials
- 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)
