Evaluation of the Heuristic Polynomial

The Heuristic Polynomial GCD procedure (GCDHEU) is used by the Maple computer algebra system, but no other. Because Maple has an especially eecient kernel that provides fast integer arithmetic, but a relatively slower interpreter for non-kernel code, the GCDHEU routine is especially eeective in that it moves much of the computation into \bignum" arithmetic and hence executes primarily in the kernel. We speculated that in other computer algebra systems an implementation GCDHEU would not be advantageous. In particular, if all the system code is compiled to run at \full speed" in a (presumably more bulky) kernel that is entirely written in C or compiled Lisp, then there would seem to be no point in recasting the polynomial gcd problem into a bignum GCD problem. Manipulating polynomials that are vectors of coeecients would seem to be equivalent computationally to manipulating vectors of big digits. Yet our evidence suggests that one can take advantage of the GCDHEU in a Lisp system as well. Given a good implementation of bignums, for most small problems and many large ones, a substantial speedup can be obtained by the appropriate choice of GCD algorithm, including often enough, the GCDHEU approach. Another major winner seem to be the subresultant polynomial remainder sequence algorithm. Because more sophisticated sparse algorithms are relatively slow on small problems and only occasionally emerge as superior (on larger problems) it seems the choice of a fast GCD algorithm is tricky. 1 Introduction and objectives It is well known that GCD computations are very important in computer algebra systems, especially in simplifying rational expressions, computing partial fraction expansions, and similar canonical transformations 5, 10]. It is also useful in constructing reduced characteristic sets to prove geometry theorems 2].