On Jun 2, 2013, at 9:20 AM, Dima Pasechnik wrote:
On 2013-06-01, Volker Braun vbraun.n...@gmail.com wrote:
[...]
On a related note, sparse matrices in Sage suck (dictionary of keys).
Sparse matrices in LELA only suck slightly less (list of lists). For fast
computation one should
On Sunday, June 2, 2013 10:01:01 AM UTC+2, Charles Bouillaguet wrote:
http://docs.scipy.org/doc/scipy/reference/sparse.linalg.html
yes, i just wanted to point to that. this is the list of implementations,
i.e. CSC/CSR (compressed sparse columns or rows) is already there.
On Sunday, June 2, 2013 9:01:01 AM UTC+1, Charles Bouillaguet wrote:
There is a presumably standard sparse-blas API :
http://math.nist.gov/spblas/
Yes, though it doesn't seem to mandate any matrix storage format. So
apparently you can't let it run on a given chunk of memory but you need
Le 02/06/2013 19:28, Volker Braun a écrit :
On Sunday, June 2, 2013 9:01:01 AM UTC+1, Charles Bouillaguet wrote:
There is a presumably standard sparse-blas API :
http://math.nist.gov/spblas/
Yes, though it doesn't seem to mandate any matrix storage format. So
apparently you can't let
On Sunday, June 2, 2013 7:58:05 PM UTC+1, tdumont wrote:
- In that case, I recall that the main problem will be actually to
*create* the CSR structure: you want to enter non zero coefficients
(i,j)- a_ij in any order. The mechanism used by by scipy (and thus
sage) is very very slow
I would like to have some discussion about the roadmap for matrices in
Sage. It seems that linbox has essentially been forked by LELA
(http://www.singular.uni-kl.de/lela). Since it optionally contains M4RI,
one would think that it is a good fit for Sage, too. Has anybody given any
thoughts to
Hi,
as far as I know LELA does not support the same operations as LinBox, it's not
a straight-forward fork but a re-implementation of a subset (that's my
understanding, anyway). it has some advantages, i.e., that some bits nicely
generic, i.e., it should be fairly easy to add new matrix types
My understanding is that only a very small subset of linbox is wired into Sage.
In particular, all the iterative methods for the [rank/minpoly/charpoly/det] of
sparse matrices are not accessible yet, but they are Linbox's strong point.
Currently, sparse matrices are converted to dense ones, and
