Abstract
The Multi-Area Thévenin Equivalents (MATEs) algorithm takes a partitioned network into a number of subnetworks interconnected by links and solves it in a two-step procedure: first, the subnetworks are solved independently, with the links open, and then the system formed by the links is solved with the subnetworks represented by their Thévenin equivalents as seen from the link nodes. In this paper, novel concepts, based on the characteristics of the electric networks, are introduced to the MATE algorithm, which minimize computation, memory usage and data exchange between processes. In addition, the performance of the algorithm is also analyzed and theoretical speedups limits are also obtained. Lastly, an application using the Western Electricity Coordinating Council (WECC) system (∼15,000 buses) is presented and compared with timings obtained with another parallel sparse linear solver.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Electrical Power & Energy Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
