Index of /research/sparse/mat/JGD_Kocay

 Name                    Last modified       Size  Description

 Parent Directory        02-Nov-2009 14:42      -  
 Trec3.mat               20-Oct-2009 14:14     1k  
 Trec4.mat               20-Oct-2009 14:14     1k  
 Trec5.mat               20-Oct-2009 14:14     1k  
 Trec6.mat               20-Oct-2009 14:14     1k  
 Trec7.mat               20-Oct-2009 14:15     2k  
 Trec8.mat               20-Oct-2009 14:15     2k  
 Trec9.mat               20-Oct-2009 14:15     4k  
 Trec10.mat              20-Oct-2009 14:15    14k  
 Trec11.mat              20-Oct-2009 14:16    57k  
 Trec12.mat              20-Oct-2009 14:20   263k  
 Trec13.mat              20-Oct-2009 14:32   1.2M  
 Trec14.mat              25-Sep-2008 16:41   5.8M  

Brute force disjoint product matrices in tree algebra on n nodes, Nicolas Thiery
From Jean-Guillaume Dumas' Sparse Integer Matrix Collection,
http://ljk.imag.fr/membres/Jean-Guillaume.Dumas/simc.html

http://www.lapcs.univ-lyon1.fr/~nthiery/LinearAlgebra

Linear algebra for combinatorics

Abstract: Computations in algebraic combinatorics often boils down to
sparse linear algebra over some exact field. Such computations are
usually done in high level computer algebra systems like MuPAD or
Maple, which are reasonnably efficient when the ground field requires
symbolic computations.  However, when the ground field is, say Q or
Z/pZ, the use of external specialized libraries becomes necessary. This
document, geared toward developpers of such libraries, present a brief
overview of my needs, which seems to be fairly typical in the
community.