论文信息 - Decomposition of nets

Decomposition of nets

Abstract An improved mode of representation for networks resulting from process simulation flowcharts is presented based on the signal flowgraph concept. Decomposition of maximal cyclical nets in the digraph by a minimal cut-vertex set becomes a simple three-step procedure of reduction to intervals, elimination of self-loops and processing of node pairs associated with two-way edges. Identification of cyclical nets is obtained as a by-product of decomposition. The procedure is applicable to equation-ordering problems if the output set is selected a priori.

R. L. Motard | R. W. Barkley

[1] H. P. Hutchison,et al. The analysis of chemical plant flowsheets , 1969 .

[2] D. Marquardt. An Algorithm for Least-Squares Estimation of Nonlinear Parameters , 1963 .

[3] D. M. Himmelblau. Decomposition of large scale systems—I. Systems composed of lumped parameter elements , 1966 .

[4] Arthur W. Westerberg,et al. Computer-Aided Design, Part 2 An approach to convergence and tearing in the solution of sparse equation sets , 1971 .

[5] David M. Himmelblau,et al. Decomposition of large scale systemsII Systems containing nonlinear elements , 1967 .

[6] Arthur W. Westerberg,et al. Computer-aided design, Part 1 enhancing convergence properties by the choice of output variable assignments in the solution of Sparse equation sets , 1971 .