
Accession Number : AD0644518
Title : TRANSFORMATION FOR NETWORK ANALYSIS,
Corporate Author : ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB
Personal Author(s) : Mayeda,Wataru
Report Date : NOV 1966
Pagination or Media Count : 28
Abstract : Since a computer is used to analyze a network, many new methods of analysis are introduced. Obviously, these have many advantages. However, all of these methods suffer from the exponential increase of computer time as networks become larger. It is clear that a simplification of a given network is a solution to this difficulty. A simple transformation introduced here gives an equivalent network with respect to a desired network function which has less number of vertices. Thus, in general, the computation becomes simpler. A special case of this transformation is a well known T  pi transformation. The successive application of this transformation can be employed to reduce the number of vertices so that the final resultant network has the minimum number of vertices necessary to give the desired network functions. This procedure is very similar to successive reduction of vertices (nodes) in a signal flow graph. (Author)
Descriptors : (*ELECTRICAL NETWORKS, MATHEMATICAL ANALYSIS), TOPOLOGY, TRANSFORMATIONS(MATHEMATICS), ADMITTANCE, COMPUTER PROGRAMMING, GRAPHICS
Subject Categories : Electrical and Electronic Equipment
Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE