Algorithms for Computer Algebra pp 23-77 | Cite as
Algebra of Polynomials, Rational Functions, and Power Series
Chapter
Abstract
In this chapter we present some basic concepts from algebra which are of central importance in the development of algorithms and systems for symbolic mathematical computation. The main issues distinguishing various computer algebra systems arise out of the choice of algebraic structures to be manipulated and the choice of representations for the given algebraic structures.
Keywords
Power Series Commutative Ring Integral Domain Computer Algebra Euclidean Algorithm
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.
Preview
Unable to display preview. Download preview PDF.
References
- 1.G. Birkoff and S. MacLanc, A Survey of Modern Algebra (3rd ed.), Macmillian (1965).Google Scholar
- 2.G. Birkoff and T.C. Bartee, Modern Applied Algebra, McGraw-Hill (1970).Google Scholar
- 3.W.S. Brown, “On Euclid’s Algorithm and the Computation of Polynomial Greatest Divisors,” J. ACM, 18 pp. 476–504 (1971).Google Scholar
- 4.D.E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms (second edition), Addison-Wesley (1981).Google Scholar
- 5.J.D. Lipson, Elements of Algebra and Algebraic Computing, Addision-Wesley (1981).Google Scholar
- 6.B.L. van der Waerden, Modern Algebra (Vols. I and II), Ungar (1970).Google Scholar
Copyright information
© Kluwer Academic Publishers 1992