Odlyzko-Schönhage algorithm

From Wikipedia, the free encyclopedia

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.

[edit] 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, <http://links.jstor.org/sici?sici=0002-9947%28198810%29309%3A2%3C797%3AFAFMEO%3E2.0.CO%3B2-O>