Matrix: JGD_Kocay/Trec11

Description: Brute force disjoint product matrices in tree algebra on n nodes, Nicolas Thiery

JGD_Kocay/Trec11 graph
(bipartite graph drawing)


JGD_Kocay/Trec11
scc of JGD_Kocay/Trec11

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: JGD_Kocay
  • Click here for a description of the JGD_Kocay group.
  • Click here for a list of all matrices
  • Click here for a list of all matrix groups
  • download as a MATLAB mat-file, file size: 57 KB. Use UFget(2145) or UFget('JGD_Kocay/Trec11') in MATLAB.
  • download in Matrix Market format, file size: 92 KB.
  • download in Rutherford/Boeing format, file size: 51 KB.

    Matrix properties
    number of rows235
    number of columns1,138
    nonzeros35,705
    structural full rank?yes
    structural rank235
    # of blocks from dmperm1
    # strongly connected comp.3
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    typeinteger
    structurerectangular
    Cholesky candidate?no
    positive definite?no

    authorN. Thiery
    editorJ.-G. Dumas
    date2008
    kindcombinatorial problem
    2D/3D problem?no

    Notes:

    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/Trec11.txt2                                   
    

    Ordering statistics:result
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD181,391
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD25,720

    SVD-based statistics:
    norm(A)461.044
    min(svd(A))0.938288
    cond(A)491.367
    rank(A)235
    sprank(A)-rank(A)0
    null space dimension0
    full numerical rank?yes

    singular values (MAT file):click here
    SVD method used:s = svd (full (A)) ;
    status:ok

    JGD_Kocay/Trec11 svd

    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.