Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
Publication:3487499
DOI10.2307/2000939zbMath0706.11047OpenAlexW4251477635WikidataQ56913186 ScholiaQ56913186MaRDI QIDQ3487499
Andrew M. Odlyzko, Arnold Schönhage
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2000939
algorithmsRiemann zeta functionfast Fourier transformRiemann hypothesisprime counting functioncomputation of arithmetic functionsmultiple evaluations
Analysis of algorithms and problem complexity (68Q25) (zeta (s)) and (L(s, chi)) (11M06) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Analytic computations (11Y35) Values of arithmetic functions; tables (11Y70)
Related Items (34)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotische Entwicklungen der Dirichletschen L-Reihen
- Computing π(x): The Meissel-Lehmer Method
- On the Zeros of the Riemann Zeta Function in the Critical Strip. IV
- An Efficient Implementation of a Conformal Mapping Method Based on the Szegö Kernel
- Computing π(x): An analytic method
- On the Zeros of the Riemann Zeta Function in the Critical Strip
- On Computing Artin L-Functions in the Critical Strip
- On the Distribution of Spacings Between Zeros of the Zeta Function
- A Fast Algorithm for Trummer’s Problem
- On Epstein's zeta function
- An approximate functional equation for Dirichlet L -functions
- On Epstein's Zeta-function.
- A Method for the Calculation of the Zeta-Function
This page was built for publication: Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function