A Novel Factorization-Tree Method to the Solution of Network Equations
Shin-Feng Chen
Abstract
Shin-Feng Chen
Abstract
Because of advances in the development of parallel computer architecture, parallel processing systems have the potential to become useful for power system applications by simultaneously solving the independent functions of a given task. A power system is separated into as many subnetworks, referred to as a bordered block diagonal form (BBDF) matrix, as the processors of a parallel computer. Balance loading on all processors is essential to ensure the success of any parallel approach. In this study, a novel method involving the factorization tree approach on the basis of calculating the maximum number of fill-ins and the degree of every node as the cutset block nodes is proposed. Using the proposed approach, the number of nodes in each subnetwork is more uniform and computation time is saved. Simulation results of the IEEE test systems and the Taiwan Power Company 288-bus system are presented to verify the feasibility of the proposed approach and its capability to implement parallel computing for load flow analysis.
A significance statement is not available in the OpenAlex record.
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.
Because of advances in the development of parallel computer architecture, parallel processing systems have the potential to become useful for power system applications by simultaneously solving the independent functions of a given task. A power system is separated into as many subnetworks, referred to as a bordered block diagonal form (BBDF) matrix, as the processors of a parallel computer. Balance loading on all processors is essential to ensure the success of any parallel approach. In this study, a novel method involving the factorization tree approach on the basis of calculating the maximum number of fill-ins and the degree of every node as the cutset block nodes is proposed. Using the proposed approach, the number of nodes in each subnetwork is more uniform and computation time is saved. Simulation results of the IEEE test systems and the Taiwan Power Company 288-bus system are presented to verify the feasibility of the proposed approach and its capability to implement parallel computing for load flow analysis.
Key concepts: Subnetwork, Computer science, Block (permutation group theory), Parallel computing, Node (physics), Diagonal, Tree (set theory), Electric power system