Abstract
A method for superimposing voltage sources is sought optimized by using a sparse triangular solver and multiprocessing. A revision to the method is suggested which exploits Schur’s complement of the network admittance matrix and optimal re-use of computations. The algorithm is implemented and parallelized for shared memory multiprocessing. The proposed algorithm is tested on a collection of large test systems and performance is found to be significantly better than the reference method. The algorithm will thereby facilitate a speed-up of methods relying on Thevenin equivalent representation such as the Thevenin equivalent method for contingency assessment.
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 callDisclaimer: 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.
