TSOPF/TSOPF_FS_b39_c19
transient optimal power flow, Full-Space. Guangchao Geng, Zhejiang Univ
| Name |
TSOPF_FS_b39_c19 |
| Group |
TSOPF |
| Matrix ID |
2227 |
|
Num Rows
|
76,216 |
|
Num Cols
|
76,216 |
|
Nonzeros
|
1,977,600 |
|
Pattern Entries
|
1,977,600 |
|
Kind
|
Power Network Problem |
|
Symmetric
|
Yes |
|
Date
|
2009 |
|
Author
|
G. Geng |
|
Editor
|
T. Davis |
| Structural Rank |
76,216 |
| Structural Rank Full |
true |
|
Num Dmperm Blocks
|
2 |
|
Strongly Connect Components
|
2 |
|
Num Explicit Zeros
|
0 |
|
Pattern Symmetry
|
100% |
|
Numeric Symmetry
|
100% |
|
Cholesky Candidate
|
no |
|
Positive Definite
|
no |
|
Type
|
real |
| Download |
MATLAB
Rutherford Boeing
Matrix Market
|
| Notes |
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.
|
