Abstract :
A generalized method of tearing, or diakoptics, for solving large-scale networks is derived. The idea of diakoptics is viewed as simply the partition of branches and the Kirchhoff laws. A solution algorithm based on LU decomposition is presented. If the network may be "torn apart," then the computations at the subnetwork level can be carried out independently. We present an example which is a family of networks with a parameter p and show that diakoptics, compared to the conventional network analysis, sometimes saves computations and sometimes requires more computations.
