next up previous
Next: The Node-Tearing Algorithm Up: Parallel Block-Diagonal-Bordered Sparse Linear Previous: Parallel Computing Analysis

Node-Tearing Nodal Analysis

Node-tearing nodal analysis partitions a power systems network graph into independent subgraphs and a coupling network, which corresponds to determining the diagonal blocks and lower border in a block-diagonal-bordered form matrix. We have selected node-tearing nodal analysis to partition power systems networks and form block-diagonal-bordered matrices because this algorithm examines the natural structure in the matrix while providing the means to minimize the number of coupling equations. Tearing here refers to breaking the original problem into smaller sub-problems whose partial solutions can be combined to give the solution of the original problem. Node-tearing nodal analysis is a specialized form of diakoptic analysis [26] that was developed especially for power system network analysis [49]. In general, node-tearing analysis is superior to conventional diakoptic analysis because node-tearing simply orders the network graph and does not generate new nodes in the power distribution network graph. For power systems networks, the corresponding ordered admittance matrices retain their symmetry and positive definite nature. Examples in reference [49] illustrate that the technique also has validity for general structural analysis matrices.





David P. Koester
Sun Oct 22 17:27:14 EDT 1995