Mah / Brenner / Acrivos Chemical Process Structures and Information Flows

1. Auflage 2013
ISBN: 978-1-4832-7833-9
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 516 Seiten, Web PDF

Chemical Process Structures and Information Flows focuses on the role of computers in the understanding of chemical processes, including the use of simulation and optimization in computational problems. The book first underscores graphs and digraphs and pipeline networks. Discussions focus on cutsets and connectivity, directed graphs, trees and circuits, matrix representation of digraphs and graphs, reachability matrix, alternative problem formulations and specifications, and steady state conditions in cyclic networks. The manuscript also ponders on computation sequence in process flowsheet calculations and sparse matrix computation. The publication examines scheduling and design of batch plants, including scheduling of products and operations, characteristics of batch processes, branch and bound methods, and multipurpose batch plants. The text also elaborates on observability and redundancy and process data reconciliation and rectification. The manuscript is a valuable reference for chemical engineering students and readers interested in chemical processes and information flow.

Autoren/Hrsg.

Mah, Richard S. H.

Brenner, Howard

Acrivos, Andreas

Bailey, James E.

Inhaltsverzeichnis

1;Front Cover;1
2;Chemical Process Structures and Information Flows;4
3;Copyright Page;5
4;Table of Contents;8
5;Preface;14
6;CHAPTER 1. INTRODUCTION;18
6.1;1-1. PHENOMENON-ORIENTED AND SYSTEM-ORIENTED VIEW-POINTS;18
6.2;1 -2. THE WHOLE IS MORE THAN THE SUM OF ITS PARTS;19
6.3;1-3. OCCURRENCE OF STRUCTURAL PROBLEMS;22
6.4;1-4. INFORMATION FLOWS IN PROCESS DESIGN AND ANALYSIS;30
6.5;1-5. THE SCOPE OF THIS BOOK;31
6.6;REFERENCES;32
6.7;PROBLEMS;33
7;CHAPTER 2. GRAPHS AND DIGRAPHS;34
7.1;2-1. A GAME WITH A STRUCTURE;34
7.2;2-2. GRAPH-THEORETIC ENTITIES;37
7.3;2-3. TREES AND CIRCUITS;42
7.4;2-4. OPERATIONS ON GRAPHS;48
7.5;2-5. CUTSETS AND CONNECTIVITY;50
7.6;2-6. DIRECTED GRAPHS;55
7.7;2-7. MATRIX REPRESENTATION OF DIGRAPHS AND GRAPHS;59
7.8;2-8. REACHABILITY MATRIX;67
7.9;2-9. COMPUTATIONAL CONSIDERATIONS;69
7.10;NOTATION;79
7.11;REFERENCES;80
7.12;PROBLEMS;81
8;CHAPTER 3. PIPELINE NETWORKS;88
8.1;3-1. OPTIMAL DESIGN OF PRESSURE RELIEF PIPING NETWORKS;89
8.2;3-2. STEADY STATE CONDITIONS IN CYCLIC NETWORKS;103
8.3;3-3. ALTERNATIVE PROBLEM FORMULATIONS AND SPECIFICATIONS;115
8.4;3-4. INTERACTIVE SYNTHESIS OF DISTRIBUTION NETWORKS;125
8.5;NOTATION;134
8.6;REFERENCES;137
8.7;PROBLEMS;138
9;CHAPTER 4. COMPUTATION SEQUENCE IN PROCESS FLOWSHEET CALCULATIONS;142
9.1;4-1. INTRODUCTION;142
9.2;4-2. PARTITIONING;148
9.3;4-3. OUTPUT ASSIGNMENT;157
9.4;4-4. TEARING;168
9.5;4-5. COMPUTER PROGRAMS;189
9.6;NOTATION;196
9.7;REFERENCES;197
9.8;PROBLEMS;199
10;CHAPTER 5. SPARSE MATRIX COMPUTATION;202
10.1;5-1. INTRODUCTION;202
10.2;5-2. SOLUTION OF LINEAR ALGEBRAIC EQUATONS;203
10.3;5-3. PIVOTING STRATEGIES;217
10.4;5-4. DATA STORAGE AND PROCESSING;243
10.5;NOTATION;251
10.6;REFERENCES;252
10.7;PROBLEMS;254
11;CHAPTER 6. SCHEDULING OF BATCH PLANTS;258
11.1;6-1. CHARACTERISTICS OF BATCH PROCESSES;259
11.2;6-2. SCHEDULING OF PRODUCTS AND OPERATIONS;267
11.3;6-3. SIMPLE MODELS;269
11.4;6-4. RECURRENCE RELATIONS AND THE MILP APPROACH;277
11.5;6-5. BRANCH AND BOUND METHODS;281
11.6;6-6. HEURISTO PROCEDURES;290
11.7;6-7. OTHER MODELS OF CHEMICAL ENGINEERING INTEREST;296
11.8;6-8. CLOSING REMARKS;299
11.9;6-9. COMPUTER PROGRAM;300
11.10;NOTATION;313
11.11;REFERENCES;314
11.12;PROBLEMS;316
12;CHAPTER 7. DESIGN OF BATCH PLANTS;320
12.1;7-1. MULTIPRODUCT BATCH PLANTS;322
12.2;7-2. MULTIPURPOSE BATCH PLANTS;350
12.3;7-3. CLOSING REMARKS;358
12.4;NOTATION;361
12.5;REFERENCES;363
12.6;PROBLEMS;362
13;CHAPTER 8. OBSERVABILITY AND REDUNDANCY;366
13.1;8-1. INTRODUCTION;366
13.2;8-2. MULTICOMPONENT PROCESS NETWORKS;368
13.3;8-3. GENERALIZED PROCESS NETWORKS;393
13.4;NOTATION;398
13.5;REFERENCES;399
13.6;PROBLEMS;400
14;CHAPTER 9. PROCESS DATA RECONCILIATION AND RECTIFICATION;402
14.1;9-1. STEADY STATE RECONCILIATON;404
14.2;9-2. GROSS ERROR DETECTION AND IDENTIFICATON;427
14.3;9-3. CLOSING REMARKS;472
14.4;NOTATION;473
14.5;REFERENCES;477
14.6;Problems;479
15;APPENDIX A: GLOSSARY ON BATCH PROCESSES;484
16;APPENDIX B: ELEMENTS OF PROBABIUTY AND STATISTICS;488
17;CREDITS;508
18;INDEX;510