Everyone, I'm wondering if there's an easy way to count the number of operations performed when row-reducing a matrix, and also when reducing polynomials using elements of a Groebner basis. Here are the details.
I am comparing the run times of a couple algorithms for computing zero-dimensional Groebner bases. One row-reduces a matrix using the matrix echelon_form() method, and the other reduces polynomials with respect to Groebner bases using the reduce() method. I expected the matrix row-reduction algorithm to be faster, and when the underlying field is Q this is what I see. But over finite fields it's turning out that the Groebner basis reductions are faster, and I'd like to figure out why. Obviously I could write and instrument my own versions of echelon_form() and reduce(), but before I do that I'd like to know whether there's an easier way. Thanks in advance for the help, Jeff Stroomer -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
