Download presentation

Presentation is loading. Please wait.

Published byAaliyah Engelby Modified about 1 year ago

1
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 Chapter 4: Steady-State Data Reconciliation for Bilinear Systems

2
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.1 Bilinear System In industrial plants, process streams often contain several species or components. Besides the stream flow rates measured, the compositions of some of the streams are also measured. If we wish to simultaneously reconcile flow and composition measurements, then component mass balances have to be included as constraints in the data reconciliation problem. Since these constraints contain the products of flow rate and composition variables, the term bilinear data reconciliation is consequently used. Another bilinear DR problem comes from reconciling flow rates and temperatures, in which the enthalpy of the stream is only a function of the temperature. In this case the energy balances are the constraints in the optimization.

3
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.1 Bilinear System To illustrate a typical bilinear data reconciliation problem, consider a simple example of reconciling flows and compositions of a binary distillation column which is commonly used in chemical industries, as shown in Figure 4.1. Figure 4.1: Schematic diagram of a binary distillation column Feed flow, F 1 Distillate flow, F 2 Bottom flow, F 3 x 1,1 x 1,2 x 2,1 x 2,2 x 3,1 x 3,2

4
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.1 Bilinear System The measurements of the feed, distillate, and bottom flows, along with their compositions are listed in Table 4.1. Table 4.1: Measurements of a binary distillation column VariablesRaw MeasurementStandard deviation F1F1 1095.4754.8 x 1,1 0.48220.0048 x 1,2 0.51700.0052 F2F2 478.4023.9 x 2,1 0.94100.0094 x 2,2 0.05010.0005 F3F3 488.2324.4 x 3,1 0.01970.0002 x 3,2 0.97480.0097 F1F1 F2F2 F3F3 x 1,1 x 1,2 x 2,1 x 2,2 x 3,1 x 3,2 Figure 4.1

5
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation In Table 4.1, the flow measurements are in kg/h, and the compositions are in mass fraction. At steady-state, the bilinear data reconciliation for the distillation column can be formulated as: Minimize(4.1) subject to where F is the vector of the measured flow rates,, V f and V x are the variance matrices corresponding to the measurements of the flow rates and the compositions, respectively, and x 1 and x 2 are the composition vectors

6
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation corresponding to components 1 and 2, and they are defined as: and are the vectors of the component flow rates, defined as:, 123123 Component12 Stream

7
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation and are the component mass balances of components 1 and 2, respectively. A is the incidence matrix,. are the normalization equations for the compositions in each flow where 1 denotes the vector,. The above formulation of the DR problem is in terms of flows rates and composition variables. Alternatively, we can also formulate it in terms of overall flow and component flow variables. In this case, the normalization equations can be written as: It should be noted that the constraints are linear in terms of the flow variables,.

8
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation Although, the constraints are linear in terms of the flow variables, the objective function (4.1) contains composition variables. In order to overcome this problem, the objective function is modified to minimize the sum of squares of the adjustments made to flows and component flow variables, by: minimizing (4.2) subject to where V is the variance matrix of the “measurements” having the form:

9
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation (4.3) In (4.3), is the variance matrix of the “measured” component flows. However, the elements in can’t be directly obtained from the raw measurements. The estimation of the variance of the component flows in (4.3) can be obtained by linearizing the term, F k x i,j, using a first order Taylor’s series: (4.4)

10
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation where the superscript, *, denotes the value of the measurements. The modified objective function (4.2), subject to the linear constraints in the flow variables, results in a linear DR problem. The estimates of the flows can be obtained analytically by Equation (2.7). Equation (2.7). After the data reconciliation of the flow estimates, the values of the compositions can be obtained by: (4.5)

11
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation For the illustrative example of the distillation column, the vector of the stream flows is given by: The “raw measurements” of the component flows are given by: Using Equation (4.4), the variance matrix is calculated as:

12
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation Write the linear constraint equations in Equation (4.2) in the matrix form:

13
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation Using Equation (2.7), the reconciled flows by MATLAB are:

14
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation It can be justified that the reconciled flows satisfy overall mass balances and component mass balances around the distillation column. Using Equation (4.5), the calculated compositions are: Note that the reconciled compositions satisfy the normalization equations. For comparison, the reconciled values along with their raw measurements are listed in Table 4.2.

15
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation Table 4.2: Results of bilinear data reconciliation for a binary distillation column. VariablesRawReconciledAdjustment, % F1F1 1095.471010.2-8.44 x 1,1 0.48220.4808-0.29 x 1,2 0.51700.51920.42 F2F2 478.40500.14.34 x 2,1 0.94100.95181.13 x 2,2 0.05010.0480-4.37 F3F3 488.23510.14.29 x 3,1 0.01970.01903.68 x 3,2 0.97480.98100.63 F1F1 F2F2 F3F3 x 1,1 x 1,2 x 2,1 x 2,2 x 3,1 x 3,2 Figure 4.1

