Algebra of Polynomials, Rational Functions, and Power Series

K. O. Geddes, S. R. Czapor and G. Labahn
Additional contact information
K. O. Geddes: University of Waterloo
S. R. Czapor: Laurentian University
G. Labahn: University of Waterloo

Chapter Chapter 2 in Algorithms for Computer Algebra, 1992, pp 23-77 from Springer

Abstract: 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 (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-585-33247-5_2

Ordering information: This item can be ordered from
http://www.springer.com/9780585332475

DOI: 10.1007/978-0-585-33247-5_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().