Introduction to Computer Algebra

  • K. O. Geddes
  • S. R. Czapor
  • G. Labahn


The desire to use a computer to perform a mathematical computation symbolically arises naturally whenever a long and tedious sequence of manipulations is required. We have all had the experience of working out a result which required page after page of algebraic manipulation and hours (perhaps days) of our time. This computation might have been to solve a linear system of equations exactly where an approximate numerical solution would not have been appropriate. Or it might have been to work out the indefinite integral of a fairly complicated function for which it was hoped that some transformation would put the integral into one of the forms appearing in a table of integrals. In the latter case, we might have stumbled upon an appropriate transformation or we might have eventually given up without knowing whether or not the integral could be expressed in terms of elementary functions. Or it might have been any one of numerous other problems requiring symbolic manipulation.


Chebyshev Polynomial Computer Algebra Algebraic Manipulation Symbolic Computation Computer Algebra System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 2.
    “Symbol Manipulation Languages and Techniques,” in Proc. of the IFIP Working Conference on Symbol Manipulation Languages, Pisa, 1966, ed. D.G. Bobrow, North-Holland (1968).Google Scholar
  2. 4.
    Proc. of the Second Symposium on Symbolic and Algebraic Manipulation (SYMSAM’ 71), Los Angeles, ed. S.R. Petrick, ACM Press, New York (1971).Google Scholar
  3. 5.
    D. Barton and J.P. Fitch, “Applications of Algebraic Manipulation Programs in Physics,” Rep. Prog. Phys., 35 pp. 235–314 (1972).CrossRefGoogle Scholar
  4. 6.
    W.S. Brown and A.C. Hearn, “Applications of Symbolic Algebraic Computation,” Bell Labratories Computing Science Technical Report #66 (1978).Google Scholar
  5. 7.
    B.W. Char, K.O. Geddes, G.H. Gonnet, B.L. Leong, M.B. Monagan, and S.M. Watt, Maple V Language Reference Manual, Springer-Verlag (1991).Google Scholar
  6. 8.
    G.E. Collins, “Computer Algebra of Polynomials and Rational Functions,” Amer. Math. Monthly, 80 pp. 725–755 (1973).MATHCrossRefMathSciNetGoogle Scholar
  7. 9.
    A.C. Hearn, “Scientific Applications of Symbolic Computation,” pp. 83–108 in Computer Science and Scientific Computing, ed. J.M. Ortega, Academic Press, New York (1976).Google Scholar
  8. 10.
    A.D. Hall Jr., “The Altran System for Rational Function Manipulation — A Survey,” Comm. ACM, 14 pp. 517–521 (1971).CrossRefGoogle Scholar
  9. 11.
    J. Moses, “Algebraic Simplification: A Guide for the Perplexed,” Comm. ACM, 14 pp. 527–537 (1971).MATHCrossRefMathSciNetGoogle Scholar
  10. 12.
    J. Moses, “Algebraic Structures and their Algorithms,” pp. 301–319 in Algorithms and Complexity, ed. J.F. Traub, Academic Press, New York (1976).Google Scholar

Copyright information

© Kluwer Academic Publishers 1992

Authors and Affiliations

  • K. O. Geddes
    • 1
  • S. R. Czapor
    • 2
  • G. Labahn
    • 1
  1. 1.University of WaterlooCanada
  2. 2.Laurentian UniversityCanada

Personalised recommendations