On Nov 24, 12:21 am, vpv [EMAIL PROTECTED] wrote:
Hi,
Hi,
Is there a way to compute Groebner bases and varieties in parallel on
multiple processors or in a cluster?
What exactly do you want to do
(a) compute the Gbasis of some ideal with different strategies and/or
programs at the same
Thanks for your reply, Michael! Please see more details about my
problem below:
Let 'e' designate a system of boolean equations. Then I have the
following code:
I=ideal(e)
G=I.groebner_basis()
I2=ideal(G)
V = I2.variety()
'e' is composed of approx. 1000 quadratic equations in approx. 500
On Nov 24, 2:04 am, vpv [EMAIL PROTECTED] wrote:
Hi,
Thanks for your reply, Michael! Please see more details about my
problem below:
Let 'e' designate a system of boolean equations. Then I have the
following code:
I=ideal(e)
G=I.groebner_basis()
I2=ideal(G)
V = I2.variety()
'e' is
Unfortunately not. I have seen Buchberger's algorithm implemented with
parallel reduction on a shared memory system with allegedly decent
performance with up to 8 CPUs in a shared memory system (i.e. all in
one big box, not a cluster), but the implementation was in Java and is
not integrated
On Nov 24, 12:58 pm, Martin Albrecht [EMAIL PROTECTED]
wrote:
Hi,
Unfortunately not. I have seen Buchberger's algorithm implemented with
parallel reduction on a shared memory system with allegedly decent
performance with up to 8 CPUs in a shared memory system (i.e. all in
one big box,
