Description: transient optimal power flow, Full-Space. Guangchao Geng, Zhejiang Univ
|(undirected graph drawing)|
|number of rows||120,216|
|number of columns||120,216|
|structural full rank?||yes|
|# of blocks from dmperm||2|
|# strongly connected comp.||2|
|explicit zero entries||0|
|nonzero pattern symmetry||symmetric|
|numeric value symmetry||symmetric|
|kind||power network problem|
|Additional fields||size and type|
Transient stability-constrained optimal power flow (TSOPF) problems from Guangchao Geng, Institute of Power System, College of Electrical Engineering, Zhejiang University, Hangzhou, 310027, China. (genggc AT gmail DOT com). Matrices in the Full-Space (FS) group are symmetric indefinite, and are best solved with MA57. Matrices in the the Reduced-Space (RS) group are best solved with KLU, which for these matrices can be 10 times faster than UMFPACK or SuperLU.
|nnz(chol(P*(A+A'+s*I)*P')) with AMD||8,544,565|
|Cholesky flop count||1.2e+09|
|nnz(L+U), no partial pivoting, with AMD||16,968,914|
|nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD||1,170,439,076|
|nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD||1,932,350,520|
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.