Академический Документы
Профессиональный Документы
Культура Документы
Introduction to Simulation Approaches Tearing and Partitioning of a flowsheet Algorithms for Tearing and Partitioning of a flowsheet
Introduction to Simulation Approaches Tearing and Partitioning of a flowsheet Algorithms for Tearing and Partitioning of a flowsheet
There are 2 basic approaches to process simulation: 1. Sequential Modular Approach (SMA) 2. Equation-Oriented Approach (EOA)
Sequential Modular Approach
Input variables
Output variables
Unit 1
Unit 2
Unit 3
Must tear the recycle stream if using the SMA approach Tear = Provide an initial guess
Consequence: Multiple-pass calculations and must solve a system of nonlinear equations to converge the tear stream. Advantages of SMA: 1. Conceptual simplicity 2. Correspondence to physical structure 3. Requires little storage and computer memory Disadvantage of SMA: -Inefficient, nested loops - making it difficult to solve optimization problems and flowsheet with many recycles
* ASPEN PLUS is a Sequential Modular simulator * SPEEDUP is an Equation-Oriented simulator
Process = Set of linear/nonlinear equations=> Solve them! So no modules!!! Solve all equations simultaneously Advantage of EOA: - Efficient because there are no loops Disadvantages of EOA: 1. Requires large number of estimates e.g. 2000 variables to solve => 2000 initial estimates 2. Requires good estimates 3. Requires large storage and computer memory 4. No correspondence to physical structure 5. Requires stable, reliable NLE solvers
Tearing and Partitioning Algorithms,Mayank Sabharwal, 16/09/2011
Introduction to Simulation Approaches Tearing and Partitioning of a flowsheet Algorithms for Tearing and Partitioning of a flowsheet
Partitioning a flowsheet
Tearing a flowsheet
Locate within a flowsheet the groups of units which must be solved together (called irreducible groups), with as fewest number of units as possible.
S8
S1
MIXER
S6 S5
FLASH
S3
REACTOR
S4
HEATX
S2
S9
S7
S7
S6
B2
S1
B1
S3
S4
B3
S5
B4
S2
Minimum # of tear streams = 1 Computational sequence = Depends on the tear stream In conclusion: # of recycle streams > minimum # of tear streams
Tearing and Partitioning Algorithms,Mayank Sabharwal, 16/09/2011
S8
The answer is 5.
Introduction to Simulation Approaches Tearing and Partitioning of a flowsheet Algorithms for Tearing and Partitioning of a flowsheet
Algorithm: 1. Select a unit/group 2. Trace outputs downstream until (a) a unit or a group on the path reappears. Go to step 3. (b) a unit or a group is reached with no external outputs. Go to step 4. 3. Label all units into a group. Go to step 2. 4. Delete the unit or group. Record it in a list. Go to step 2. Sequence is from bottom to top of list!
Tearing and Partitioning Algorithms,Mayank Sabharwal, 16/09/2011
A F
B G
C H
K
M D
J
E I
E
L
I
J K
List K J
EILD will be a group List K 4. Delete EILD since it has no more outputs J 5. A B C M EILD Delete M M C 6. A B C B Delete C, B, and then A A
Tearing and Partitioning Algorithms,Mayank Sabharwal, 16/09/2011
F
7. F G
G
H
H
G
EILD
List K J EILD M C B A GH F
K J There are two convergence loops namely GH and EILD but we still donot know the tear streams.
Tearing and Partitioning Algorithms,Mayank Sabharwal, 16/09/2011
graph
3 5
This is diagraph:
Arc Node
Tearing and Partitioning Algorithms,Mayank Sabharwal, 16/09/2011
Example: A
1
D
5
4 6
Transformation: diagraph to signal flow graph - Nodes become arcs. 1 - Arcs become nodes. - Direction of arc is from input to output. 5
Note that all process inputs and outputs have been deleted.
3 7
4 8
1. Graph Reduction: - Merge nodes with single precusor precursor: all nodes providing input to a given node are precursors for that node e.g. nodes 2 and 5 are precursors to node 3. The node with a single precursor is to be represented by that precursor e.g. Node 2 has a single precursor 1. So erase node 2 and represent it with node 1. - Merge parallel arcs (same direction)
3. If no progress possible, eliminate node with maximum # of output edeges. In case of tie, choose arbitrarily. Go to step 1.
1 5 2 6 3 7 4 8
Node
1 2 3 4 5 6 7 8
Tearing and Partitioning Algorithms,Mayank Sabharwal, 16/09/2011
Precursors
7 7, 3 2, 5 3 3, 6 2, 5 2, 5 3
2, 7 5, 6 2, 3 3, 5 2, 3, 5 7, 2, 3 3, 5, 6
- But node 2 and 5 have the largest number of output streams. - So eliminate node 2 and delete node 2 from the table. - Stream 2 is a tear stream.
Tearing and Partitioning Algorithms,Mayank Sabharwal, 16/09/2011
Node
Precursors
22
Tearing and Partitioning Algorithms,Mayank Sabharwal, 16/09/2011
Node
Precursors
3 5 5 3, 6 5 self-loop 6 5 7 5 So stream 5 is another tear stream. Tear streams are Stream 2 and Stream 5. The computational sequence is: C --> D --> E --> A --> B
23
Tearing and Partitioning Algorithms,Mayank Sabharwal, 16/09/2011