Matrix: Hollinger/g7jac040

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

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

Hollinger/g7jac040 dmperm of Hollinger/g7jac040
scc of Hollinger/g7jac040

  • 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: 857 KB. Use UFget(549) or UFget('Hollinger/g7jac040') in MATLAB.
  • download in Matrix Market format, file size: 1 MB.
  • download in Rutherford/Boeing format, file size: 992 KB.

    Matrix properties
    number of rows11,790
    number of columns11,790
    structural full rank?yes
    structural rank11,790
    # of blocks from dmperm597
    # strongly connected comp.317
    explicit zero entries7,288
    nonzero pattern symmetry 5%
    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 AMD1,749,473
    Cholesky flop count1.1e+09
    nnz(L+U), no partial pivoting, with AMD3,487,156
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD2,039,151
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD3,614,040

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

    SVD-based statistics:
    null space dimension2,952
    full numerical rank?no
    singular value gap1.01622

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

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