Polynomial GCD Computation

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 7 in Algorithms for Computer Algebra, 1992, pp 279-335 from Springer

Abstract: Abstract In many respects the problem of computing the greatest common divisor of two polyno- mials is a fundamental concern of algebraic manipulation. Once pioneer computer algebra systems (such as ALPAK or PM) had routines for polynomial operations, the natural pro gression was to develop routines for the manipulation of rational functions. It soon became apparent that rational manipulation leads to a severe problem of intermediate expression swell. For example, consider the problem of adding two rational functions.

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_7

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

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

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 ().