Fast loop matrix generation for hybrid analysis and a comparison of the sparsity of the loop impedance and MNA impedance submatrices

Abstract

The authors report on a new method developed for loop matrix generation which is essentially an extension of the mesh matrix generation method, to handle nonplanar graphs. This method, based on J. Tarjan and R. Hopcroft's (1974) planarity testing algorithm, was found to yield sparse loop impedance matrices. For graphs with nonplanarity of 10%, the density of the resulting loop impedance matrix was less than 1%. For most networks with nonplanarities of about 2%, the number of nonzero entries was found to be less than that for the modified nodal analysis (MNA) matrix. In these cases loop analysis is expected to perform better than MNA for iterative methods of linear equation solution, both the number of iterations and the time taken for each iteration of the linear equation solution being less than that for MNA,