By Topic

Research on the algorithm of connectivity analysis for power system based on spectral graph theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Dongyun Wang ; Sch. of Electr. & Inf. Eng., Zhongyuan Univ. of Technol., Zhengzhou, China ; Fanghua Liu ; Hongtao Peng ; Liusong Wang

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 space needed is O(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.

Published in:

Control and Decision Conference (CCDC), 2012 24th Chinese

Date of Conference:

23-25 May 2012