On a new and very efficient method of symbolic analysis

A new approach to the symbolic analysis of linear networks is presented. A computer program based on this approach is described. It is shown that this method considerably reduces the number of operations needed, the number of components in the final results, and thus the computer time. The method is based on the tableau description of the analyzed closed network. Descriptions of elements of the network are optimally chosen successively during the operation of the algorithm. The method presented is considered to be the best so far among direct methods of fully symbolic analysis and considerably enhances the possibility of such an analysis.