16
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation To summarize, the constraints of a bilinear data reconciliation problem contain products of two variables (flow and composition, or flow and temperature). With all variables measured, the bilinear DR problem can be reduced to a linear DR problem by introducing the “measured” compound flows (component flows or energy flows). Often, there are some flows or compositions that are unmeasured in a process. The presence of unmeasured flow or composition variables introduces complications in the bilinear data reconciliation problem. Crowe (1989) proposed a method, a two-stage projection matrix method, to handle this problem. This method is summarized in the following steps:

17
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.2 Solution to Bilinear Data Reconciliation Step 1: Unmeasured composition variables are eliminated though Q-R factorization. Step 2: Reconcile flow and composition measurements and estimate unmeasured total flow rates. Step 3: Estimate unmeasured compositions. Because the model constraints in bilinear DR are intrinsically nonlinear, an alternative method to solve a bilinear data reconciliation problem is to use Nonlinear Programming (NLP) techniques that can give the estimates for the measured and unmeasured variables simultaneously. Details of nonlinear data reconciliation problems will be discussed in the next chapter.

18
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.3 Quiz Consider a heat-exchanger process as shown in Figure 4.2. All the flows and temperatures for the streams are measured, and the heat capacity, C p, for all streams is constant. Figure 4.2: A heat-exchanger process. Hot stream Hot stream returnCold stream Cold stream return F 1, T 1 F 2, T 2 F 3, T 3 F 4, T 4

19
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.3 Quiz Question 1: The mass balances used in the reconciliation of the eight raw measurements are (a) (b) (c) (d) F 1, T 1 F 2, T 2 F 3, T 3 F 4, T 4 Figure 4.2

20
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.3 Quiz Question 2: The heat balances used in the reconciliation of the eight raw measurements are (a) (b) (c) (d) either (a), (b), or (c) F 1, T 1 F 2, T 2 F 3, T 3 F 4, T 4 Figure 4.2

21
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.3 Quiz Question 3: The eight raw measurements and their standard deviations are listed as in the table. Calculate the reconciled values for each variable. F 1, T 1 F 2, T 2 F 3, T 3 F 4, T 4 Figure 4.2 VariablesRaw measurementsStandard deviation F1F1 150.89 t/h4.5 t/h T1T1 90.7 o C1.5 o C F2F2 153.66 t/h3.0 t/h T2T2 45.4 o C1.2 o C F3F3 460.6 t/h6.8 t/h T3T3 44.8 o C1.8 o C F4F4 450.0 t/h5.7 t/h T4T4 30.0 o C1.1 o C

22
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 4 Steady-State Data Reconciliation for Bilinear Systems 4.4 Suggested Readings Crowe, C.M. (1989). Reconciliation of process flow rates by matrix projection, II: Nonlinear case. AIChE J., 32, 616-623. Schraa, O.J. and Crowe, C. M. (1996). The numerical solution of bilinear data reconciliation problems using unconstrained optimization methods. Comp. and Chem. Engng, 20, Supp. A, S727. Narasimhan, S. and Jordache, C. (2000). “Data Reconciliation & Gross Error Detection, An Intelligent Use of Process Data”. Gulf Publishing, Houston, Texas.

23
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 Chapter 5: Steady-State Nonlinear Data Reconciliation

24
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.1 Formulation of Nonlinear Steady-State Data reconciliation In most cases, the steady-state equality constraints that are used to describe the physical system of a process are nonlinear. For example, in the bilinear case, the constraints of component balances are nonlinear. Moreover, if we take thermodynamic equilibrium relationships and complex correlations for thermodynamic and physical properties as constraints, then nonlinear data reconciliation techniques have to be used. If we impose bounds on the estimates, for example, the mass fraction of a component must be in the interval [0, 1]. This gives rise to inequality constraints in the data reconciliation problem which can only be solved using nonlinear data reconciliation techniques.

25
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.1 Formulation of Nonlinear Steady-State Data reconciliation The nonlinear data reconciliation problem can be formulated as an optimization problem by: minimizing (5.1) subject to where y and z are the vectors of measured and unmeasured variables, and f and g are the function vectors of equality and inequality model constraints including simple lower and upper bounds.

26
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization The method developed for solving the linear data reconciliation problem introduced in Chapters 2 and 3 can be extended to handle the nonlinear constraints. The idea is that the nonlinear constraints,, can be linearized using a first- order Taylor’s series around an estimation of the variables. The linearized system of the constraint equations obtained can be written in the form: (5.2) where

27
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization

