# Fast methods to compute the Riemann zeta function | Annals of Mathematics

Abstract The Riemann zeta function on the critical line can be computed using a straightforward application of the Riemann-Siegel formula, Schönhage’s method, or Heath-Brown’s method. The complexities of these methods have exponents 1/2, 3/8, and 1/3 respectively. In this article, 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, which is our main result, employs an algorithm developed here to compute cubic exponential sums with a small cubic coefficient. Its complexity has exponent 4/13 (approximately, 0.307).

KEYWORDS

SHARE & LIKE

### 数学年刊（Annals of Mathematics）

0 Following 0 Fans 0 Projects 674 Articles

SIMILAR ARTICLES

Abstract For any nondegenerate, quasi-homogeneous hypersurface singularity, we describe a family of moduli spaces, a virtual cycle, and a correspondin

Abstract For a large class of nonlinear Schrödinger equations with nonzero conditions at infinity and for any speed c less than the sound velocity, we

Abstract Let L2,p(ℝ2) be the Sobolev space of real-valued functions on the plane whose Hessian belongs to Lp. For any finite subset E⊂ℝ2 and p>2, let

Abstract We prove that for any group G in a fairly large class of generalized wreath product groups, the associated von Neumann algebra LG completely

Abstract We study the parity of 2-Selmer ranks in the family of quadratic twists of an arbitrary elliptic curve E over an arbitrary number field K. We

Abstract This paper has two main results. Firstly, we complete the parametrisation of all p-blocks of finite quasi-simple groups by finding the so-cal

Abstract We derive sharp Moser-Trudinger inequalities on the CR sphere. The first type is in the Adams form, for powers of the sublaplacian and for ge

Abstract We prove that isoparametric hypersurfaces with (g,m)=(6,2) are homogeneous, which answers Dorfmeister-Neher’s conjecture affirmatively and so

Abstract We prove the periodicity conjecture for pairs of Dynkin diagrams using Fomin-Zelevinsky’s cluster algebras and their (additive) categorificat

Abstract If F(x,y)∈ℤ[x,y] is an irreducible binary form of degree k≥3, then a theorem of Darmon and Granville implies that the generalized superellipt