Arithmetic in Basic Algebraic Domains

This chapter is devoted to the arithmetic Operations, essentially addition, multiplication, exponentiation, division, gcd calculation and evaluation, on the basic algebraic domains. The algorithms for these basic domains are those most frequently used in any Computer algebra system. Therefore the best known algorithms, from a computational point of view, are presented. The basic domains considered here are the rational integers, the rational numbers, integers modulo m, Gaussian integers, polynomials, rational functions, power series, finite fields and P-adic numbers. Bounds on the maximum, minimum and average Computing time (t +, t -, t*) for the various algorithms are given.

[1]  Robert T. Moenck,et al.  Practical fast polynomial multiplication , 1976, SYMSAC '76.

[2]  Richard J. Fateman.  Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments , 1974, SIAM J. Comput..

[3]  G. E. Collins.  Computer Algebra of Polynomials and Rational Functions , 1973 .

[4]  Ellis Horowitz.  The Efficient Calculation of Powers of Polynomials , 1972, SWAT.

[5]  Peter Henrici,et al.  Automatic Computations with Power Series , 1956, JACM.

[6]  Richard J. Fateman.  On the Computation of Powers of Sparse Polynomials , 1974 .

[7]  R. Moenck.  Studies in fast algebraic algorithms. , 1973 .

[8]  Donald Ervin Knuth,et al.  The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information , 1978 .

[9]  Peter Kornerup,et al.  A feasibility analysis of binary fixed-slash and floating-slash number systems , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

[10]  David A. Pope,et al.  Multiple precision arithmetic , 1960, CACM.

[11]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

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

[13]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[14]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

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

[16]  B. F. Caviness,et al.  Algorithms for Gaussian integer arithmetic , 1976, SYMSAC '76.

[17]  Henry Hansen,et al.  Introduction to P-Adic Numbers and their Functions , 1973 .

[18]  Mary Shaw,et al.  On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives , 1974, JACM.

[19]  Volker Strassen,et al.  The Computational Complexity of Continued Fractions , 1983, SIAM J. Comput..

[20]  David W. Matula.  Fixed-slash and floating-slash rational arithmetic , 1975, 1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH).

[21]  Peter Henrici.  A Subroutine for Computations with Rational Numbers , 1956, JACM.

[22]  Ellis Horowitz.  A Sorting Algorithm for Polynomial Multiplication , 1975, JACM.

[23]  Stephen C. Johnson,et al.  Sparse polynomial arithmetic , 1974, SIGS.

[24]  Peter Kornerup,et al.  An approximate rational arithmetic system with intrinsic recovery of simple fractions during expression evaluation , 1979, EUROSAM.

[25]  David R. Musser,et al.  Analysis of the Pope-Stein Division Algorithm , 1977, Information Processing Letters.

[26]  W. Gentleman.  Optimal multiplication chains for computing a power of a symbolic polynomial , 1972 .

[27]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

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

[29]  J. Hyde,et al.  The Alpak system for nonnumerical algebra on a digital computer — II: Rational functions of several variables and truncated power series with rational-function coefficients , 1964 .