An algorithm for reducing circuit equations in computer applications

Computer formulation of circuit equations using the modified nodal analysis is discussed. The modified nodal formulation gives rise to an unproportionately large number of circuit equations, even for small networks. An algorithm is presented to reduce these equations to a very small number, thereby reducing the memory requirement, as well as runtime, for the solution network responses. Though it is useful in any computer-aided analysis of networks, the algorithm is especially useful for microcomputers where memory size and run time are significant. It also eliminates the need to use sparse matrix techniques in solving the circuit equations.<
>