Matrix: Andrianov/net100

Description: net100 matrix from Alexander Andrianov, SAS Institute Inc.

Andrianov/net100 graph
(undirected graph drawing)


Andrianov/net100 dmperm of Andrianov/net100

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

    Matrix properties
    number of rows29,920
    number of columns29,920
    nonzeros2,033,200
    structural full rank?yes
    structural rank29,920
    # of blocks from dmperm2
    # strongly connected comp.2
    explicit zero entries0
    nonzero pattern symmetrysymmetric
    numeric value symmetrysymmetric
    typebinary
    structuresymmetric
    Cholesky candidate?yes
    positive definite?no

    authorA. Andrianov
    editorT. Davis
    date2006
    kindoptimization problem
    2D/3D problem?no

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD30,169,645
    Cholesky flop count1.1e+11
    nnz(L+U), no partial pivoting, with AMD60,309,370
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD104,531,067
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD193,974,168

    SVD-based statistics:
    norm(A)122.668
    min(svd(A))0
    cond(A)Inf
    rank(A)26,983
    sprank(A)-rank(A)2,937
    null space dimension2,937
    full numerical rank?no
    singular value gap7.5428e+12

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

    Andrianov/net100 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.