By Topic

Computation-free preconditioners for the parallel solution of power system problems

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)
H. Dag ; Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA ; F. L. Alvarado

Solution of a set of linear equations Ax=b is a recurrent problem in power system analysis. Because of computational dependencies, direct methods have proven to be of limited value in both parallel and highly vectorized computing environments. The preconditioned conjugate gradient method has been suggested as a better alternative to direct methods. The preconditioning step itself is not particularly well suited to parallel processing. Partitioned inverse representations of A are better suited to high performance computation. However, obtaining the partitioned inverse matrices can be expensive. This paper describes two techniques for preconditioning based on the partitioned inverses where the preconditioner matrix is obtained directly from an incomplete factorization without the need for additional numerical computation. Experiments indicate a 50% reduction in solution time in a parallel environment

Published in:

IEEE Transactions on Power Systems  (Volume:12 ,  Issue: 2 )