By Topic

Parallel solution of large sparse matrix equations and parallel power flow

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

2 Author(s)
Jun Qiang Wu ; Arizona State Univ., Tempe, AZ, USA ; A. Bose

A very efficient parallel LU factorization and substitution algorithm for solving large sparse network equations on shared memory multi-processor parallel computers is presented. By rearranging the order of the computations, better parallelism is obtained out of the traditionally sequential method. Performance results on an actual parallel computer are presented and discussed. Parallel gains for the power flow solution using Newton's and fast decoupled methods are presented to demonstrate it's effectiveness. Better speedup gains are obtained for larger systems and speedup of over 13 for Newton's power flow on a 20 processor shared memory computer has been obtained

Published in:

IEEE Transactions on Power Systems  (Volume:10 ,  Issue: 3 )