Advertisement
MatsGranvik

Most zeta zeros by two step iterative bisection.

Jul 19th, 2017
171
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.09 KB | None | 0 0
  1. Clear[x, k, c, numberOfIterations, i, t, x1, x2, f, a, b]
  2. f[a_] = 2*Pi*E^1*
  3. E^LambertW[((a/(2*Pi))*Log[a/(2*Pi*E)] +
  4. Arg[Zeta[j]/Zeta[1/2 + I*a + j - 1]]/Pi - c + k -
  5. RiemannSiegelTheta[a]/Pi)/E^1];
  6. numberOfIterations = 20;
  7. (*Interesting values of c are:c=0,c=1/2,c=1/4,c=3/4*)
  8. (*c=0 gives Gram points*)
  9. (*c=1/2 gives Franca-LeClair points*)
  10. (*c=1/4 gives non-zero self \
  11. intersections:Re[Zeta[1/2+I*t]]=Im[Zeta[1/2+I*t]]*)
  12. (*c=3/4 gives:Re[Zeta[1/2+I*t]]=-Im[Zeta[1/2+I*t]]*)
  13. c = 1/2;
  14. j = 1 + 1/10^40;
  15. nn = 137;
  16. Monitor[Table[
  17. a = 2*Pi*Exp[1]*Exp[ProductLog[(k + 1 - 11/8)/Exp[1]]];
  18. b = a;
  19. Table[
  20. a = N[Round[f[b], 10^-15], 14];
  21. b = N[Round[f[a], 10^-15], 14];
  22. {a, b}, {i, 1, numberOfIterations + 11}];
  23. z = Table[
  24. cc = (N[Round[a, 10^-15], 14] + N[Round[b, 10^-15], 14])/2;
  25. s = Sign[b - a]*Sign[f[cc] - cc];
  26. a = (1 + s)/2*cc + (1 - s)/2*a;
  27. b = (1 - s)/2*cc + (1 + s)/2*b;
  28. {a, b}, {i, 1, numberOfIterations + 11}];
  29. Mean[z[[numberOfIterations + 10]]](*,
  30. N[Im[ZetaZero[k+1]],14]*), {k, 0, nn - 1}], k]
  31. % - Im[ZetaZero[Range[nn]]]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement