We describe an approach to the computation of symbolic resultants in which factors are removed during the course of the calculation, so reducing the stack size required for intermediate expressions and the storage space needed. We apply the technique to three well-established methods for calculating resultants. We demonstrate the advantages of our approach when the resultants are large and show that some otherwise intractable problems can be resolved. In certain cases a significant reduction in the cpu time required to calculate the resultant is also evident. Keywords. symbolic computation, multivariate resultants.
Jane M. Pearson, Noel G. Lloyd