Jump to content

Odlyzko–Schönhage algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by R.e.b. (talk | contribs) at 05:41, 6 November 2007 (new.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, the Odlyzko-Schönhage algorithm is a fast algorithm for evaluating the Riemann zeta function, intorduced in (Odlyzko & Schönhage 1988). It is used for finding large numbers of zeros of the Riemann zeta function on the critical line in order to study the Riemann hypothesis.

References

  • Odlyzko, A. M.; Schönhage, A. (1988), "Fast algorithms for multiple evaluations of the Riemann zeta function", Trans. Amer. Math. Soc., 309 (2): 797–809, MR0961614 {{citation}}: Unknown parameter |http://links.jstor.org/sici?sici= ignored (help)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Odlyzko–Schönhage_algorithm&oldid=169547125"