A Matrix Method for Computing Process Networks Containing Multiple Nested Recycle Loops

Abstract

Many process networks contain nested recycle loops representing either flow of material or of information. The computation of such a process network typically involves iterative procedures, whereby each nested loop is often converged individually. Methods have been described for arriving at a calculation sequence which minimizes the number of recycle streams and / or variables to be computed iteratively. This paper presents a matrix method which makes use of the results of such network analysis as well as information obtained in solving each individual unit operation block to arrive efficiently at a solution of the complete process network.