> You can't let things pile up indefinitely; this was a problem with > quotient fields that was fixed a while back. The intermediate values > get large, especially when powering, so that the final reduce is > ridiculously expensive. I'm not certain what the right behaviour is, > but I don't like the idea of trying to have tricky behaviour to reduce > only at the right moment. Always or never, I say.
Well look at my example. By calling reduce every time the computation becomes 15 times slower. And it also becomes slow in absolute terms. It takes (on my computer) almost a second to do this trivial example. Obviously something needs to be done. The user is free to break up his computations and call reduce himself if the intermediate results really get out of hand. For polynomials not over the rationals or GF(q) there is no reduce so the user has to deal with the problem anyway. Michel --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
