Comment #9 on issue 2895 by [email protected]: minpoly hangs on this
expresion
http://code.google.com/p/sympy/issues/detail?id=2895
Does unrad give wrong answers, though? It can make a good first pass
heuristic, I think (unless it is just as slow as minpoly, which it
shouldn't be). It also will need to test for irreducibility, and if the
resulting polynomial isn't, use the root isolation algorithm to grab the
correct factor (factor() factors into irreducibles, so this is just a
matter of using intervals() along with careful precision tracking to
evalf()).
Then again, if unrad is only powerful enough to deal with simple
expressions, then maybe it won't really deal with those radicals that
minpoly is slow for anyway. Have you played with it?
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings
--
You received this message because you are subscribed to the Google Groups
"sympy-issues" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sympy-issues?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
