Fast multiplication and its applications

This survey explains how some useful arithmetic operations can be sped up from quadratic time to essentially linear time.

[1]  J. Sylvester.  XLV. On a fundamental rule in the algorithm of continued fractions , 1853 .

[2]  Gerald Estrin,et al.  Organization of Computer Systems-the Fixed Plus Variable Structure Computer , 1899 .

[3]  D. H. Lehmer.  Euclid's Algorithm for Large Numbers , 1938 .

[4]  A. Brauer.  On addition chains , 1939 .

[5]  James D. Tupac.  Afips conference proceedings , 1963 .

[6]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[7]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[8]  Thomas G. Stockham,et al.  High-speed convolution and correlation , 1966, AFIPS '66 (Spring).

[9]  W. M. Gentleman,et al.  Fast Fourier Transforms: for fun and profit , 1966, AFIPS '66 (Fall).

[10]  Glenn D. Bergland,et al.  Numerical Analysis: A fast fourier transform algorithm for real-valued series , 1968, CACM.

[11]  R. Yavne,et al.  An economical method for calculating the discrete Fourier transform , 1899, AFIPS Fall Joint Computing Conference.

[12]  S. Cook,et al.  ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS , 1969 .

[13]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[14]  Peter J. Nicholson,et al.  Algebraic Theory of Finite Fourier Transforms , 1971, Journal of computer and system sciences (Print).

[15]  Ellis Horowitz,et al.  On Decreasing the Computing Time for Modular Arithmetic , 1971, SWAT.

[16]  J. Pollard,et al.  The fast Fourier transform in a finite field , 1971 .

[17]  Ellis Horowitz,et al.  A Fast Method for Interpolation Using Preconditioning , 1972, Information Processing Letters.

[18]  Thomas Simpson.  Essays on several curious and useful subjects, in speculative and mix'd mathematics : illustrated by a variety of examples , 1972 .

[19]  Charles M. Fiduccia,et al.  Polynomial evaluation via the division algorithm the fast Fourier transform revisited , 1972, STOC.

[20]  13th Annual Symposium on Switching and Automata Theory, College Park, Maryland, USA, October 25-27, 1972 , 1972, SWAT.

[21]  Allan Borodin,et al.  Fast Modular Transforms via Division , 1972, SWAT.

[22]  Patrick C. Fischer,et al.  Special SIGACT issueFourth Annual ACM Symposium on Theory of Computing , 1973 .

[23]  Harold S. Stone,et al.  A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations , 1973, IEEE Transactions on Computers.

[24]  V. Strassen.  Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten , 1973 .

[25]  Robert T. Moenck,et al.  Fast computation of GCDs , 1973, STOC.

[26]  Harold S. Stone,et al.  An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations , 1973, JACM.

[27]  Ieee Acoustics,et al.  IEEE Transactions on Acoustics, Speech, and Signal Processing , 1974 .

[28]  Peter M. Kogge,et al.  Parallel Solution of Recurrence Problems , 1974, IBM J. Res. Dev..

[29]  H. T. Kung.  On computing reciprocals of power series , 1974 .

[30]  Allan Borodin,et al.  Fast Modular Transforms , 1974, J. Comput. Syst. Sci..

[31]  L. S. GODDARD.  Computers in mathematics , 1974, Nature.

[32]  New Mexico,et al.  Proceedings of Seventh Annual ACM Symposium on Theory of Computing , 1975 .

[33]  E. V. Krishnamurtht.  Matrix processors using p-ADIC arithmetic for exact linear computations , 1975, 1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH).

[34]  Joseph F. Traub.  Analytic Computational Complexity , 1976 .

[35]  E. Salamin,et al.  Computation of π Using Arithmetic-Geometric Mean , 1976 .

[36]  Richard P. Brent,et al.  Fast Multiple-Precision Evaluation of Elementary Functions , 1976, JACM.

[37]  Richard P. Brent,et al.  The Complexity of computational problem solving , 1976 .

[38]  G. Bruun.  z-transform DFT filters and FFT's , 1978 .

[39]  R. Nigel Horspool,et al.  A New Representation of the Rational Numbers for Fast Easy Arithmetic , 1979, SIAM J. Comput..

