Analysis of loop methods for simulating gas networks
暂无分享,去创建一个
Abstract Four methods of loop generation have been described. Methods 1, 3, and 4 involve the depth-first search and the breadth-first search methods of graph searching to determine a dendrite of the network. In the second type (Method 2) a dendrite is generated in a different way. Assuming that the loop generation method is a part of the network simulation algorithm, the effectiveness of these methods has been investigated. The criterion of comparison has been formulated. Results of investigations have been given.
[1] Narsingh Deo,et al. Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.
[2] H. Woźniakowski,et al. Numerical stability of the Chebyshev method for the solution of large linear systems , 1977 .
[3] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .
[4] Keith Paton,et al. An algorithm for the blocks and cutnodes of a graph , 1971, Commun. ACM.
[5] Michael Athans,et al. Systems, networks, and computation: multivariable methods , 1974 .