Data base for symbolic network analysis

A data base for generating the symbolic transfer functions for a linear electronic circuit is formulated and an appropriate retrieval theorem derived. The size of the required data base is 0 (n2) independently of the number of simultaneously varying parameters, where n is the total number of component output terminals, and the cost of retrieval is 0 (p3) multiplicaions where p is the actual number of circuit paramters which vary simultaneously in a given analysis. As such, both storage and computational requirements are minimised.