Matrix: Hollinger/g7jac100

Description: Jacobian from CEPII's 'G7marmotte' OLG model, oldstack 100

Hollinger/g7jac100 graph Hollinger/g7jac100 graph
(bipartite graph drawing) (graph drawing of A+A')

Hollinger/g7jac100 dmperm of Hollinger/g7jac100
scc of Hollinger/g7jac100

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

    Matrix properties
    number of rows29,610
    number of columns29,610
    structural full rank?yes
    structural rank29,610
    # of blocks from dmperm1,437
    # strongly connected comp.737
    explicit zero entries48,664
    nonzero pattern symmetry 4%
    numeric value symmetry 0%
    Cholesky candidate?no
    positive definite?no

    authorP. Hollinger
    editorT. Davis
    kindeconomic problem
    2D/3D problem?no

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD7,749,811
    Cholesky flop count9.2e+09
    nnz(L+U), no partial pivoting, with AMD15,470,012
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD8,559,785
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD16,662,801

    Note that all matrix statistics (except nonzero pattern symmetry) exclude the 48664 explicit zero entries.

    SVD-based statistics:
    null space dimension7,639
    full numerical rank?no
    singular value gap1.02363

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

    Hollinger/g7jac100 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.