Search

Kron's Diakoptics is well known as a solution method of large-scale network problems by tiering. It interconnects all tiered subnetworks with tiered branches simultaneously by one step. We introduce Multistep Diakoptics (MSD), which interconnects tiered subnetworks partially with subsets of tiered branches step-by-step, and completes interconnections by multiple steps. By using the parallel computation method, the MSD algorithm uses less computation time than is the case with the standard Diakoptics algorithm. This paper introduces the MSD algorithm and the program that is executed by each computer in a multiple computer system and solves only a tiered subnetwork problem. We also explain the contents of data which must be transmitted to other computers. Furthermore, computation complexity, communication complexity, and organization of block data used in each computer for simulation of large-scale nonlinear networks are discussed, and a simple method for applying MSD in practice is introduced. It is concluded that, characteristically, MSD reduces the computation time in accordance with the number of computers if the data transmission time can be neglected. [ABSTRACT FROM AUTHOR]