> I think, this would give a good basis. > Actually the Singular group is also interested in a gcd, which also > works for finite, algebraic extensions > of Q and GF(p). > And I would be happy, if they stopped discussing about it behind > closed doors and > actually wasting time, as the efforts coming out of this model go just > nowhere > (which is just obvious, despite that many other *open* source systems > are not better). >
I'm also interested in improving gcd for poly with coefficients in algebraic extension of Q. This would in fact be appreciated by xcas users (much more than trying to be a little bit faster for gcd over Z...). Lagrange interpolation could be used exactly like in the modular case to reduce to a one variable problem (with larger coefficients). This is also true for approx multivariate gcd. Avoiding division is most probably also interesting for some cases. I would be glad to discuss with the people involved on this in Singular. > So, you are using Cocoa or cocoalib? cocoalib > Being an expert for the groebner > bases functionality, I can say, > that Singular's biggest strength in this area, is supporting many, > many implementations > of different algorithms and many monomial orderings > (you need flexibility in this area). > > So, if you are interested, we can discuss this (probably this threat > is not very suited). yes, maybe a thread in gb computation with singular would be more. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
