Obtaining symbolic network functions of large circuits-an algebraic approach

In this paper we describe an algebraic method for obtaining the symbolic network functions of large circuits. The method is based on the generalised Laplace theorem and a new technique for block decomposition of the node admittance matrix. Our approach has the advantages of hierarchical decomposition and requires only simple manipulation of the node admittance matrix. We use the modified genetic algorithm to efficiently solve the problem of decomposition of large sparse matrices.