#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 frederichan):
I think that the time of conversion from F4 and giac to sage is quite
similar. I also noticed that F4 is faster but the server I am working on
has 16Go of ram and I had to interrupt the computation with F4 of cyclic9
mod prev_prime(2^31).
on sage with giac and giacpy the syntax is like this:
{{{
sage: P = PolynomialRing(GF(previous_prime(2^31)), 9, 'x')
sage: I = sage.rings.ideal.Cyclic(P)
sage: from giacpy import *
sage: p=previous_prime(2^31)
sage: time gb8B = (libgiac(I.gens()) % p).gbasis([P.gens()])
Time: CPU 1687.80 s, Wall: 1687.55 s
sage: # the saved file is 84M
sage: time gb8B.savegen('/home/han/cyclic9modp')
Time: CPU 8.90 s, Wall: 8.92 s
sage: #converting from giac to sage
sage: time BG=Sequence(gb8B,P)
Time: CPU 30.97 s, Wall: 30.97 s
sage: time gb8Bbis=loadgiacgen('/home/han/cyclic9modp')
Time: CPU 7.89 s, Wall: 7.89 s
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/18749#comment:19>
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.
