The current implementation of solving a system of polynomials is based on the reduced Groebner basis of the input polynomials. However, it is limited by the root finding algorithm implemented in SymPy. If no result is returned, we cannot assure that no solution exists. [1]
In order to incorporate it in the `solveset` module, we need to ensure that all solutions of the system are returned. I have thought of 2 ways of tackling this problem: - Implement a better root finding algorithm. However, this will always be limited to some order. - Implement a new solver using different techniques. I find the method used in this paper[2] quite interesting for our case. So, I would like to discuss the issues related to this approach and possible complexities in implementing it. [1]: https://github.com/sympy/sympy/blob/master/sympy/solvers/polysys.py#L122-L125 [2]: ftp://ftp.esat.kuleuven.be/sista/pdreesen/pdreesen_sysid2012.pdf ------------------- Kshitij Saraogi -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/a36d52ea-9f2f-40bb-ba5e-874a2b602af8%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
