Partitioning and Tearing of Networks Applied to Process Flowsheeting
A review of the methods available for identification of the computational sequence in modular process simulators (partitioning and tearing) is followed by the presentation of a new very efficient and close-to-optimal routine for tearing. The problem of partitioning can be solved in computer times th...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Norwegian Society of Automatic Control
1983-07-01
|
| Series: | Modeling, Identification and Control |
| Subjects: | |
| Online Access: | http://www.mic-journal.no/PDF/1983/MIC-1983-3-2.pdf |
| Summary: | A review of the methods available for identification of the computational sequence in modular process simulators (partitioning and tearing) is followed by the presentation of a new very efficient and close-to-optimal routine for tearing. The problem of partitioning can be solved in computer times that are linear functions of the number of unit modules (vertices in the graph). The algorithm of Johns has been found to execute faster than the later and far better known algorithm of Tarjan. These methods are almost identical in idea but use different techniques in the book-keeping. |
|---|---|
| ISSN: | 0332-7353 1890-1328 |