Arnold Schönhage
Template:Short description Template:Infobox scientist
Arnold Schönhage (born 1 December 1934 in Lockhausen, now Bad Salzuflen) is a German mathematician and computer scientist.
Schönhage was professor at the Rheinische Friedrich-Wilhelms-Universität, Bonn,<ref name=":0">{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> and also in Tübingen and Konstanz.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>
Together with Volker Strassen, he developed the Schönhage–Strassen algorithm for the multiplication of large numbers<ref name=":0" /><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> that has a runtime of O(N log N log log N). For many years, this was the fastest way to multiply large integers, although Schönhage and Strassen predicted that an algorithm with a run-time of N(logN) should exist. In 2019, Joris van der Hoeven and David Harvey finally developed an algorithm with this runtime, proving that Schönhage's and Strassen's prediction had been correct.<ref>Template:Cite journal</ref>
Schönhage designed and implemented together with Andreas F. W. Grotefeld and Ekkehart Vetter a multitape Turing machine, called TP, in software. The machine is programmed in TPAL, an assembler language. They implemented numerous numerical algorithms, including the Schönhage–Strassen algorithm, on this machine.
The Odlyzko–Schönhage algorithm<ref name="Odlyzko Schonhage 1988">Template:Cite journal</ref> from 1988 is regularly used in research on the Riemann zeta function.
References
External links
- 1934 births
- Living people
- People from Bad Salzuflen
- German computer scientists
- Approximation theorists
- People from the Free State of Lippe
- 20th-century German mathematicians
- 21st-century German mathematicians
- Academic staff of the University of Bonn
- Academic staff of the University of Tübingen
- Academic staff of the University of Konstanz
- University of Cologne alumni