Solution of Load-Flow Problems by Partitioning Systems into Trees
- 1 November 1968
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Apparatus and Systems
- Vol. PAS-87 (11) , 1931-1938
- https://doi.org/10.1109/tpas.1968.292015
Abstract
This paper presents a method of calculating load flows by partitioning a system into subsystems of tree form, for which the node-voltage equations can be solved very efficiently by optimally ordered Gaussian elimination. The solution for the complete system is then obtained by coupling direct solutions for the trees by a blockiterative method. Results comparing the block method with the accelerated Gauss-Seidel method show that the block method is considerably faster.Keywords
This publication has 12 references indexed in Scilit:
- Power Flow Solution by Newton's MethodIEEE Transactions on Power Apparatus and Systems, 1967
- Digital Methods Applied to Power Flow StudiesIEEE Transactions on Power Apparatus and Systems, 1967
- Z Diakoptics - Torn Subdivisions Radially AttachedIEEE Transactions on Power Apparatus and Systems, 1967
- Direct solutions of sparse network equations by optimally ordered triangular factorizationProceedings of the IEEE, 1967
- Some New Aspects on Load-Flow Calculation: I - Impedance Matrix Generation Controlled by Network TopologyIEEE Transactions on Power Apparatus and Systems, 1966
- Special Cases of Orthogonal Networks - Tree and LinkIEEE Transactions on Power Apparatus and Systems, 1966
- The Partitioning of Network Equations for Block IterationThe Computer Journal, 1966
- The Use of Linear Graphs in Gauss EliminationSIAM Review, 1961
- Elimination Methods for Load-Flow StudiesTransactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems, 1961
- Iteration Methods for Digital Load Flow StudiesTransactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems, 1959