Referenced Items are not available for this document.
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:
Power Systems, IEEE Transactions on
(Volume:10
,
Issue:
3
)
Date of Publication: Aug 1995
- Page(s):
- 1343 - 1349
- ISSN :
- 0885-8950
- INSPEC Accession Number:
- 5054608
- Digital Object Identifier :
- 10.1109/59.466519
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Aug 1995
- Sponsored by :
- IEEE Power & Energy Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
