Comment #95 on issue 1598 by mattpap: New polynomials manipulation module http://code.google.com/p/sympy/issues/detail?id=1598
Great progress! Keep up the good work.
Thanks! Hopefully there will more developments in near future.
For complex root isolation, (...)
This is an interesting method, I will give it a shot. In general the plan was to implement rational only methods for both real and complex root isolation, continued fraction approach in the real case and Collins-Krandick algorithm for complex roots. The first was pretty straightforward and works well in SymPy. However, Collins` algorithm seemed to me a little to complicated to spend time on it right now, so I implemented Wilf's global bisection algorithm, which uses Sturm sequences to count roots. This was easy to implement but the method behaves poorly in practice and is
slow (because of Sturm sequences).
This should be possible to generalize to multiple roots.
This is unnecessary in practice because I will need to use at least square-free
factorization on the input polynomials anyway. -- 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.
