## A Network Reduction-restoration (equivalence) Theory, |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Theoretical Basis | 3 |

Felement D and Egraphs | 14 |

Reduction TechniqueExamples 2 | 25 |

Copyright | |

6 other sections not shown

### Common terms and phrases

basis set bus voltages chapter circuit equations coefficient matrix complete contains cotree coupled Daisy digital computer displaced E-graph calculation electric network element 4-1 elements incident eliminated equations for SEND F-element f-seg matrix Fd(s Fdb(s Fe(s formulas Fs(s Fsd(s graph of Fig graph reduction I-explicit I-explicit form impedance matrix incidence matrix inverse required J-vertex J-vertices last equation last two equations Lemma matrix inversion matrix multiplication matrix of eq matrix triple product Ne-element non-circuit elements number of circuits number of elements number of rows number of segs number of vertices parallel elements phantom load power system Proof reduction calculation restoration calculation row of eq sd(s seg equations series elements set of circuit set of seg set of V-functions SkEk Sl2D solution of eq specifies subgraph submatrices subset system for SD system of eq system of equations Tev(s Theorem tree of ND V-explicit F-equations V-values vertex zones Zs(s Zsi(s