By Topic

Efficient heuristic partitioning algorithm for parallel processing of large power systems network equations

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
$33 $33
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

3 Author(s)
K. W. Chan ; Sch. of Electron. & Electr. Eng., Bath Univ., UK ; R. W. Dunn ; A. R. Daniels

An efficient heuristic algorithm for automatic partitioning of a power system network is presented. The algorithm was designed for use in conjunction with a diakoptics-based coarse grain parallel method for solving large, sparse linear systems arising from network analysis. It exploits the techniques of factorisation path graph partitioning and equivalent post-ordering. Test results for systems up to 811 busbars and 1476 transmission lines are included for comparison purposes. This indicates that the method is able to divide a power system network model into a number of equal sized subnetworks in order to optimise the use of parallel computer systems for network analysis while the resultant number of fill-in elements is kept to a minimum

Published in:

IEE Proceedings - Generation, Transmission and Distribution  (Volume:142 ,  Issue: 6 )