Search

The objectives of the work described in this paper were to investigate the application of digraphs in analysing general electronic networks and to develop a computer programme based on a particular digraph method developed by Chen. The Chen digraph method is a topological method for solution of networks and serves as a short cut when hand calculations are required. The advantage offered by this method of analysis is that the results are in symbolic form. It is limited, however, by the size of network that may be handled. Usually hand calculations become too tedious for networks larger than about five nodes, depending on how many elements the network contains. Direct determinant expansion for a 5-node network is a very tedious process also.
The work resulted in a short-cut approach to the formulation of a digraph from a network in the form of a table of digraphs for all network elements. The table is included in this report. The work also resulted in a computer program implemented in FORTRAN II code for the University of Santa Clara IBM 1130 computer with which a given digraph can be analysed. The output of this programme is the determinant and all co-factors of the node admittance matrix. [ABSTRACT FROM AUTHOR]