Matrix: Andrianov/lpl1

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

Andrianov/lpl1 graph
(undirected graph drawing)


Andrianov/lpl1 dmperm of Andrianov/lpl1

  • 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: 617 KB. Use UFget(1384) or UFget('Andrianov/lpl1') in MATLAB.
  • download in Matrix Market format, file size: 534 KB.
  • download in Rutherford/Boeing format, file size: 375 KB.

    Matrix properties
    number of rows32,460
    number of columns32,460
    nonzeros328,036
    structural full rank?yes
    structural rank32,460
    # of blocks from dmperm3
    # strongly connected comp.3
    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 AMD968,227
    Cholesky flop count1.6e+08
    nnz(L+U), no partial pivoting, with AMD1,903,994
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD19,297,162
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD36,796,010

    SVD-based statistics:
    norm(A)45.987
    min(svd(A))1.47454e-28
    cond(A)3.11874e+29
    rank(A)31,143
    sprank(A)-rank(A)1,317
    null space dimension1,317
    full numerical rank?no
    singular value gap1.46086e+09

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

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