Matrix: Andrianov/ex3sta1

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

Andrianov/ex3sta1 graph
(undirected graph drawing)


Andrianov/ex3sta1

  • 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: 751 KB. Use UFget(1379) or UFget('Andrianov/ex3sta1') in MATLAB.
  • download in Matrix Market format, file size: 821 KB.
  • download in Rutherford/Boeing format, file size: 511 KB.

    Matrix properties
    number of rows16,782
    number of columns16,782
    nonzeros678,998
    structural full rank?yes
    structural rank16,782
    # of blocks from dmperm1
    # strongly connected comp.1
    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 AMD26,433,573
    Cholesky flop count8.2e+10
    nnz(L+U), no partial pivoting, with AMD52,850,364
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD56,342,358
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD83,494,245

    SVD-based statistics:
    norm(A)63.9865
    min(svd(A))2.51841e-19
    cond(A)2.54075e+20
    rank(A)12,102
    sprank(A)-rank(A)4,680
    null space dimension4,680
    full numerical rank?no
    singular value gap2.13215e+10

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

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