Chemistry Reference and Research
           
 
Periodic Table
- standard table
- large table
 
Chemical Elements
- by name
- by symbol
- by atomic number
 
Chemical Properties
 
Chemical Reactions
 
Organic Chemistry
 
Branches of Chemistry
Analytical chemistry
Biochemistry
Computational Chemistry
Electrochemistry
Environmental chemistry
Geochemistry
Inorganic chemistry
Materials science
Medicinal chemistry
Nuclear chemistry
Organic chemistry
Pharmacology
Physical chemistry
Polymer chemistry
Supramolecular Chemistry
Thermochemistry

Schönhage-Strassen algorithm

In mathematics, the Schönhage-Strassen algorithm is an asympotically fast method for multiplication of large integer numbers. It was developed by Arnold Schönhage and Volker Strassen and published in Computing 7 (1971), 281-292. The run-time is O(N log N log log N). The algorithm uses Fast Fourier Transforms in rings with 2^{2^n}+1 elements recursively. A good explanation can be found in Donald Knuth's The Art of Computer Programming, Volume 2, 3rd ed., pp. 306-311, ISBN 0201896842.

Schönhage designed and implemented together with Andreas F. W. Grotefeld and Ekkehard 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.

External links

References
01-04-2007 01:16:19
The contents of this article are licensed from Wikipedia.org under the GNU Free Documentation License. How to see transparent copy