Hi Bill, Thanks for your messages--it certainly is an interesting problem when viewed in context.
For me, my polynomials are tiny: small degree (<=11) and very small coefficients. Moreover, I already have computed the roots to some numerical precision and only call this when there appears to be a coincidence of roots, and so I have good reason to believe that the polynomials have a common factor. It seems like the best way to verify this (without actually computing the gcd over Z!) would be to use a modular method--but I realize that in practice, resultant methods are often used and have certain advantages. I'm not sure I've added much to your discussion, but anyway, thanks for looking into this. Yours, John Voight Assistant Professor of Mathematics University of Vermont [EMAIL PROTECTED] [EMAIL PROTECTED] http://www.cems.uvm.edu/~voight/ --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
