I have two problem:
1) When factorizing a system of many polynomials
( > 200 ), and if each member has many factors, Singular is out of memory and
trying to start.
2) When compute a Groebner base of an ideal I which has
many polynomials, for instance over 300 , Singular's also out
How can I extend the working memory or do some thing useful this case?
Thank you very much.
Man.
email:
[email protected]Posted in old Singular Forum on: 2002-10-29 20:08:11+01
I have two problem:
1) When factorizing a system of many polynomials
( > 200 ), and if each member has many factors, Singular is out of memory and
trying to start.
2) When compute a Groebner base of an ideal I which has
many polynomials, for instance over 300 , Singular's also out
How can I extend the working memory or do some thing useful this case?
Thank you very much.
Man.
email:
[email protected]Posted in old Singular Forum on: 2002-10-29 20:08:11+01