On Thu, Apr 16, 2009 at 3:43 PM, Maurizio <maurizio.gran...@gmail.com> wrote: > Finally, even assuming that I can get the right answer from this, > which is the recommended way to get the roots of an equation given by > a "univariate polynomials == 0"? This is supposed to be the next step > of the algorithm.
Taking a quick look at that page, it looks like they want the exact roots in CC of a polynomial with algebraic coefficients. In Sage, we can get this with QQbar: sage: K.<x> = QQbar[] sage: (x^5-x-1).roots(ring=QQbar) [(1.167303978261419?, 1), (-0.7648844336005847? - 0.3524715460317263?*I, 1), (-0.7648844336005847? + 0.3524715460317263?*I, 1), (0.1812324444698754? - 1.083954101317711?*I, 1), (0.1812324444698754? + 1.083954101317711?*I, 1)] (AFAIK, maxima can't do this; I don't think maxima can handle general algebraic numbers. Since Sage's solve() is implemented using maxima, solve() won't work for this problem.) Carl --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
