Results 1  10
of
25
On the distribution of spacings between zeros of the zeta function
 MATH. COMP
, 1987
"... A numerical study of the distribution of spacings between zeros of the Riemann zeta function is presented. It is based on values for the first 10 5 zeros and for zeros number 10 12 + 1 to 10 12 + 10 5 that are accurate to within ± 10 − 8, and which were calculated on the Cray1 and Cray XMP compute ..."
Abstract

Cited by 81 (9 self)
 Add to MetaCart
A numerical study of the distribution of spacings between zeros of the Riemann zeta function is presented. It is based on values for the first 10 5 zeros and for zeros number 10 12 + 1 to 10 12 + 10 5 that are accurate to within ± 10 − 8, and which were calculated on the Cray1 and Cray XMP computers. This study tests the Montgomery pair correlation conjecture as well as some further conjectures that predict that the zeros of the zeta function behave similarly to eigenvalues of random hermitian matrices. Matrices of this type are used in modeling energy levels in physics, and many statistical properties of their eigenvalues are known. The agreement between actual statistics for zeros of the zeta function and conjectured results is generally good, and improves at larger heights. Several initially unexpected phenomena were found in the data and some were explained by
Computational strategies for the Riemann zeta function
, 2000
"... We provide a compendium of evaluation methods for the Riemann zeta function, presenting formulae ranging from historical attempts to recently found convergent series to curious oddities old and new. We concentrate primarily on practical computational issues, such issues depending on the domain of th ..."
Abstract

Cited by 48 (9 self)
 Add to MetaCart
We provide a compendium of evaluation methods for the Riemann zeta function, presenting formulae ranging from historical attempts to recently found convergent series to curious oddities old and new. We concentrate primarily on practical computational issues, such issues depending on the domain of the argument, the desired speed of computation, and the incidence of what we call “value recycling”.
Fast algorithms for multiple evaluations of the Riemann zeta function
 Trans. Amer. Math. Soc
, 1988
"... ABSTRACT. The best previously known algorithm for evaluating the Riemann zeta function, c,(a + it), with a bounded and t large to moderate accuracy (within ±t~c for some c> 0, say) was based on the RiemannSiegel formula and required on the order of fc1/2 operations for each value that was computed. ..."
Abstract

Cited by 47 (6 self)
 Add to MetaCart
ABSTRACT. The best previously known algorithm for evaluating the Riemann zeta function, c,(a + it), with a bounded and t large to moderate accuracy (within ±t~c for some c> 0, say) was based on the RiemannSiegel formula and required on the order of fc1/2 operations for each value that was computed. New algorithms are presented in this paper which enable one to compute any single value of c(cr + it) with a fixed and T < t < T + Tlf2 to within ±t~c in 0(te) operations on numbers of O(logi) bits for any e> 0, for example, provided a precomputation involving 0(T1f2+e) operations and 0(T1f2+e) bits of storage is carried out beforehand. These algorithms lead to methods for numerically verifying the Riemann hypothesis for the first n zeros in what is expected to be 0(n1+s) operations (as opposed to about n3/2 operations for the previous method), as well as improved algorithms for the computation of various arithmetic functions, such as 7r(i). The new zeta function algorithms use the fast Fourier transform and a new method for the evaluation of certain rational functions. They can also be applied to the evaluation of Lfunctions, Epstein zeta functions, and other Dirichlet series. 1. Introduction. Some
The Riemann Zeros and Eigenvalue Asymptotics
 SIAM Rev
, 1999
"... Comparison between formulae for the counting functions of the heights t n of the Riemann zeros and of semiclassical quantum eigenvalues En suggests that the t n are eigenvalues of an (unknown) hermitean operator H, obtained by quantizing a classical dynamical system with hamiltonian H cl . Many feat ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
Comparison between formulae for the counting functions of the heights t n of the Riemann zeros and of semiclassical quantum eigenvalues En suggests that the t n are eigenvalues of an (unknown) hermitean operator H, obtained by quantizing a classical dynamical system with hamiltonian H cl . Many features of H cl are provided by the analogy; for example, the "Riemann dynamics" should be chaotic and have periodic orbits whose periods are multiples of logarithms of prime numbers. Statistics of the t n have a similar structure to those of the semiclassical En ; in particular, they display randommatrix universality at short range, and nonuniversal behaviour over longer ranges. Very refined features of the statistics of the t n can be computed accurately from formulae with quantum analogues. The RiemannSiegel formula for the zeta function is described in detail. Its interpretation as a relation between long and short periodic orbits gives further insights into the quantum spectral fluctuations. We speculate that the Riemann dynamics is related to the trajectories generated by the classical hamiltonian H cl = XP. Key words. spectral asymptotics, number theory AMS subject classifications. 11M26, 11M06, 35P20, 35Q40, 41A60, 81Q10, 81Q50 PII. S0036144598347497 1.
Evidence for a Spectral Interpretation of the Zeros of LFunctions
, 1998
"... By looking at the average behavior (nlevel density) of the low lying zeros of certain families of Lfunctions, we find evidence, as predicted by function field analogs, in favor of a spectral interpretation of the nontrivial zeros in terms of the classical compact groups. This is further supported ..."
Abstract

Cited by 33 (7 self)
 Add to MetaCart
By looking at the average behavior (nlevel density) of the low lying zeros of certain families of Lfunctions, we find evidence, as predicted by function field analogs, in favor of a spectral interpretation of the nontrivial zeros in terms of the classical compact groups. This is further supported by numerical experiments for which an efficient algorithm to compute Lfunctions was developed and implemented. iii Acknowledgements When Mike Rubinstein woke up one morning he was shocked to discover that he was writing the acknowledgements to his thesis. After two screenplays, a 40000 word manifesto, and many fruitless attempts at making sushi, something resembling a detailed academic work has emerged for which he has people to thank. Peter Sarnak from Chebyshev's Bias to USp(1). For being a terrific advisor and teacher. For choosing problems suited to my talents and involving me in this great project to understand the zeros of Lfunctions. Zeev Rudnick and Andrew Oldyzko for many disc...
Primes in arithmetic progressions
 Math. Comp
, 1996
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
Numerical computations concerning the ERH
 Math. Comp
, 1993
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
Random matrices and Lfunctions
 J. PHYS A MATH GEN
, 2003
"... In recent years there has been a growing interest in connections between the statistical properties of number theoretical Lfunctions and random matrix theory. We review the history of these connections, some of the major achievements and a number of applications. ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
In recent years there has been a growing interest in connections between the statistical properties of number theoretical Lfunctions and random matrix theory. We review the history of these connections, some of the major achievements and a number of applications.
SUPERCOMPUTERS AND THE RIEMANN ZETA FUNCTION
"... The Riemann Hypothesis, which specifies the location of zeros ofthe Riemann zeta function, and thus describes the behavior of primes, is one of the most famous unsolved problems inmathematics, and extensive efforts have been made over more than a century to check it numerically for large sets of c ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The Riemann Hypothesis, which specifies the location of zeros ofthe Riemann zeta function, and thus describes the behavior of primes, is one of the most famous unsolved problems inmathematics, and extensive efforts have been made over more than a century to check it numerically for large sets of cases. Recently a new algorithm, invented by the speaker and A. Schönhage, has been implemented, and used to compute over 175 million zeros near zero number 10^20. The new algorithm turned out to be over 5 orders of magnitude faster than older methods. The crucial ingredients in it are a rational function evaluation method similar to the GreengardRokhlin gravitational potential evaluation algorithm, the FFT, andbandlimited function interpolation. While the only present implementation is on a Cray, the algorithm can easily be parallelized.