Hi, I'm working on some computations with multi-variable polynomials over QQ. I'm finding some very weird performance characteristics. For instance, I have two polynomials which I want to divide one by the other and have an element of the fraction field. This requires computing a gcd (which is certainly not 1). Sometimes, this gcd computation is very quick and completes with-in 1-2 seconds and sometimes it takes minutes. What's more it seems that the first time I compute this gcd is fast and subsequent times are slow.
The numerator is approximately 700 terms and the denominator is about 2000 terms and they live in a ring with 11 variables. Ultimately, I would like to perform this division with a much larger numerator and denominator, but the performance is such that it doesn't seem feasible and I came accross this issue while attempting to optimize. Two questions: 1) This size of polynomial doesn't seem that large to me. What sort of performance should I expect? I tried out mathematica a bit (via someone else) and it appears that mathematica completes similar computations with-in a second or two. 2) Has this unpredictable performance been observed by anyone else? -- Joel --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
