Cart (Loading....) | Create Account
Close category search window
 

A 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
$31 $31
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)

An efficient heuristic algorithm for automatic partitioning of a power system network is presented. The algorithm exploits the techniques of factorization 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 shows 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:

Advances in Power System Control, Operation and Management, 1993. APSCOM-93., 2nd International Conference on

Date of Conference:

7-10 Dec 1993

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.