A parallel algorithm for solving large sparse matrix equations and its application to parallel power flow calculation
Chao Hong
Abstract
Chao Hong
Abstract
On the basis of the factorization path trees associated with sparse matrixes, a parallel algorithm for solving large sparse network equations suitable for implementations on message passing multicomputers has been presented. The proposed algorithm has been incorporated in a parallel power flow calculation method, and the parallel power flow solution algorithm has been implemented on a message passing multicomputer. Test results with large power systems are presented to show that the proposed algorithm can effectively speed up power flow calculations.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
On the basis of the factorization path trees associated with sparse matrixes, a parallel algorithm for solving large sparse network equations suitable for implementations on message passing multicomputers has been presented. The proposed algorithm has been incorporated in a parallel power flow calculation method, and the parallel power flow solution algorithm has been implemented on a message passing multicomputer. Test results with large power systems are presented to show that the proposed algorithm can effectively speed up power flow calculations.
Key concepts: Computer science, Parallel algorithm, Parallel computing, Power flow, Message passing, Algorithm, Sparse matrix, Flow (mathematics)