By Topic

Parallel algorithms for direct solution of large sparse power system matrix 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

1 Author(s)
Chan, K.W. ; Dept. of Electr. Eng., Hong Kong Polytech., Kowloon, China

A coarse-grain parallel implementation is presented of LU factorisation, forward and backward substitution for solving large, sparse linear sets of algebraic equations arising from network analysis. A block solution approach was chosen instead of the usual element-wise method, to reduce communication overhead and consequently to obtain a better performance of the parallel implementation. An inverse-based technique was used to further improve the overall efficiency of repeated solutions. Data exchanges among processors are kept to the minimum in the factorisation and solution phases. This method has been successfully applied to a realistic UK 811-busbar power system network with up to 16 processors. Results are presented with detailed information on computation and communication

Published in:

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