Signal-flow-graph analysis by decomposition method

The paper concerns a new approach to the topological analysis of linear networks. It gives a brief description of the hierarchic decomposition method (i.e. multiple decomposition of a decomposed network) which can be applied in computer analysis of networks. It is shown that this method in computer applications considerably reduces the number of operations needed, and thus the computer time. The applications of the method to the analysis of signal-flow graphs have been pointed out. The algorithms of analysis, and some advantages of this method, are described briefly at the end of the paper.