I have been recently working with univariate polynomials over number fields and find the gcd very slow. At least for absolute number fields Sage should behave better.
for QQ[x], gcd is also slow right now, but this is being addressed in #4000 The issue is that for univariates polynomials over absolute number fields, the implementation is just the generic one using Euclidean algorithm. I tried passing to pari but I am afraid that the pari coertion for these polynomials is incorrect. Is this a bug or a feature? I have implemented a correct pari coertion for this particular case that allows to compute more cases of gcd. This could also be used for gereal number fields by passing to an absolute number field. I have also tried with Singular. For small extensions (degree <6) and high degree polynomials singular seems to beat pari, for larger extensions and smaller polynomial degrees pari seems better. I am not sure if it is worthy to implement this, maybe with an option for the user to choose the algorithm. Any thoughts/feelings about this? -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
