Efficient generation of symbolic network functions for large-scale circuits

In this paper we describe a new algebraic approach to symbolic analysis of large-scale networks. Our method is based on the reduction of the compacted modified node admittance matrix to a 2×2 matrix. No circuit partitioning is required. Internal variables are suppressed one by one using Gaussian elimination. To minimise the number of symbolic operations we employ a locally optimal pivoting strategy. The technique is conceptually very simple and produces sequential formulae of significantly lesser complexity than any exact method published to date