Updates:
Status: Fixed
Comment #5 on issue 595 by asmeurer: improve polynomial algorithms:
factorization and non-rational coefficients
http://code.google.com/p/sympy/issues/detail?id=595
New polys with gmpy ground types:
In [1]: %timeit factor(expand((x + 2*x + 1)**20*(x**2 + 1)**10))
10 loops, best of 3: 55 ms per loop
In [2]: %timeit factor(expand((y*x + 2*x + z)**20*(y*x**2 + z)**10))
1 loops, best of 3: 6.91 s per loop
Sympy 0.6.6:
In [1]: %timeit factor(expand((x + 2*x + 1)**20*(x**2 + 1)**10))
10 loops, best of 3: 70.8 ms per loop
In [2]: %timeit factor(expand((y*x + 2*x + z)**20*(y*x**2 + z)**10))
1 loops, best of 3: 39.6 s per loop
(and no, it isn't expand):
In [4]: %timeit a = expand((y*x + 2*x + z)**20*(y*x**2 + z)**10)
1 loops, best of 3: 1.24 s per loop
I'm assuming that that is what was meant by parametric coefficients.
--
You received this message because you are listed in the owner
or CC fields of this issue, or because you starred this issue.
You may adjust your issue notification preferences at:
http://code.google.com/hosting/settings
--
You received this message because you are subscribed to the Google Groups
"sympy-issues" 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-issues?hl=en.