[40]  H. Nussbaumer,et al.  Fast polynomial transform algorithms for digital convolution , 1980 .

[41]  David Y. Y. Yun,et al.  Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants , 1980, J. Algorithms.

[42]  Richard P. Brent,et al.  Some New Algorithms for High-Precision Computation of Euler’s Constant , 1980 .

[43]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[44]  Volker Strassen,et al.  The computational complexity of continued fractions , 1981, SYMSAC '81.

[45]  D. H. Lehmer.  Error-Free Computation: Why It is Needed and Methods for Doing It (Robert Todd Gregory) , 1982 .

[46]  Arnold Schönhage,et al.  Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients , 1982, EUROCAM.

[47]  M. Vetterli,et al.  Simple FFT and DCT algorithms with reduced number of operations , 1984 .

[48]  P. Duhamel,et al.  `Split radix' FFT algorithm , 1984 .

[49]  J. Martens.  Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform , 1984 .

[50]  Don H. Johnson,et al.  Gauss and the history of the fast Fourier transform , 1985 .

[51]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[52]  Jonathan M. Borwein,et al.  Pi and the AGM , 1999 .

[53]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[54]  Luis Salinas,et al.  Computational Methods and Function Theory , 1990 .

[55]  Martin Vetterli,et al.  Fast Fourier transforms: a tutorial review and a state of the art , 1990 .

[56]  Nick Kollerstrom.  Thomas Simpson and ‘Newton's method of approximation’: an enduring myth , 1992 .

[57]  P. L. Montgomery,et al.  An FFT extension of the elliptic curve method of factorization , 1992 .

[58]  Tudor Jebelean,et al.  An Algorithm for Exact Division , 1993, J. Symb. Comput..

[59]  Rainer Göttfert.  An acceleration of the Niederreiter factorization algorithm in characteristic 2 , 1994 .

[60]  Arnold Schönhage,et al.  A New Approach to Resultant Computations and Other Algorithms with Exact Division , 1994, ESA.

[61]  B. Fagin,et al.  Discrete weighted transforms and large-integer arithmetic , 1994 .

[62]  Jonathan P. Sorenson.  Two Fast GCD Algorithms , 1994, J. Algorithms.

[63]  Jan van Leeuwen,et al.  Algorithms — ESA '94 , 1994, Lecture Notes in Computer Science.

[64]  Algorithms - ESA '94: Second Annual European Symposium, Utrecht, The Netherlands, September 26 - 28, 1994. Proceedings , 1994 .

[65]  Arnold Schönhage,et al.  Fast algorithms - a multitape Turing machine implementation , 1994 .

[66]  N F Fjortoft,et al.  Comparison of Activities and Attitudes of Baccalaureate Level and Entry-Level Doctor of Pharmacy Graduates of the University of Illinois at Chicago , 1995, The Annals of pharmacotherapy.

[67]  Paul Walton Purdom,et al.  The Analysis of Algorithms , 1995 .

[68]  Tjalling J. Ypma,et al.  Historical Development of the Newton-Raphson Method , 1995, SIAM Rev..

[69]  Tudor Jebelean,et al.  Practical integer division with Karatsuba complexity , 1997, ISSAC.

[70]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[71]  Alan H. Karp,et al.  High-precision division and square root , 1997, TOMS.

[72]  Jeffrey Shallit,et al.  Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.

[73]  Bruno Haible,et al.  Fast Multiprecision Evaluation of Series of Rational Numbers , 1998, ANTS.

[74]  Daniel J. Bernstein,et al.  Detecting perfect powers in essentially linear time , 1998, Math. Comput..

[75]  Joachim Ziegler,et al.  Fast recursive division , 1998 .

[76]  Ekatharine A. Karatsuba,et al.  Fast evaluation of hypergeometric functions by FEE , 1999 .

[77]  Joris van der Hoeven,et al.  Fast Evaluation of Holonomic Functions , 1999, Theor. Comput. Sci..

[78]  Edward B. Saff,et al.  Computational Methods and Function Theory 1997: Proceedings of the Third CMFT Conference , 1999 .

[79]  Arnold Schönhage.  Variations on computing reciprocals of power series , 2000, Inf. Process. Lett..

[80]  Jonathan M. Borwein,et al.  Computational strategies for the Riemann zeta function , 2000 .

[81]  D. Bernstein.  HOW TO FIND SMALL FACTORS OF INTEGERS , 2000 .

[82]  Donald E. Knuth,et al.  Selected papers on analysis of algorithms , 2000, CSLI lecture notes series.

[83]  Jim Law.  Selected papers on analysis of algorithms , 2001, SOEN.

[84]  Joris van der Hoeven,et al.  Fast Evaluation of Holonomic Functions Near and in Regular Singularities , 2001, J. Symb. Comput..

[85]  Peter Deuflhard,et al.  Numerische Mathematik. I , 2002 .

[86]  Hoon Hong.  Proceedings of the 2003 international symposium on Symbolic and algebraic computation , 2003, ISSAC 2003.

[87]  Éric Schost,et al.  Tellegen's principle into practice , 2003, ISSAC '03.

[88]  Damien Stehlé,et al.  A Binary Recursive Gcd Algorithm , 2004, ANTS.

[89]  Éric Schost,et al.  Complexity issues in bivariate polynomial factorization , 2004, ISSAC '04.

[90]  D. Bernstein.  HOW TO FIND SMOOTH PARTS OF INTEGERS , 2004 .

[91]  Josef Schicho.  Proceedings of the 2004 international symposium on Symbolic and algebraic computation , 2004, ISSAC 2004.

[92]  Duncan A. Buell.  Algorithmic number theory : 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004 : proceedings , 2004 .

[93]  Arnold Schönhage,et al.  Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2 , 1977, Acta Informatica.

[94]  Arnold Schönhage,et al.  Schnelle Berechnung von Kettenbruchentwicklungen , 1971, Acta Informatica.

[95]  Sartaj Sahni,et al.  Analysis of algorithms , 2000, Random Struct. Algorithms.

[96]  T. Wirth,et al.  Proving the Primality of Very Large Numbers with fastECPP , 2004, ANTS.

[97]  REMOVING REDUNDANCY IN HIGH-PRECISION NEWTON ITERATION , 2004 .

[98]  Malte Sieveking.  An algorithm for division of powerseries , 2005, Computing.

[99]  Arnold Schönhage.  Multiplikation großer Zahlen , 2005, Computing.

[100]  Arnold Schönhage,et al.  Schnelle Multiplikation großer Zahlen , 1971, Computing.

[101]  Daniel J. Bernstein,et al.  Factoring into coprimes in essentially linear time , 2005, J. Algorithms.

[102]  Erich Kaltofen,et al.  On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.

[103]  Numerische Mathematik.  Exact Solution of Linear Equations Using P-Adie Expansions* , 2005 .

[104]  Steven G. Johnson,et al.  A Modified Split-Radix FFT With Fewer Arithmetic Operations , 2007, IEEE Transactions on Signal Processing.

[105]  Martin Fürer.  Faster integer multiplication , 2007, STOC '07.

[106]  Uriel Feige,et al.  Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007 , 2007, STOC.

[107]  Serdar Boztas,et al.  Applied Algebra, Algebraic Algorithms and Error-Correcting Codes , 2001, Lecture Notes in Computer Science.

[108]  Daniel J. Bernstein,et al.  The Tangent FFT , 2007, AAECC.

[109]  Daniel J. Bernstein,et al.  Detecting perfect powers by factoring into coprimes , 2007, Math. Comput..

[110]  T. Lundy,et al.  A new matrix approach to real FFTs and convolutions of length 2k , 2007, Computing.

[111]  Joris van der Hoeven.  Newton's method and FFT trading , 2010, J. Symb. Comput..

[112]  Richard P. Brent,et al.  The complexity of multiple-precision arithmetic , 2010, ArXiv.

[113]  Richard P. Brent,et al.  Multiple-precision zero-finding methods and the complexity of elementary function evaluation , 1975, ArXiv.

[114]  D. Bernstein.  MULTIDIGIT MULTIPLICATION FOR MATHEMATICIANS , 2022 .

[115]  DANIEL J. BERNSTEIN.  SCALED REMAINDER TREES , .