Abstract
A very efficient and intuitively pleasing algorithm for the formation of nodal admittance matrices is presented. The procedure is completely general and allows the accurate manipulation of distributed and non-bilateral components. It is free from most numerical difficulties, even when Ynod is singular, and it is easy to implement. It is basea on the concept of "primitive Ynode." matrices. A known but not widely publicized recursive method for finding primitive Y in distributed mutually coupled untransposed ines is presented. Ways of handling ideal transformers are described. Examples are given.

This publication has 0 references indexed in Scilit: