On Aug 19, 5:39 pm, robin hankin <hankin.ro...@gmail.com> wrote: > Hello Simon > > thanks for this. One problem > with the solution you mention is that I can't do the > general case. What I need is the sage equivalent > of mathematica's Reduce[] function. >
I think that solve() is the closest that comes to this (though admittedly I am no Mma expert). It turns out that even in Maxima straight up, this doesn't work (either with solve() or to_poly_solve()). I think maybe it doesn't know how to handle the conjugate() piece. There are however a lot of solvers in Maxima, so it's possible that one of them will do it (perhaps with a certain flag set. You're also right that doing the general case doesn't quite work - even if one puts that p^2+q^2==r^2+s^2, so to speak. I've wanted to put more work into exposing Maxima functionality like this but have not been able make the time, because if we're going to hook in deeper we need to do it right. But solving non-linear systems like this is probably one of the places we'd like to improve the most. - kcrisman -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
