0% found this document useful (0 votes)
3 views7 pages

Modeling_Simulation_Lecture21

The document discusses criteria for stream tearing in chemical engineering, including minimal tear sets, non-redundancy, and optimization problems related to stream variables. It also highlights the importance of iterative algorithms for convergence in solving equations related to chemical processes. Various methods, such as fixed-point iteration and Newton-type methods, are examined for their effectiveness and limitations in achieving stability and convergence.

Uploaded by

zarandluxurey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views7 pages

Modeling_Simulation_Lecture21

The document discusses criteria for stream tearing in chemical engineering, including minimal tear sets, non-redundancy, and optimization problems related to stream variables. It also highlights the importance of iterative algorithms for convergence in solving equations related to chemical processes. Various methods, such as fixed-point iteration and Newton-type methods, are examined for their effectiveness and limitations in achieving stability and convergence.

Uploaded by

zarandluxurey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

1/10/2021

Ali M. Sahlodin
Department of Chemical Engineering
AmirKabir University of Technology
1397 S.H

 Stream tearing
 Criterion 1: Minimal tear set

Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 2

1
1/10/2021

 Criterion 2: minimum number of times a


loop is torn (non-redundancy).
A Streams
Loops 1 2 3 4 5 6 7 8
1 * *
2 * * * *
3 * * *
4 * * * *

Luckily, every loop is torn


exactly once (not always)!

Biegler et al., Systematic Methods of Chemical


Process Design

Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 3

 Find the loop incidence array and determine


if all the loops can be torn exactly once?

Biegler et al., Systematic Methods of Chemical


Process Design

Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 4

2
1/10/2021

n
min
yj
 wj y j
j 1
n
s.t.  aij y j  1 i  1,, L
j 1
y j  {0,1}
L
Weights: Column sum for each stream w j   aij
i 1

Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 5

 Criterion 3: minimum number of tear variables


(reduce no. of equations)
 Is the stream single or multiphase?
 Is it a material or energy stream?
n
min
yj
 wj y j
j 1
n
Criterion 3 as an optimization
problem
s.t.  aij y j  1 i  1,, L
j 1
y j  {0,1}

w j  no. of variables in each stream

Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 6

3
1/10/2021

 Criterion 4: easiness of guessing stream variables


 Example:
 M4 temperature specified
 U3 is a mixer, U4 is a heat exchanger
 Tear M3 or M4?

Turton et al. Analysis, Synthesis, and Design of Chemical Processes


Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 7

 Calculator blocks (aka spreadsheet)


 Design blocks (aka controller/adjust blocks)
 Implicit loops (manipulated and calculated
variables are not the same!)

3 partitions

Calculation loops can


affect the partitioning

2 partitions

Turton et al. Analysis, Synthesis, and Design of Chemical Processes


Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 8

4
1/10/2021

A number of iterative algorithms available


 Choice of algorithm critical for convergence
 Two main algorithms
 Fixed-point iteration methods
 Newton-type methods

Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 9

1. For f ( x)  0, form x  g ( x)
2. Given x0
3. Iterate x k 1  g ( x k )
4. Until x k 1  g ( x k 1 )  TOL

Pro: Derivative free! Courtesy of Benoit Chachuat

Limitations
Slow convergence
Divergence possible
g  g 
( x)  1 or max  ( x)   1
x  x 

Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 10

5
1/10/2021

f ( x)  exp( x) / 2  x  1  0 f ( x)  exp( x)  x  2  0
Iter x g(x) Iter x g(x)
0 0.2 0.389299 0 0.2 0.778597
1 0.389299 0.262027 1 0.778597 -0.17841
2 0.262027 0.350219 2 -0.17841 1.163404
3 0.350219 0.290311 3 1.163404 -1.20081
4 0.290311 0.331578 4 -1.20081 1.69905
5 0.331578 0.303417 5 1.69905 -3.46875
6 0.303417 0.32276 6 -3.46875 1.968844
7 0.32276 0.309533 7 1.968844 -5.16239
8 0.309533 0.318606 8 -5.16239 1.994272
9 0.318606 0.312395 9 1.994272 -5.34685
10 0.312395 0.316652 10 -5.34685 1.995237

0.5

0.4 4

0.3 2
0.2
0
0.1 0 2 4 6 8 10 12
-2
0
0 5 10 15 -4

-6

Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 11

 No account of interactions between different


variables and different tear streams.
 Not suitable for processes with multiple tear
streams, many variables, and design blocks.
 Slow (linear) convergence
 Many iterations needed
 Potential divergence

Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 12

6
1/10/2021

 Modify the iterations as

x( k 1)  h( x( k ) )  qx( k )  (1  q) g ( x( k ) )
 Choice of q depends on the objective
 Acceleration (q<0)
 Dominant Eigenvalue method
 Wegstein’s method
 May not always work (when?)
 Stability (0<q<1)
 Damping effect with oscillatory (diverging or converging)
iterations
 May not always stabilize diverging iterations (when?)
Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 13

 Stabilize the fixed-point iteration (x0=0.2)

f ( x)  exp( x)  x  2  0

Copyright © Ali M. Sahlodin, Dept. of Chemical Engineering, AmirKabir Univ. of Tech. 14

You might also like