Research on the Algorithm of Connectivity Analysis for Power System Based on Spectral Graph Theory
Power system model is described by graph in this paper. A new judging approach to the network connectivity is proposed, it is based on properties of Laplacian matrix eigenvalues in spectral graph theory, the property is that a network is connected if and only if the second smallest eigenvalue over zero .Note that computation of the spectrum of a matrix has worst-case complexity O(n3), the memory s pace needed is I(n2) , where n is the size of the matrix. In order to improve operation efficiency of the judgment of network connectivity and reduce the memory space, a polynomial matrix is constructed based on the polynomial acceleration methods, the limited eigenvalues we needed are computed through matrix-vector multiplication and real backward FFT. Finally, the network connectivity is judged by the size of eigenvalues. This method is suitable for the judgment of network connectivity for large-scale power system, requires O(n ) operations and the spending of memory space can be reduced effectively.
Power System Graph Theory Connectivity Laplacian Matrix FFT
Dongyun Wang Fanghua Liu Hongtao Peng Liusong Wang
School of Electric and Information Engineering, Zhongyuan University of Technology, Zhengzhou 450007
国际会议
The 24th Chinese Control and Decision Conference (第24届中国控制与决策学术年会 2012 CCDC)
太原
英文
19-22
2012-05-23（万方平台首次上网日期，不代表论文的发表时间）