Brute force disjoint product matrices in tree algebra on n nodes, Nicolas Thiery
Name Trec7
Group JGD_Kocay
Matrix ID 2141
Num Rows 11
Num Cols 36
Nonzeros 147
Pattern Entries 147
Kind Combinatorial Problem
Symmetric No
Date 2008
Author N. Thiery
Editor J.-G. Dumas
Structural Rank 11
Structural Rank Full true
Num Dmperm Blocks 1
Strongly Connect Components 2
Num Explicit Zeros 0
Pattern Symmetry 0%
Numeric Symmetry 0%
Cholesky Candidate no
Positive Definite no
Type integer
SVD Statistics
Matrix Norm 2.103610e+01
Minimum Singular Value 1.646015e+00
Condition Number 1.278002e+01
Rank 11
sprank(A)-rank(A) 0
Null Space Dimension 0
Full Numerical Rank? yes
Download Singular Values MATLAB
Download MATLAB Rutherford Boeing Matrix Market
Brute force disjoint product matrices in tree algebra on n nodes, Nicolas Thiery
From Jean-Guillaume Dumas' Sparse Integer Matrix Collection,                    
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                   
Filename in JGD collection: Kocay/Trec7.txt2