Jump to content

Odlyzko–Schönhage algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 02:03, 6 June 2008 (The "stub" notice is used too much, but this time it seems apt since there's nothing about how the algorithm works.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, the Odlyzko-Schönhage algorithm, named after Andrew Odlyzko and Arnold Schönhage, is a fast algorithm for evaluating the Riemann zeta function, introduced 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
Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Odlyzko–Schönhage_algorithm&oldid=217450360"