An amortized-complexity method to compute the Riemann zeta function
暂无分享,去创建一个
A practical method to compute the Riemann zeta function is presented. The method can compute ζ(1/2 + it) at any [T 1/4 ] points in [T, T + T 1/4 ] using an average time of T 1/4+o(1) per point. This is the same complexity as the Odlyzko-Schonhage algorithm over that interval. Although the method far from competes with the Odlyzko-Schonhage algorithm over intervals much longer than T 1/4 , it still has the advantages of being elementary, simple to implement, it does not use the fast Fourier transform or require large amounts of storage space, and its error terms are easy to control. The method has been implemented, and results of timing experiments agree with its theoretical amortized complexity of T 1/4+o(1) .
[1] Xavier. The 10 13 first zeros of the Riemann Zeta function , and zeros computation at very large height , 2004 .
[2] Michael O. Rubinstein,et al. Computational methods and experiments in analytic number theory , 2004 .
[3] Arnold Schönhage,et al. Fast algorithms for multiple evaluations of the riemann zeta function , 1988 .