Matrix: LiuWenzhuo/powersim

Description: Power simulation matrix from Liu Wenzhuo, EPRI, China

LiuWenzhuo/powersim graph LiuWenzhuo/powersim graph
(bipartite graph drawing) (graph drawing of A+A')

LiuWenzhuo/powersim dmperm of LiuWenzhuo/powersim

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: LiuWenzhuo
  • Click here for a description of the LiuWenzhuo 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: 398 KB. Use UFget(1212) or UFget('LiuWenzhuo/powersim') in MATLAB.
  • download in Matrix Market format, file size: 601 KB.
  • download in Rutherford/Boeing format, file size: 534 KB.

    Matrix properties
    number of rows15,838
    number of columns15,838
    structural full rank?yes
    structural rank15,838
    # of blocks from dmperm3,600
    # strongly connected comp.3,600
    explicit zero entries3,138
    nonzero pattern symmetry 59%
    numeric value symmetry 53%
    Cholesky candidate?no
    positive definite?no

    authorW. Liu
    editorT. Davis
    kindpower network problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 15838-by-1

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD59,254
    Cholesky flop count2.5e+05
    nnz(L+U), no partial pivoting, with AMD102,670
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD48,703
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD102,067

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

    SVD-based statistics:
    null space dimension0
    full numerical rank?yes

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

    LiuWenzhuo/powersim 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.