Harald,
Thanks for taking the time to reply and thank you for devoting your time to
the Sage board. I have installed it locally and it runs fine. What I
really love though is having a cloud based tool that I can work on from
anywhere. My normal tools are matlab, octave and scilab but I have
Finding occasional inconsistencies when using matrices with cyclotomic
entries, though works well most of the time...
sage: s=CyclotomicField(24,'s').gen()
sage: (8*s^6-1)^10
-1098715216*s^6 - 372960063
sage: xb=matrix(1,1,[8*s^6-1])
sage: xb^10
[1036922553*s^6 - 3729600
On Wednesday, April 25, 2012 5:11:46 PM UTC+2, gmark1953 wrote:
>
> For the past week to 10 days the server has been very very slow to
> resolve. Sage is almost unusable right now.
>
On the server, there are too many users active and it doesn't scale well
enough. I encourage you to install Sa
For the past week to 10 days the server has been very very slow to
resolve. Sage is almost unusable right now.
Having the problem both at work and home.Is the problem on my end?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Dear Volker Braun,
Thanks so much that is what I need
Thanks
Doaa
On 25 April 2012 14:05, Volker Braun wrote:
> Note that this is a question about convex polyhedra since it involves
> inequalities! You can't solve it with linear algebra alone. A simple way is
> to intersect your null space with t
Note that this is a question about convex polyhedra since it involves
inequalities! You can't solve it with linear algebra alone. A simple way is
to intersect your null space with the positive orthant, which gives you a
cone in your null space whose elements have all positive entries:
sage: ker
I guess what the OP means is that he wants a set of basis vectors with
non-negative entries. For instance in the above example, adding the third
row to the first will give such a matrix.
I don't know if there is any ready made method for doing that. An easy way
would be to get the rref (the exa
