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

Combining direct and inverse factors for solving sparse network equations in parallel

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

3 Author(s)

A new parallel algorithm for solving the forward and back substitution part of the solution of sparse network equations for power systems is proposed. The approach assumes that the network equations are solved by LDU factorization and sparse vector techniques. The parallelization approach is based on the factorization path tree and its main feature is the switching from direct factor to inverse factors to best exploit the parallelism during the solution. The algorithm can be easily mapped on a multiprocessor architecture that exhibits both global and local memories. An illustrative example and validation results showing the effectiveness of the algorithm are also presented

Published in:

Power Systems, IEEE Transactions on  (Volume:9 ,  Issue: 4 )

Date of Publication:

Nov 1994

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.