On Fri, Apr 20, 2012 at 1:18 PM, Tom Bachmann <e_mc...@web.de> wrote: > >>> It avoids some (hopefully many...) of the monomials by taking only those >>> not >>> divisible by leading monomials of the groebner basis. (These monomials >>> form >>> a basis of the quotient space, which is the most basic property of >>> groebner >>> bases.) >> >> >>> From what I can see, the final result may be smaller, but it still has >> >> to run the loop for each monomial, so it doesn't seem to me to be any >> more time efficient (just space efficient). >> > > Sure. But I think (possibly contrary to what I said earlier), staircase > really isn't the problem. If the result is huge then the next parts (calling > reduced(), solving the linear system) are going to take ages as well.
Maybe we should run kernprof on it to see what function calls are really taking up the most time. Aaron Meurer > > > -- > You received this message because you are subscribed to the Google Groups > "sympy" group. > To post to this group, send email to sympy@googlegroups.com. > To unsubscribe from this group, send email to > sympy+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/sympy?hl=en. > -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to sympy@googlegroups.com. To unsubscribe from this group, send email to sympy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
