Algorithms for Computer Algebra pp 111-149 | Cite as

# Arithmetic of Polynomials, Rational Functions, and Power Series

- 707 Downloads

## Abstract

In Chapter 2 we introduced the basic algebraic domains which are of interest to computer algebra. This was followed by the representation problem, that is, the problem of how elements of these algebras are to be represented in a computer environment. Having described the types of objects along with the various representation issues, there follows the problem of implementing the various algebraic operations that define the algebras. In this chapter we describe the arithmetic operations of addition, subtraction, multiplication, and division for these domains. In particular, we describe these fundamental operations in the ring of integers modulo n, the ring of formal power series over a field, and the ring of polynomials over an integral domain along with their quotient fields. The latter includes the domain of multiprecision integers and rational numbers.

## Keywords

Power Series Discrete Fourier Transform Arithmetic Operation Computer Algebra Modular Representation## Preview

Unable to display preview. Download preview PDF.

## References

- 1.R.P. Brent and H.T. Kung, “Fast Algorithms for Composition and Reversion of Power Series,” pp. 217–225 in
*Algorithms and Complexity*, ed. J.F. Traub, (1976).Google Scholar - 2.J.W. Cooley and J.W. Tuckey, “An Algorithm for the Machine Calculation of Complex Fourier Series,”
*Math. Comp.*,**19**pp. 297–301 (1965).zbMATHMathSciNetGoogle Scholar - 3.D. Coppersmith and S. Winograd, “Matrix Multiplication via Arithmetic Progressions,”
*J. Symbolic Comp.*,**8**(3) (1990).Google Scholar - 4.I.N. Herstein,
*Topics in Algebra*, Blaisdell (1964).Google Scholar - 5.A. Karatsuba, “Multiplication of Multidigit Numbers on Automata,”
*Soviet Physics — Doklady*,**7**pp. 595–596 (1963).Google Scholar - 6.D.E. Knuth,
*The Art of Computer Programming, Volume 2: Seminumerical Algorithms*(*second edition*), Addison-Wesley (1981).Google Scholar - 7.J.D. Lipson, “Newton’s Method: A Great Algebraic Algorithm,” pp. 260–270 in
*Proc. SYMSAC’ 76*, ed. R.D. Jenks, ACM Press (1976).Google Scholar - 8.J.D. Lipson,
*Elements of Algebra and Algebraic Computing*, Addision-Wesley (1981).Google Scholar - 9.R.T. Moenck, “Practical Fast Polynomial Multiplication,” pp. 136–145 in
*Proc. SYMSAC’ 76*, ed. R.D. Jenks, ACM Press (1976).Google Scholar - 10.V. Pan, “Strassen’s Algorithm is not Optimal,” pp. 166–176 in
*Proc. of 19-th IEEE Symp. on Foundations of Computer Science*, (1978).Google Scholar - 11.J.M. Pollard, “The Fast Fourier Transform in a Finite Field,”
*Math. Comp.*,**25**pp. 365–374 (1971).zbMATHMathSciNetGoogle Scholar - 12.A. Schonhage and V. Strassen, “Schnelle Multiplikation Grosser Zahlen,”
*Computing*,**7**pp. 281–292 (1971).CrossRefMathSciNetGoogle Scholar - 13.V. Strassen, “Gaussian Elimination is not Optimal,”
*Numerische Mathematik*,**13**pp. 354–356 (1969).zbMATHCrossRefMathSciNetGoogle Scholar - 14.J.F. Traub and H.T. Kung, “All Algebraic Functions Can Be Computed Fast,”
*J. ACM*, pp. 245–260 (1978).Google Scholar