=ADD=
=reftype=
14
=number=
00-11
=url=
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-11.ps.gz
=year=
2000
=month=
04
=author=
Schreiner; Wolfgang
=title=
A Note on Maple's GCD Computation of Partially Factored Polynomials
=abstract=
We report on a performance anomaly that may occur when Maple computes the
greatest common divisor of partially factored polynomials, i.e., polynomials
in the "product of factors" representation. Maple utilizes the partial
factorization of a polynomial to compute the gcd from the individual factors.
We have encountered an application in algebraic geometry where this
"optimization" makes the gcd computation very slow which also affects
the overall performance. We consider this as a hint that the view of a
polynomial as a syntactic expression is a source of pitfalls.
=keywords=
greatest common divisor, computer algebra, polynomial arithmetic.