28
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization (5.5) and are the vectors of estimates corresponding to measured and unmeasured variables. It should be noted that, in Equation 5.3 and Equation 5.4, M is the number of measured variables, N is the number of unmeasured variables, C is the total number of equality constraints, and i is the i th iteration during the successive linearization. The matrices A y and A z are also known as Jacobian matrices.

29
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization In general, the raw measurements are used as initial estimates for the measured variables in the first iteration. At each iteration, the estimates of process variables are obtained by: minimizing (5.6) subject to Following the procedures to solve the linear DR problems described in Chapter 3, the unmeasured variables,, in Equation 5.6 are first eliminated using a projection matrix via Q-R factorization of A z. Then, the subset of constraint equations contains only measured variables, and the problem becomes:

30
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization minimizing (5.7) subject to where Q 2 T is the projection matrix. The solution to (5.7) can be given as: (5.8) and the solution to the unmeasured variables can be given as: (5.9) In (5.7), (5.8), and (5.9), the matrices Q 1, Q 2, R 1, and R 2 are the corresponding submatrices of the Q-R factorization of A z.

31
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization When the new estimates for measured and unmeasured variables are obtained, the next iteration begins. The functions and the Jacobian matrices, A y and A z are reevaluated. Equation 5.6 is re-formulated, and solved with Equations 5.8 and 5.9. The iterations continue until satisfy some small tolerance criteria. In order to demonstrate the strategies for solving the nonlinear data reconciliation problem, let’s take the distillation column discussed in Chapter 4 as an illustrative example.

32
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization Suppose the compositions of component 2 in the distillate and bottom product streams, x 2,2 and x 3,2, are unmeasured. For convenience, the distillation column is reproduced in Figure 5.1. Figure 5.1: Distillation column with unmeasured variables Feed flow, F 1 Distillate flow, F 2 Bottom flow, F 3 x 1,1 x 1,2 x 2,1 x 2,2 x 3,1 x 3,2

33
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization For the distillation column, the vectors of measured and unmeasured variable are defined as: The data reconciliation problem for this column, then, can be formulated as:

34
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization minimizing (5.10) subject to For this problem, using Equations 5.3 and 5.4, the Jacobian matrices corresponding to the measured and unmeasured variables can be evaluated as: Component balances Normalization equations F1F1 F2F2 F3F3 x 1,1 x 1,2 x 2,1 x 2,2 x 3,1 x 3,2 Figure 5.1

35
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization The functions of the constraint equations can be given as: (5.11) (5.12)

36
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization In order to bring the measurements of flows and compositions into the same order of magnitude for the DR, the flow measurements are scaled down by dividing by 1000. Referring to Table 4.1, the initial estimates for the reconciled values are given as:Table 4.1 VariablesRaw Measurement Standard deviation F1F1 1095.4754.8 x 1,1 0.48220.0048 x 1,2 0.51700.0052 F2F2 478.4023.9 x 2,1 0.94100.0094 x 2,2 unmeasuredN/A F3F3 488.2324.4 x 3,1 0.01970.0002 x 3,2 unmeasuredN/A Table 4.1

37
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization Iteration 1: With these initial values, using Equation 5.11, the linearized matrices can be given as:

38
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization Using Equation 5.12, the values of the constraint functions are evaluated as:. Using Equation 5.5, the right hand vector of the linearized equations is evaluated as:.

39
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization The results of the Q-R factorization of the matrix are Q1Q1 Q2Q2 R1R1 0

40
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization Note that the matrix R only contains R 1, implying that all the unmeasured variables are observable. Applying Equation 5.8, the estimated measured variables for the first iteration are: Applying Equation 5.9, the estimates for the unmeasured variables for the first iteration are:

41
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization Iteration 2: Repeating the procedure above using and as the new initial values results in: Note that there are only very small changes for the estimates in the second iteration.

42
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization Iteration 3 converges the estimates at the values shown in Table 5.1. Table 5.1: Results of nonlinear DR for a distillation column VariablesRawReconciled (Estimated) F1F1 1095.471002.4 x 1,1 0.4822 x 1,2 0.51700.5178 F2F2 478.40502.6 x 2,1 0.94100.9421 x 2,2 Unmeasured0.0579 F3F3 488.23499.7 x 3,1 0.0197 x 3,2 Unmeasured0.9803 F1F1 F2F2 F3F3 x 1,1 x 1,2 x 2,1 x 2,2 x 3,1 x 3,2 Figure 5.1

43
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization The MATLAB code used for the successive linearization method is listed below.MATLAB ********************************************************* f=[0;0;0;0;0]; Q1=[0 0;0 0;0 0;0 0;0 0]; Q2=[0 0 0;0 0 0;0 0 0;0 0 0;0 0 0]; V=[0 0 0 0 0 0 0;0 0 0 0 0 0 0;0 0 0 0 0 0 0;0 0 0 0 0 0 0;0 0 0 0 0 0 0;0 0 0 0 0 0 0;0 0 0 0 0 0 0]; V(1,1)=0.0548^2; V(2,2)=0.0239^2; V(3,3)=0.0244^2;

