Decomposition of nets
- 31 December 1972
- journal article
- Published by Elsevier BV in The Chemical Engineering Journal
- Vol. 3, 265-275
- https://doi.org/10.1016/0300-9467(72)85030-5
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.Keywords
This publication has 7 references indexed in Scilit:
- Computer-Aided Design, Part 2 An approach to convergence and tearing in the solution of sparse equation setsThe Chemical Engineering Journal, 1971
- Computer-aided design, Part 1 enhancing convergence properties by the choice of output variable assignments in the solution of Sparse equation setsThe Chemical Engineering Journal, 1971
- The analysis of chemical plant flowsheetsChemical Engineering Science, 1969
- Structuring design computationsAIChE Journal, 1969
- Decomposition of large scale systems—II Systems containing nonlinear elementsChemical Engineering Science, 1967
- Decomposition of large scale systems—I. Systems composed of lumped parameter elementsChemical Engineering Science, 1966
- An Algorithm for Least-Squares Estimation of Nonlinear ParametersJournal of the Society for Industrial and Applied Mathematics, 1963