On Apr 9, 3:09 pm, Ondrej Certik <[email protected]> wrote: > > And if this helps, we can then try to think how to make this > automatic, so that you can just write: > > first * second - third**2 > > and it will be the same fast. > > Ondrej
Okay, I had already assumed that if first * second - third**2 was inside quo() like quo(first * second - third**2, fourth) that it would decide how to expand the numerator optimally, but maybe not quite yet. I see that sympy/sympy/polyclasses.py has a Dense Multivariate Polynomial class with methods that overload mul, sub, and sqr, which hopefully the following utilizes quo(Poly(first, domain='QQ') * Poly(second, domain='QQ') - Poly(third, domain='QQ')**2, Poly(fourth, domain='QQ')) So far, that is only using a small amount of RAM, but it is still calculating. I will report back when it finishes or errors. Thanks, Ben -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
