On Sep 3, 10:43 am, John Voight <[EMAIL PROTECTED]> wrote: > (2) Real root finding predominates the computation. I was hoping that > numpy would do this the fastest--but now it seems to be giving erratic > results (see http://trac.sagemath.org/sage_trac/ticket/583). It may > turn out that most optimized thing would be for me to write a Newton- > Raphson iteration in cython, but this could quickly turn into a large > recreate-the-wheel kind of project.
As Robert Bradshaw mentioned, I did spend a lot of time working on real root isolation; unfortunately, I have not yet found the time to polish it off and contribute it to SAGE (although I'm still planning to!). What do you need for real root finding for your problem? In particular, are your polynomials known exactly (integral or rational coefficients)? What degree are your polynomials? How big are the coefficients? Are your polynomials known to be squarefree (no multiple roots)? What accuracy do you need on the resulting roots? Carl Witty --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
