Dear Sage team,
i just upgraded sage on two machines. One has gcc 4.1.2 on it, the
other has gcc 4.2.1.
On the machine with 4.1.2, starting sage still looks like this:
sage
--
| SAGE Version 2.8.10, Release Date: 2007-10-28
On Nov 26, 2007 1:42 AM, Simon King [EMAIL PROTECTED] wrote:
Dear Sage team,
i just upgraded sage on two machines. One has gcc 4.1.2 on it, the
other has gcc 4.2.1.
On the machine with 4.1.2, starting sage still looks like this:
sage
Hello,
I am trying to solve a system of matrix equations of the form:
transpose(B)*(Mi)*B==Ni
where i is in range(p) for some fixed p 9, Mi and Ni have integer
entries, and all matrices are of size p by p. I want to solve for B
(it need not have integer entries).
I have tried a brute force
Hi,
http://sagemath.org/SAGEbin/vmware/
has been modified so that all files are 2GB. So you might
want to try it out and see if it works on your system, and report
back either way.
actually I followed Jason's suggestion, namely I installed NTFS-3G on
my linux box and then converted
On Nov 26, 2007 12:55 PM, Francis Clarke [EMAIL PROTECTED] wrote:
Subgroups of abelian groups:
sage: G.a, b = AbelianGroup(2)
sage: A = G.subgroup([a])
sage: B = G.subgroup([b])
sage: A == B
True
Surely not!
I agree that this is dumb, and have made it trac ticket #1284.
William wrote:
I think one student working for two weeks could greatly enhance solve,
but making it:
(1) try the maxima solve, and
(2) if the maxima solve returns no solutions, do something further that
involves numerics, e.g., calling to scipy's iterative solver.
In
Hello,
I've posted a patch for # -- http://sagetrac.org/sage_trac/ticket/
--Mike
On Nov 26, 2007 3:34 PM, Ted Kosan [EMAIL PROTECTED] wrote:
William wrote:
I think one student working for two weeks could greatly enhance solve,
but making it:
(1) try the maxima solve, and
