> While on that i have compiled affine on 5.17.1 by using the indication by
> R. Toy somewhere on Google, that is, replace last line by:
> (mk:oos "affine" :compile)
> and it works no problem. The Grobner basis computation in affine is *much
> much* faster than the one in the Grobner package. Little problem, such
> basis are not unique, and it is difficult to check results between two
> implementations, i have tried comparing with Maple. Unfortunately affine is
> very little documented, in particular in the way order of variables is
> defined, and their weight. But the result entirely depends on that.
> Anyways, speedwise, Maple and affine are in the same league, while the
> Grobner package leads to extremely slow computations, for example for
>
> /* A tough example learned from Cox */
> poly_grobner([x^5+y^4+z^3-1,x^3+y^3+z^2-1], [x,y,z]);
>
> takes 1mn30s
You should compile the grobner package if you wish to compare it to
the compiled affine package.
compile_file(file_search("grobner.lisp"), path_to_compiled_grobner);
will compile the grobner package and save the result to
path_to_compiled_grobner which you can then load.
With the default ordering poly_grobner is still slow, but if you
change the ordering to grlex poly_grobner is faster than affine.
Andrej