论文信息 - Fast Method for Locating Peak Values of the Riemann Zeta Function on the Critical Line

Fast Method for Locating Peak Values of the Riemann Zeta Function on the Critical Line

In this paper a new algorithm RS-PEAK will be presented for locating peak values of the Riemann zeta function on the critical line. The method based on earlier results of Andrew M. Odlyzko, Tadej Kotnik, and on a recently achieved results of solving simultaneous Diophantine approximation problems. Until 2014 only a few hundred values were known where the Riemann-Siegel Z-function (i.e: Z(t)) larger than 1000, mainly found by Ghaith Ayesh Hiary and Jonathan Bober. By applying the algorithm RS-PEAK thousands of large values can be produced where |Z(t)| > 1000 within a few hours on a single desktop PC. The aim of this paper is to describe the RS-PEAK algorithm by which many large values of Z(t) can be generated in order to be able to reveal new behaviours of the Riemann zeta function. Using RS-PEAK more than 20 000 values had been found during a two weeks period where |Z(t)| > 1000. The largest known Z(t) values are presented where log |Z(t)|/log(t) > 32=205.

Norbert Tihanyi | Norbert Tihanyi

[1] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[2] Tony Feng,et al. Riemann's Zeta Function , 2014 .

[3] M. Huxley. Exponential Sums and the Riemann Zeta Function V , 2005 .

[4] R. Sherman Lehman,et al. Separation of zeros of the Riemann zeta-function , 1966 .

[5] Tadej Kotnik,et al. Computational estimation of the order of zeta (1/2 + it) , 2003, Math. Comput..

[6] Ghaith Ayesh Hiary,et al. Fast methods to compute the Riemann zeta function , 2007, 0711.5005.

[7] Arnold Schönhage,et al. Fast algorithms for multiple evaluations of the riemann zeta function , 1988 .

[8] Richard P. Brent,et al. On the zeros of the Riemann zeta function in the critical strip , 1979 .

[9] Norbert Tihanyi,et al. Efficient computing of n-dimensional simultaneous Diophantine approximation problems , 2013 .