#18749: Groebner basis computations with the F4 algorithm
-------------------------------------+-------------------------------------
Reporter: tcoladon | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: packages: | Resolution:
optional | Merged in:
Keywords: F4, groebner | Reviewers:
basis, ideal | Work issues:
Authors: Titouan Coladon | Commit:
Report Upstream: N/A | cf1952a78d21e5778ca358dff120166d184a86c4
Branch: u/malb/t18749_f4 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by parisse):
I made a few benchmarks, compared to giac, *natively* (conversions to sage
take a significative amount of time at least for f4), with 1 thread, using
a prime of size 24 bits (giac can go up to 31 bits, add about 20% time).
For cyclic8, giac is a little faster (11s. vs 12)
For katsura12, f4 is faster (45s vs 69s)
For cyclic9: giac does it in about 15 minutes with 700M of RAM, I stopped
the computation of f4 after about the same time because the memory used
was reaching 23G (too much for my laptop). This is not specific to
cyclic9, it also happens for katsura12.
--
Ticket URL: <http://trac.sagemath.org/ticket/18749#comment:18>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" 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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