44
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization V(4,4)=0.0048^2; V(5,5)=0.0052^2; V(6,6)=0.0094^2; V(7,7)=0.0002^2; y=[1.09547;0.4784;0.48823;0.4822;0.517;0.941;0.0 197]; z=[0.05;0.98]; flag=1; while flag>0, SSEy=0; SSEz=0; Ay=[y(4) -y(6) -y(7) y(1) 0 -y(2) -y(3);y(5) - z(1) -z(2) 0 y(1) 0 0;0 0 0 1 1 0 0;0 0 0 0 0 1 0;0 0 0 0 0 0 1];

45
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization Az=[0 0;-y(2) -y(3);0 0;1 0;0 1]; f(1)=y(1)*y(4)-y(2)*y(6)-y(3)*y(7); f(2)=y(1)*y(5)-y(2)*z(1)-y(3)*z(2); f(3)=y(4)+y(5)-1; f(4)=y(6)+z(1)-1; f(5)=y(7)+z(2)-1; b=Ay*y+Az*z-f; [Q,R]=qr(Az); for I=1:5, Q1(I,1)=Q(I,1); Q1(I,2)=Q(I,2); end; for I=1:5, for J=3:5,

46
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization Q2(I,J-2)=Q(I,J); end; for I=1:2, for J=1:2, R1(I,J)=R(I,J); end; yhat=y-V*(Q2'*Ay)'*inv((Q2'*Ay)*V*(Q2'*Ay)') *(Q2'*Ay*y-Q2'*b); zhat=inv(R1)*Q1'*b-inv(R1)*Q1'*Ay*yhat; yhat zhat for I=1:7,

47
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.2 Successive Linearization SSEy=SSEy+(y(I)-yhat(I))^2; end; for I=1:2, SSEz=SSEz+(z(I)-zhat(I))^2; end; if and(SSEy<1.0e-6,SSEz<1.0e-6), flag=-1; end; y=yhat; z=zhat; end **********************************************

48
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.3 Nonlinear Program The method of successive linearization introduced in Section 5.2 has the advantage of relative simplicity and fast calculation. However, variable bounds can’t be handled with this method. Nonlinear programming (NLP) algorithms allow for a general nonlinear objective function, not just a weighted least square objective function. They can explicitly handle nonlinear constraints, inequality constraints, and variable bounds. Typical algorithms of NLP include sequential quadratic programming (SQP) techniques, such as NPSOL code, and generalized reduced gradient (GRG) methods, such as GRG2 code.NPSOLGRG2

49
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.3 Nonlinear Program Nonlinear programming codes are now commercially available, and they have proved to be numerically robust and reliable for large-scale industrial problems. The disadvantages of these NLP algorithms is the large amount of computation time required relative to the successive linearization algorithm. However, their range of application is wider, and they are able to manage inequality constraints and bounds on variables.

50
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.4 Quiz Question 1: The constraints of a nonlinear data reconciliation problem can contain (a) material balances. (b) energy balances. (c) physical property correlations. (d) inequality constraints. Question 2: The method of successive linearization (a) linearizes the objective function. (b) linearizes the equality constraints. (c) linearizes the inequality constraints. (d) has less computational time.

51
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.4 Quiz Question 3: Nonlinear data reconciliation problems which contain inequality constraints can be solved by (a) using the successive linearization method. (b) using sequential quadratic programming. (c) using the generalized reduced gradient method. (d) using other nonlinear programming techniques. Question 4: The estimates for the measured and unmeasured variables in a nonlinear DR problem are (a) definitely biased. (b) definitely unbiased. (c) perhaps biased. (d) perhaps unbiased.

52
Basic Concepts in Data Reconciliation © North Carolina State University, USA © University of Ottawa, Canada, 2003 CHAPTER 5 Steady-State Nonlinear Data Reconciliation 5.5 Suggested Readings Edgar, T.F.; Himmelblau D.M. and Lasdon, L. S. (2001). “ Optimization of Chemical Processes ”, 2 nd Ed., McGraw Hill, New York. Lasdon, LS. And Waren, A.D. (1978). Generalized reduced gradient software for linearly and nonlinearly constrained problems, in Design and Implementation of Optimization Software, Sijthoff and Noordhoff, Holland: H. Greenberg, Ed.. Romagnoli, J.A. and Sanchez, M.C. (2000). “Data Processing and Reconciliation for Chemical Process Operations”. Academic Press, San Diego. Vasantharajan, S. and Biegler, L.T. (1988). Large-scale decomposition for successive quadratic programming, Computers Chem. Engng., 12, 1087-1101.

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google