JGD_Kocay/Trec11
Brute force disjoint product matrices in tree algebra on n nodes, Nicolas Thiery
Name 
Trec11 
Group 
JGD_Kocay 
Matrix ID 
2145 
Num Rows

235 
Num Cols

1,138 
Nonzeros

35,705 
Pattern Entries

35,705 
Kind

Combinatorial Problem 
Symmetric

No 
Date

2008 
Author

N. Thiery 
Editor

J.G. Dumas 
Structural Rank 
235 
Structural Rank Full 
true 
Num Dmperm Blocks

1 
Strongly Connect Components

3 
Num Explicit Zeros

0 
Pattern Symmetry

0% 
Numeric Symmetry

0% 
Cholesky Candidate

no 
Positive Definite

no 
Type

integer 
SVD Statistics 
Matrix Norm 
4.610441e+02 
Minimum Singular Value 
9.382883e01 
Condition Number 
4.913672e+02

Rank 
235 
sprank(A)rank(A) 
0 
Null Space Dimension 
0 
Full Numerical Rank? 
yes 
Download Singular Values 
MATLAB

Download 
MATLAB
Rutherford Boeing
Matrix Market

Notes 
Brute force disjoint product matrices in tree algebra on n nodes, Nicolas Thiery
From JeanGuillaume Dumas' Sparse Integer Matrix Collection,
http://ljk.imag.fr/membres/JeanGuillaume.Dumas/simc.html
http://www.lapcs.univlyon1.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/Trec11.txt2
