Matrix: Andrianov/net125

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

Andrianov/net125 graph
(undirected graph drawing)


Andrianov/net125 dmperm of Andrianov/net125

  • 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: 3 MB. Use UFget(1387) or UFget('Andrianov/net125') in MATLAB.
  • download in Matrix Market format, file size: 3 MB.
  • download in Rutherford/Boeing format, file size: 2 MB.

    Matrix properties
    number of rows36,720
    number of columns36,720
    nonzeros2,577,200
    structural full rank?yes
    structural rank36,720
    # 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 AMD43,395,127
    Cholesky flop count1.9e+11
    nnz(L+U), no partial pivoting, with AMD86,753,534
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD202,026,884
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD293,358,896

    SVD-based statistics:
    norm(A)134.726
    min(svd(A))0
    cond(A)Inf
    rank(A)32,958
    sprank(A)-rank(A)3,762
    null space dimension3,762
    full numerical rank?no
    singular value gap3.9788e+12

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

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