Description: Brute force disjoint product matrices in tree algebra on n nodes, Nicolas Thiery
|(bipartite graph drawing)|
|number of rows||3|
|number of columns||7|
|structural full rank?||yes|
|# of blocks from dmperm||1|
|# strongly connected comp.||2|
|explicit zero entries||0|
|nonzero pattern symmetry||0%|
|numeric value symmetry||0%|
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. Filename in JGD collection: Kocay/Trec5.txt2
|nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD||10|
|nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD||6|
|null space dimension||0|
|full numerical rank?||yes|
|singular values (MAT file):||click here|
|SVD method used:||s = svd (full (R)) ; where [~,R,E] = spqr (A') with droptol of zero|
For a description of the statistics displayed above, click here.
Maintained by Tim Davis, last updated 12-Mar-2014.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.