Matrix: HB/gent113

Description: UNSYMMETRIC PATTERN SUPPLIED BY MORVEN GENTLEMAN, SUMMER 1973

HB/gent113 graph HB/gent113 graph
(bipartite graph drawing) (graph drawing of A+A')


HB/gent113 dmperm of HB/gent113
scc of HB/gent113

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: HB
  • Click here for a description of the HB 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: 1 KB. Use UFget(158) or UFget('HB/gent113') in MATLAB.
  • download in Matrix Market format, file size: 2 KB.
  • download in Rutherford/Boeing format, file size: 1 KB.

    Matrix properties
    number of rows113
    number of columns113
    nonzeros655
    structural full rank?yes
    structural rank113
    # of blocks from dmperm18
    # strongly connected comp.18
    explicit zero entries0
    nonzero pattern symmetry 6%
    numeric value symmetry 6%
    typebinary
    structureunsymmetric
    Cholesky candidate?no
    positive definite?no

    authorW. Gentleman
    editorA. Curtis, I. Duff, J. Reid
    date1973
    kindstatistical/mathematical problem
    2D/3D problem?no

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD1,003
    Cholesky flop count1.2e+04
    nnz(L+U), no partial pivoting, with AMD1,893
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD519
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD1,433

    SVD-based statistics:
    norm(A)11.3192
    min(svd(A))1.9093e-17
    cond(A)5.92844e+17
    rank(A)107
    sprank(A)-rank(A)6
    null space dimension6
    full numerical rank?no
    singular value gap7.16325e+13

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

    HB/gent113 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.