Journal Article10.1016/0009-2509(72)85102-9
Algorithms for structuring design calculations
16
TL;DR: Algorithms are presented which provide a method for determining a set of design variables and a computational sequence which will minimize the amount of iterative computation necessary to solve algebraic equations.
read more
About: This article is published in Chemical Engineering Science. The article was published on 01 Dec 1972. The article focuses on the topics: Iterative method & Computation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Steady state chemical process simulation
TL;DR: In this paper, the authors survey the literature of the last three years, exploring the answers to the question: How has chemical process simulation by computer fulfilled expectations in industry and education and what are the major areas of research identifiable at this time?
96
Analysis of a complex plant-steady state and transient behavior
TL;DR: To tackle process design problems of this complexity several chemical process and petroleum companies, consulting firms and academic institutions developed general integrated digital computer programs for steady-state and transient simulation provided frequently with process-oriented input description, automatic sequencing of computation, built-in unified physical data bank, provision for convergence and standard unit operation subroutines.
81
Efficient solution of sparse sets of design equations
TL;DR: A new algorithm is described which can help the engineer find efficient strategies for solving sets of equations of the sorts that arise in process design and yields improvements in strategies published by Lee{et al.
30
Integrated controlled random search: application to a wastewater treatment plant model
J. Rodriguez Banga,J. J. Casares Long +1 more
- 01 Jan 1987
TL;DR: In this paper, an integrated procedure, ICRS, was developed for the solution of constrained optimization problems, which combines an equation-sequencing and design variables specification algorithm with a random search technique, which itself contains a Newton-Raphson algorithm to cope with cases where a full sequence of equality constraints is not attainable.
29
The selection of design variables in systems of algebraic equations
Neil L. Book,W. Fred Ramirez +1 more
TL;DR: In this paper, a new theory called solution mapping is proposed, which gives detailed information about the structure of all underspecified systems of algebraic equations which do not contain persistent iteration.
14
References
Structuring design computations
TL;DR: Algorithm I-R extends existing algorithms for finding the minimal sized blocks of units between which no recycle exists and uses the concept of indexing to order computations which evade algorithm II-R.
63
Design variable selection to simplify process calculations
TL;DR: A method is proposed for determining a set of design variables which could minimize the computational labor associated with process analysis, part of a larger project on the computer aided design of process systems.
47
On the ordering of recycle calculations
Wooyoung Lee,Dale F. Rudd +1 more
TL;DR: This work discusses the problem of determining the minimum number of recycle parameters that must be assumed to render recycle calculations acyclic and has significance in the evolution of computer programs for the automatic design of process systems.
43
Decomposition of large scale systems—I. Systems composed of lumped parameter elements
TL;DR: In this article, an algorithm is developed to decompose large scale systems into their irreducible cyclical nets, i.e. nets which evolve because of recycle streams.
39
The structuring of process optimization
TL;DR: The efficiency of process optimization by mathematical programming can be increased by tearing, that is, rearranging the design equations so as to reduce the number of equality constraints.
35