Format 


A sparse matrix format is used which consists of a series of
triples (the format is called SMS, Sparse/Symbolic Matrix Storage).
The first triple is number of rows, number of columns, and a letter ("M" for integer/modular, "R" for rational, etc.). The following triples signify nonzero entries and have the form
rowindex, colindex, value. They must be in increasing lexicographical order.
The last triple is ``0 0
0'' used as an end marker.
For example :
32 3200 M
1 1 345
1 2 23
2 1 77
2 200 31
30 3101 11
0 0 0
denotes a 32 by 3200 matrix with 5 nonzero entries, three of which are
clustered at the top left.

Matrices 


 GL7d: differentials of the Voronoï complex of the perfect forms of rank 7 modulo GL_7(Z) equivalences (related to the cohomology of GL_7(Z) and the Ktheory of Z)
from
Philippe ElbazVincent.
 GL6.
 SL6.
 BasisLIB: rational sparse linear systems arising in linear programming applications from Dan Steffy.
 Mgn: homology of the moduli space of
smooth algebraic curves M_{g,n} using the Penner fatgraph complex.
Since there is no canonical labeling of the graphs, the matrices are
welldefined up to a permutation of rows and columns. The matrix
labelled "Mg,nDk" relates graphs having k+1 edges with graphs
having k edges; some matrices have been omitted since they are
null. From Riccardo Murri.
 Prymcan: On the Koszul cohomology of canonical and Prymcanonical binary curves by Elisabetta Colombo and Paola Frediani.
 Smooshed: Boundary matrices from smooshed CW complexes. The complexes themselves are alexander duals of independence complexes of hypergraphs. From Oliver Thistlethwaite.

Software 


 LinBox: algorithms and
software for symbolic linear algebra.
 FFLASFFPACK: Finite field linear algebra subroutines/package.
 GBLA library for matrices generated during Gröbner basis computations in algorithms like F4 or F5.

Collections 


