On Mon, May 20, 2013 at 2:19 PM, Theo Belaire
wrote:
> I have a large computation where I need to compute the number of positive
> eigenvalues of a matrix.
> I am currently computing all the eigenvalues then counting how many are
> positive, but I see when profiling that "{method 'roots' of
> '
I have a large computation where I need to compute the number of positive
eigenvalues of a matrix.
I am currently computing all the eigenvalues then counting how many are
positive, but I see when profiling that "{method 'roots' of
'sage.rings.polynomial.polynomial_element.Polynomial' objects}" i
On 5/19/13 7:39 PM, leif wrote:
Aaron E-J wrote:
I am interested in contributing to the sage cell server and am going
through the steps outlined in
the readme in the https://github.com/sagemath/sagecell#id1";>github
page. When I get to step #5, I
get the following error message that is detailed
Thanks to Jeroen for making this -- the spkg now exists and is
currently being spread around Sage's mirror sites. When that is done,
this will work:
sage: install_package("database_pari")
(assuming that you have write permission in the Sage directory where
files will be installed).
John
On 16
Dear all,
How to do the following in sage.
Given a sparse integer matrix A. Find a vector v such that A.v=0 (mod m).
In other words, what is equivalent of ModularSolution(A, m) of Magma in
sage?
--
You received this message because you are subscribed to the Google Groups
"sage-support" gr
Have you looked into numpy module? It is not specific to Sage, but it
should work. Also, the indexing is a little bit friendlier.
sage: import numpy
sage: C = numpy.array(1, 2], [3, 4]], [[3, 4], [5, 6]]], [[[7, 8], [9,
10]], [[-1, -2], [-3, -4)
sage: C
array( 1, 2],
[ 3, 4]
