Comment #11 on issue 2607 by [email protected]: as_numer_denom() is too slow
http://code.google.com/p/sympy/issues/detail?id=2607
Re http://code.google.com/p/sympy/issues/detail?id=2607#c5
If you had vanilla powers on vanilla bases, like `x**a` in two
denominators, they would combine properly to give `x**2*a` and then
dividing by `x**a` would properly give `x**a`. So I think that would always
work. I think I tried to speed up that loop by computing the product once
and divide through by each denominator and it ended up being slower than
the present approach, but it sounds like you are trying some different
things. I think Ronan's comment about combining similar denoms is good.
I can't tell from your notation what you mean exactly in comment 7. Do you
mean
`(...((a1/d1 + a2/d2) + a3/d3) + a4/d4) ... ) + an/dn`
--
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.
