Matrix: Schenk_IBMNA/c-30

Description: IBM TJ Watson, non-linear optimization

Schenk_IBMNA/c-30 graph
(undirected graph drawing)


Schenk_IBMNA/c-30

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: Schenk_IBMNA
  • Click here for a description of the Schenk_IBMNA 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: 196 KB. Use UFget(1549) or UFget('Schenk_IBMNA/c-30') in MATLAB.
  • download in Matrix Market format, file size: 190 KB.
  • download in Rutherford/Boeing format, file size: 154 KB.

    Matrix properties
    number of rows5,321
    number of columns5,321
    nonzeros65,693
    structural full rank?yes
    structural rank5,321
    # of blocks from dmperm1
    # strongly connected comp.1
    explicit zero entries0
    nonzero pattern symmetrysymmetric
    numeric value symmetrysymmetric
    typereal
    structuresymmetric
    Cholesky candidate?no
    positive definite?no

    authorIBM
    editorO. Schenk
    date2006
    kindoptimization problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 5321-by-1

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD42,738
    Cholesky flop count6.6e+05
    nnz(L+U), no partial pivoting, with AMD80,155
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD1,181,808
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD3,618,370

    SVD-based statistics:
    norm(A)4.68199e+06
    min(svd(A))2.23584e-07
    cond(A)2.09406e+13
    rank(A)5,320
    sprank(A)-rank(A)1
    null space dimension1
    full numerical rank?no
    singular value gap436.395

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

    Schenk_IBMNA/c-30 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.