[sage-support] Re: Open Suse compilation problems

2014-10-13 Thread sahin508
Hey, I had compilation problems with opensuse 13.1. As far as I remember, sage does not play well with cpu power tools, you may want to give it another try by enabling cpu to performance mode. I am unsure this can fix though because it didn't with opensuse 13.1. Can I suggest using the fedora

Re: [sage-support] Re: groebner bases of polynomials with complex coefficients

2014-02-18 Thread sahin508
I changed the decimals into fractions and I confirm that I am now getting results. Thank you so much for your help. You saved me out of stress and depression. Best Regards, On Tuesday, February 18, 2014 11:23:37 AM UTC-5, Martin R. Albrecht wrote: > > > > On 18/02/14 14:31, sahi...@gmail.com w

[sage-support] Re: groebner bases of polynomials with complex coefficients

2014-02-18 Thread sahin508
Thank you for the reply. I am now trying the computation with a somewhat more involved example and I am getting the error. The example I am trying to solve is below: R = QQ[sqrt(-1)] RI = R.gens()[0] S. = PolynomialRing(R,order='lex') SI = S.ideal(4*RI*x4+2*x1-2.52*x3-8*RI,3*x4+2*x1-3.5*x2-6,-4

[sage-support] Re: groebner bases of polynomials with complex coefficients

2014-02-17 Thread sahin508
Thank you, I get the solution by using N. = NumberField(x^2+1) S. = PolynomialRing(QQ,order='lex') is the variable x in the first line a dummy one, i.e. has nothing to do with the x in the second line? Sorry, I am new to Sage and sometimes I get confused. If CC is not appropriate for this kind

[sage-support] Re: groebner bases of polynomials with complex coefficients

2014-02-17 Thread sahin508
OK, I tried the following: S. = PolynomialRing(QQ,order='lex') I = ideal(i^2+1,(1+i)*x+y,x+(1-i)*y-(1-i)) G = I.groebner_basis() G would give me [i - x - 1, x^2 + 2*x + 2, y - 2] which are the results. But I am confused; why I can't get the result when I try to get a polynomial ring in the fie

[sage-support] groebner bases of polynomials with complex coefficients

2014-02-17 Thread sahin508
Hi: I am trying to obtain solution of a system of polynomial equations with complex coefficients without success. For example, when I try S. = PolynomialRing(CC,order='lex') I = ideal((1+i)*x+y,x+(1-i)*y-(1-i)) G = I.groebner_basis() I see this error: AttributeError: 'Ideal_generic' object ha

[sage-support] Re: problem installing sagemath

2013-12-26 Thread sahin508
> Binary is a completely functional program without any installer is >>> also often called a program binary, or binaries (as opposed to the >>> source code). >>> >> If the binaries are functional independent of different linux distributions, why would sagemath release binaries for fedora 16,

[sage-support] Re: problem installing sagemath

2013-12-26 Thread sahin508
> > I guess there should be no problem related to security. >> > > It is great to know that sage binary for fedora 16 available in the sagemath website is safe to use in opensuse 13.1. But would using the fedora 16 binaries be a problem as opensuse 13.1 (may) have technical differences from fe

[sage-support] problem installing sagemath

2013-12-25 Thread sahin508
Hello: I am trying to compile sagemath from sources without any success. I am currently using Opensuse 13.1 with kernel 3.11.6. I have hp pavilion dm1 with amd e-350 dual core cpu. The compile process ends before the atlas libraries. I tried both sage 5.13 and 6.0 without any success. I tried