On iterative factorization in network analysis by digital computer
W. H. Kim, Daniel H. Younger, Charles V. Freiman, Wataru Mayeda · 1960
The need to determine the sum of all tree admittance products occurs in almost all applications of topological network theory. This paper describes a method of obtaining this sum through an iterative factorization of the sum of tree admittance products of successively more complex subnetworks. Computational efficiency is achieved in that: (1) it is not necessary to test sets of branches for the presence of circuits; and (2) it is not necessary to calculate each tree admittance product.