On 05/15/2017 07:30 PM, Bill Page wrote: > I think the factor of 1000 in the difference in the time required to > compute the Groebner basis suggests that Singular is probably using a > different algorithm to produce this result - maybe something like > choosing a more favorable term order and then walking the solution, > but my first attempts to do this have not been able to improve on the > timing.
>From the number of polynomials you get as a GB (28 vs. 34), I guess, Sage and FriCAS use different target term orders. If that is the case, then I don't think that 10 sec vs several hours is a big surprise. Nevertheless, FriCAS does not employ a very sophisticated GB-algorithm. It's the plain Buchberger algorithm + criteria and sugar strategy. We have no F4, GroebnerWalk or SlimGB or ... Ralf -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
