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).
| Original language | English |
|---|---|
| Pages (from-to) | 891-946 |
| Number of pages | 56 |
| Journal | Annals of Mathematics |
| Volume | 174 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Sept 2011 |
Fingerprint
Dive into the research topics of 'Fast methods to compute the Riemann zeta function'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver