It would also be interesting to know how much RAM your system has and
if the computation you run over night ever hit swap since it is
basically game over once you hit swap in a GB computation :)
I have a brand new system with 4 GB RAM so I guess should be enough.
On the other hand, I
It would also be interesting to know how much RAM your system has and
if the computation you run over night ever hit swap since it is
basically game over once you hit swap in a GB computation :)
I have a brand new system with 4 GB RAM so I guess should be enough.
On the other hand, I
Well, to be honest 4 GB isn't much these days and GBasis computations
tend to be rather large, especially if you use Lex. I often ran out of
memory on a 24 GB system three years ago doing rather large-ish GB
computations and none of those ideals were the size you posted. That
was over
PolyBoRi is automatically used by Sage for GB computations?
If you construct a BooleanPolynomialRing. See
http://www.sagemath.org/hg/sage-main/file/b0aa7ef45b3c/sage/rings/polynomial/pbori.pyx
On the other hand I calculated my new ideal and I wonder why it takes
so long for SAGE to evaluate
I believe there are memory (and time?) limitations for each user on
sagenb, so a tough GB calculation would likely get stopped.
Seems strange that just defining the ideal would take that long.
-M. Hampton
On Feb 6, 1:35 pm, Martin Albrecht m...@informatik.uni-bremen.de
wrote:
PolyBoRi is
[CCing Michael B. and Alexander D. since they seem to be unaware of
this discussion involving PolyBoRi]
On Feb 6, 3:35 am, Martin Albrecht m...@informatik.uni-bremen.de
wrote:
Hi,
PolyBoRi is automatically used by Sage for GB computations?
If you construct a BooleanPolynomialRing. See
Thank you to everyone!
You really help me with your answers!
I assume you're talking about the call
B.ideal([x1*x2 + ..., x2 + ..., ...]) ?
Yes, about this call I'm talking about! I can see the sandals when
scrolling over there..I guess the feedback from SAge is that has
finished
On Feb 6, 4:06 am, Adela adisev...@gmail.com wrote:
Thank you to everyone!
You really help me with your answers!
I assume you're talking about the call
B.ideal([x1*x2 + ..., x2 + ..., ...]) ?
Yes, about this call I'm talking about! I can see the sandals when
scrolling over there..I
Hi!
If I didn't made an error converting this input, PolyBoRi returns an
answer immediately.
Indeed [1].
And of course it is the GB for all orderings.
Regarding seeing, what is going use prot=True.
Michael
--~--~-~--~~~---~--~~
To post to this group, send email
On Feb 6, 1:36 am, Adela adisev...@gmail.com wrote:
It would also be interesting to know how much RAM your system has and
if the computation you run over night ever hit swap since it is
basically game over once you hit swap in a GB computation :)
I have a brand new system with 4 GB RAM
I sent a new message with the attachment required.
Thank you!
On 6 Feb, 14:35, mabshoff michael.absh...@mathematik.uni-dortmund.de
wrote:
On Feb 6, 4:06 am, Adela adisev...@gmail.com wrote:
Thank you to everyone!
You really help me with your answers!
I assume you're talking about the
Dear Adela,
On Feb 4, 11:46 pm, Adela adisev...@gmail.com wrote:
I need to solve a big system of nonlinear equations(it consists of 114
equations, with 61 indeterminates, all of them can be only 0 and 1 and
I work modulo 2).
I solve it using Groebner bases. So, my problem coms to finding
On Feb 5, 10:20 am, Simon King k...@mathematik.uni-jena.de wrote:
In some application, I had to compute a Gröbner basis for a system of
about 3 non-homogenous polynomials of degree 3 with 42 variables
and with rational coefficients. But Singular (which does the Gröbner
basis computation
On Feb 5, 1:26 am, Simon King k...@mathematik.uni-jena.de wrote:
On Feb 5, 10:20 am, Simon King k...@mathematik.uni-jena.de wrote:
In some application, I had to compute a Gröbner basis for a system of
about 3 non-homogenous polynomials of degree 3 with 42 variables
and with rational
On Thursday 05 February 2009, Adela wrote:
Thanks to everyone for your support!
I already tried to do the big computation leaving the computer all
night long to work but I still don't know if it finished.. I still
don't understand Sage very well because I don't see any feedback from
it.. I
On Feb 5, 6:07 am, Martin Albrecht m...@informatik.uni-bremen.de
wrote:
On Thursday 05 February 2009, Adela wrote:
SNIP
As you said, the computations should not take so long because I work
in the ring Z / 2 so I have as solutions only 1 and 0 (they represent
bits).
Well since you
On Wednesday 04 February 2009, Adela wrote:
I need to solve a big system of nonlinear equations(it consists of 114
equations, with 61 indeterminates, all of them can be only 0 and 1 and
I work modulo 2).
I solve it using Groebner bases. So, my problem coms to finding the
reduced Groebner
17 matches
Mail list logo
