Fabio S. wrote:
>
> I am thinking you are right: I tried the same computations on another
> machine: same distribution, same axiom version: it ran for more than 8
> hours without problems, but, unluckly, not giving the answer... :-(
>
You may try to do computation modulo a prime number. For me
groebner([x ::(Polynomial PF(1663)) for x in eqns])
finished in about 15 minutes. For some (unlucky) primes modular
Groebner basis is quite different than integer Groebner basis, but
for most primes they share many properties. In fact, one method
of computing integer Groebner bases (currently unimplemented in Axiom)
starts with modular Groebner basis and "lifts" it to an integer one.
Also, it looks that you are using 'Fraction Polynomial Integer'
as your domain. Did you try to use 'DistributedMultivariatePolynomial'
(which is likely to be much more efficient)?
--
Waldek Hebisch
[EMAIL PROTECTED]
_______________________________________________
Axiom-developer mailing list
[email protected]
http://lists.nongnu.org/mailman/listinfo/axiom-developer
