On Monday, December 31, 2012 6:45:13 PM UTC-6, Roman Pearce wrote: > Something seems wrong here with the performance of PolynomialQuotient. Is there blowup because the leading coefficient in x is a polynomial? Also it seems slower in Mathematica 9 versus v8. > > > > d = 5 > > f = Expand[ ((1+x)*(1+y)*(1+z))^d + 1 ]; > > g = Expand[ ((1-x)*(1-y)*(1-z))^d + 1 ]; > > AbsoluteTiming[ p = Expand[ f g ]; ] > > AbsoluteTiming[ q = PolynomialQuotient[p, f, x]; ] > > AbsoluteTiming[ P = Factor[ p ]; ] > > > > What is the preferred method for (exact) division of polynomials? On this example I tried Cancel[ p/f ] and it works fine, but on other problems it is faster to use PolynomialQuotient. Suggestions?
Yes, PolynomialQuotient is slow. It is, as you suspected, intrinsically "univariate" and thus does not work in a fraction-free manner when coefficients are themselves polynomials.
Here are some possibilities for improved speed.
(1) Use PolynomialReduce (in the sense of computing Groebner bases).
(2) Use PolynomialMod, as that seems better able to find a remainder quickly. Then subtract that from the dividend and Together the result over the divisor. If you know the division is exact to begin (as in this example) with you can skip the PolynomialMod step.
(3) Use a certain (undocumented) internal function.