Abstract
This paper presents a parallel load flow algorithm employing the fast decoupled method. The algorithm transforms the problem's matrices into block diagonal form which is analogous to parsing the network into a number of independent clusters connected through tie lines. It modifies the clusters' matrices to account for the effect of cut lines in a manner that produces nonsingular and well-conditioned matrices. It uses existing efficient load flow programs with some modifications. The approach avoids problems associated with the parallel solution of highly sparse large linear systems of equations. Test results of standard systems and an existing 1177-bus system are included to illustrate the usefulness of the algorithm and its viability in parallel processing implementation.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
