Efficient Moving Horizon Estimation of DAE Systems. John D. Hedengren Thomas F. Edgar The University of Texas at Austin TWMCC Feb 7, 2005

Size: px
Start display at page:

Download "Efficient Moving Horizon Estimation of DAE Systems. John D. Hedengren Thomas F. Edgar The University of Texas at Austin TWMCC Feb 7, 2005"

Transcription

1 Efficient Moving Horizon Estimation of DAE Systems John D. Hedengren Thomas F. Edgar The University of Teas at Austin TWMCC Feb 7, 25

2 Outline Introduction: Moving Horizon Estimation (MHE) Eplicit Solution to the MHE Problem Observability of Inde- DAE Systems Flash Column Eample Conclusions and Future Work

3 Introduction Eplicit MHE of nonlinear systems (Ramamurthi, Sistu, and Bequette, 993) MHE definitively shown to outperform EKF (Haseltine and Rawlings, 24). Price of improvement is greater computational epense of MHE. This presentation incorporates the recent MHE advances in an eplicit solution form Motivation: State estimation of large-scale, nonlinear DAE systems Strategy: Combine elements of eisting technologies in new ways to solve large-scale problems Everything has been thought of before, but the problem is to think of it again. Goethe (via Jim Rawlings/via Tom Badgwell)

4 Moving Horizon Estimation Nonlinear DAE model (implicit form) = f u ( ɺ,, ) DAE model - implicit form y = g ( ) System measurements Discretized linear time-varying form A B u + = + k k k k k = + y C D u k k k k k y model, meas, model =, meas =, = horizon length Y Y n y y model, n meas, n y MHE optimization (least squares approach) T minimize ( Y Y ) Q( Y Y ) meas model meas model subject to the model equations

5 Eplicit MHE (Previous Work) Eplicit solution to the least squares MHE problem (Ramamurthi, Sistu, and Bequette, 993 (Bequette UT PhD grad 988, now at RPI) ω Y k k j = C k k A ψ = C j k k Ai k B u D u j k j k + j k k j= j= i= model ω = + ψ [ ] T T ˆ = ω Q ω ω Q Y ψ y y meas Forgetting factor (α) adds infinite horizon approimation by incorporating previous state estimates (Haseltine and Rawlings, 24) ˆ model, prev, ˆ =, =, = horizon length model prev X X n minimize ˆ model, n prev, n T T ( Y Y ) Q( Y Y ) + ˆ ˆ α meas model meas model ( X X prev model ) ( X X prev model ) subject to the model equations

6 Eample : Eplicit MHE Solution (Unconstrained, Linear) Discrete/State Space Form G s ( ) = s 2 + 2s k + = + k k u [ ] y = + v k k k Sampling time:. sec ν k (output noise) is normally distributed with µ = and σ =. Initial conditions: Actual = [ ] T Predicted = [ ] T MHE values: forgetting factor α =.5 (weighting on,est )

7 Eample : Results Actual Measured (2nd state only) Eplicit MHE MHE time

8 MHE for Real Systems Upper and lower bounds that represent physical limits on state variables (e.g., mole fractions are between and ) Variable measurement frequencies (e.g., temperatures at sample/sec and concentrations at sample/minute) Corrupt or missing data Large-scale, nonlinear, rigorous DAE models Solve MHE subject to real-time constraints The new approach in this presentation: Eplicitly solves the least squares MHE problem subject to upper and lower bounds on the states Is able to meet real-time constraints for large-scale problems Is fleible to handle variable measurement frequencies and missing data

9 Incorporate Constraints (Upper and Lower Bounds) Iteratively add/remove measurements that add constraint information Uses strategies from the active set and penalty methods from nonlinear programming Active set strategy optimizer only deals with active inequality constraints ( = a or = b) and ignores inactive constraints (a < < b) Penalty method cost added to the objective function when constraints are violated T minimize ( Y Y ) Q( Y Y ) subject to the model equations subject to a b meas model meas model

10 Define Adding/Removing Constraints For active constraints the Lagrange multiplier (shadow price) (λ lower = Q (a - Y model ) or λ upper = Q (Y model - b)) If λ <, remove constraint from the active set For inactive constraints If > b add upper limit constraint with a measurement (y meas = b) If < a add lower limit constraint with a measurement (y meas = a) Pseudo-code: Do Compute Eplicit MHE If λ < remove constraint If > b add measurement y meas =b If < a add measurement y meas =a Loop Until No Active Set Change

11 Constrained Eplicit MHE (Other Enhancements) Forgetting factor (α) adds infinite horizon approimation by incorporating previous state estimates (Haseltine and Rawlings, 24) ˆ model, prev, ˆ =, =, = horizon length model prev X X n minimize ˆ model, n prev, n T T ( Y Y ) Q( Y Y ) + ˆ ˆ α meas model meas model ( X X prev model ) ( X X prev model ) subject to the model equations Eplicit solution (new) T ( ) Q C Q C ω =, k k y, k k k k j = k A ψ = j k Ai k B u D u j k j k + j k k j= j= i= ( ) ˆ ( meas prev ) T T T T ˆ Q I Q C Y X ω α ω ω ψ αω ψ = + +

12 Constrained Eplicit MHE (Other Enhancements) Augment system with input disturbance variables (d) (Muske and Badgwell, 22) A B B = + d d k + k k k y k = [ C ] k d k u k Estimate input disturbances and states in one eplicit step instead of two iterative steps as in Ramamurthi, Sistu, and Bequette (993)

13 Eample 2: (Constrained Version of Eample ).5 Upper bound: <.2 Lower Physical bound: constraint: >. () <.2 Actual Measured Unconstrained MHE Constrained MHE Upper bound: 2 < Lower bound: 2 > d time

14 Eample 2: Final Solution Actual.5 Note is now below the upper bound Measured CE MHE MHE d time

15 .4.2 Horizon = 5, Iteration Actual Measured CE MHE MHE time

16 .4.2 Horizon = 5, Iteration 2 Actual Measured CE MHE MHE time

17 .4.2 Horizon = 5, Iteration 3 Actual Measured CE MHE MHE time

18 .4.2 Horizon = 5, Iteration 4 Actual Measured CE MHE MHE time

19 .4.2 Horizon = 5, Iteration 5 Actual Measured CE MHE MHE time

20 Constrained Constrained Eplicit MHE Properties No optimizers involved Eplicit solution at each iteration = fast computation, reliable solution Incorporate constraints by iteratively adding or removing measurements based on an active set strategy Constraints are restricted to upper and lower variable bounds Computational costs for the previous eample (horizon=5) Eplicit MHE (6,83 flops) MHE (22,48,83 flops)

21 Local Observability of Inde- DAE States Recall for discrete linear time-invariant (LTI) ODE models: The system is observable iff Γ o [A,C] (observability matri) is full rank For inde- DAE models The system is observable if every dynamic mode in A is connected to the output through C A A B ɺ 2 = + A A B y C C Du = [ 2 ] + 2 u Semi-eplicit DAE form (linearized)

22 Local Observability of Inde- DAE States Define how the dynamic modes (differential states) connect to the output (measurements) ɶ A = e ( A A2 A22 A2 ) t = ɶ C C C A A ( A C) ɶ System is observable if and only if, is full rank Γ ɶ o

23 Eample 3: Composition Estimation Eample Can the composition of a hydrocarbon miture be reconstructed with temperature and flow rate measurements of a flash column? Measure feed and flash temperature Measure vapor and liquid flow rates Rigorous nonlinear flash column model 7 state model (reduced from 57 states) 5 differential equations / 2 algebraic equations Vapor Hydrocarbon miture with unknown composition C 4 H C 5 H 2 C 6 H 4 C 7 H 6 C 8 H 8 Flash column Liquid

24 Object Oriented Modeling Plant-wide dynamic models Advanced Models distillation columns, etc. Variables. Name 2. Value 3. d(value)/dt 4. Default Scaling 5. Upper limit 6. Lower limit 7. Etc Basic Models vessel, splitter, mier, compressor, flash column, distillation stage Vessel Accumulation Mier Stream Equations. Name 2. Residual Value 3. Default Scaling 4. Variable Sparsity 5. Analytic Derivatives 6. Etc Variables - pressure, temperature, mole fractions, mass fractions, concentrations, moles, mass, volume, enthalpy Fundamental dynamic equations Thermo-physical properties database (DIPPR)

25 Model Reduction: Eample 3 Flowsheet Feed Vessel Flash Column Streams (6) pressure (), temperature (), mole fractions (5), mass fractions (5), concentrations (5), molar flow rate (), mass flow rate (), volumetric flow rate (), density (), enthalpy () Accumulations () pressure (), temperature (), mole fractions (5), mass fractions (5), concentrations (5), moles (), mass (), molar volume (), density (), enthalpy () Additional Vessel Variables vessel volume (), heat added () Additional Flash Column Variables heat added () Total variables/equations: 57

26 Model Reduction: Eample 3 Lower triangular block diagonalization of the sparsity pattern reveals variables that can be removed from the implicit set eplicit transformation of equations (reduction of 9 variables) Merge stream objects instead of defining connection equations (reduction of 2 variables) Specify feed stream, vessel volume, heat addition to the vessel, and heat addition to the flash column (specify 9 variables) Resulting model size: 7 variables (5 differential/2 algebraic)

27 Composition Estimation Eample Measurements every sec T tank σ noise =.5 dn/dt vapor σ noise =.2 T flash σ noise =.5 dn/dt liquid σ noise =.2 Estimation parameters α=.5 (forgetting factor weight only on ) Epanding horizon (up to 9 as new measurements are available) Initial state estimates all have a +. absolute error Relative initial state errors vary (5% for mole fractions) (.3% for temperatures) Observability criteria Dynamic modes (5) States: Temperature (), Mole Fractions (4) Observability matri rank (3) Conclusion: Not fully observable, but some information may be reconstructed to give estimates that are better than the initial guesses

28 Composition Estimation Measurements p u ld o H Temperature (K) r o p a V h s la F Flow Rate (mol/sec) Actual Measured Estimated h s la F Time (sec) id u iq L h s la F Time (sec)

29 .3 H.2 C 4 H 2 C 5 H 4 C 6 H 6 C 7 H 8 C 8 Estimated Actual Partially Observable Compositions Time (sec) The results are better than the initial estimates but, as indicated by the rank deficiency of the observability matri (3/5), the system is not fully observable all states deviate from correct values, some more than others

30 Constraints and Observability Suppose you know that the mole fraction of C 7 H 6 should not be above.22 Incorporate this knowledge into the state estimation by adding a constraint to the least squares problem Because the constraint is active, the system observability (detectability) is improved

31 Constraint Improves System Observability.3 H.2 C 4 H 2 C 5 H 4 C 6 H 6 C 7 H 8 C Estimated Constraint Actual λ= Time (sec) The state estimates are improved, but there is still some deviation from the correct values because the observability matri is still not full rank (4/5)

32 Horizon Length Scaling (7 State Model) 2 Linear Constrained Eplicit MHE Nonlinear Constrained Eplicit MHE ) 5 ( s p l o f : R 2 = : R 2 = horizon length

33 Model Size Scaling (Horizon=5) 9 8 Linear Constrained Eplicit MHE Nonlinear Constrained Eplicit MHE 7 ) 5 ( s p o l f model size

34 Conclusions New solution approach for MHE problems with upper and lower bounds on the variables Applicable for state estimation of any process described by an ODE or inde- DAE Constrained Eplicit MHE scaling to large scale problems Nonlinear model O(n H2 ) with increasing horizon length O(n v2 ) with number of variables Linear model O(n H ) with increasing horizon length O(n v2 ) with number of variables Eample demonstrates >, speed up over MHE solved with optimization software Future work Simultaneous state and parameter estimation

How to simulate in Simulink: DAE, DAE-EKF, MPC & MHE

How to simulate in Simulink: DAE, DAE-EKF, MPC & MHE How to simulate in Simulink: DAE, DAE-EKF, MPC & MHE Tamal Das PhD Candidate IKP, NTNU 24th May 2017 Outline 1 Differential algebraic equations (DAE) 2 Extended Kalman filter (EKF) for DAE 3 Moving horizon

More information

J. Reyes, A. Gómez & A. Marcilla Dpto. Ingeniería Química, Universidad de Alicante, Apdo. de Correos nº 99, Alicante 03080, España.

J. Reyes, A. Gómez & A. Marcilla Dpto. Ingeniería Química, Universidad de Alicante, Apdo. de Correos nº 99, Alicante 03080, España. MULTICOMPONENT RECTIFICATION: A NEW METHOD OF CALCULATION J. Reyes, A. Gómez & A. Marcilla Dpto. Ingeniería Química, Universidad de Alicante, Apdo. de Correos nº 99, Alicante 03080, España. This poster

More information

In Situ Adaptive Tabulation for Real-Time Control

In Situ Adaptive Tabulation for Real-Time Control In Situ Adaptive Tabulation for Real-Time Control J. D. Hedengren T. F. Edgar The University of Teas at Austin 2004 American Control Conference Boston, MA Outline Model reduction and computational reduction

More information

ROBUST CONSTRAINED ESTIMATION VIA UNSCENTED TRANSFORMATION. Pramod Vachhani a, Shankar Narasimhan b and Raghunathan Rengaswamy a 1

ROBUST CONSTRAINED ESTIMATION VIA UNSCENTED TRANSFORMATION. Pramod Vachhani a, Shankar Narasimhan b and Raghunathan Rengaswamy a 1 ROUST CONSTRINED ESTIMTION VI UNSCENTED TRNSFORMTION Pramod Vachhani a, Shankar Narasimhan b and Raghunathan Rengaswamy a a Department of Chemical Engineering, Clarkson University, Potsdam, NY -3699, US.

More information

Research Article On the Numerical Solution of Differential-Algebraic Equations with Hessenberg Index-3

Research Article On the Numerical Solution of Differential-Algebraic Equations with Hessenberg Index-3 Discrete Dynamics in Nature and Society Volume, Article ID 474, pages doi:.55//474 Research Article On the Numerical Solution of Differential-Algebraic Equations with Hessenberg Inde- Melike Karta and

More information

Demonstrate solution methods for systems of linear equations. Show that a system of equations can be represented in matrix-vector form.

Demonstrate solution methods for systems of linear equations. Show that a system of equations can be represented in matrix-vector form. Chapter Linear lgebra Objective Demonstrate solution methods for sstems of linear equations. Show that a sstem of equations can be represented in matri-vector form. 4 Flowrates in kmol/hr Figure.: Two

More information

More on Lagrange multipliers

More on Lagrange multipliers More on Lagrange multipliers CE 377K April 21, 2015 REVIEW The standard form for a nonlinear optimization problem is min x f (x) s.t. g 1 (x) 0. g l (x) 0 h 1 (x) = 0. h m (x) = 0 The objective function

More information

Least Squares with Examples in Signal Processing 1. 2 Overdetermined equations. 1 Notation. The sum of squares of x is denoted by x 2 2, i.e.

Least Squares with Examples in Signal Processing 1. 2 Overdetermined equations. 1 Notation. The sum of squares of x is denoted by x 2 2, i.e. Least Squares with Eamples in Signal Processing Ivan Selesnick March 7, 3 NYU-Poly These notes address (approimate) solutions to linear equations by least squares We deal with the easy case wherein the

More information

Statistical Geometry Processing Winter Semester 2011/2012

Statistical Geometry Processing Winter Semester 2011/2012 Statistical Geometry Processing Winter Semester 2011/2012 Linear Algebra, Function Spaces & Inverse Problems Vector and Function Spaces 3 Vectors vectors are arrows in space classically: 2 or 3 dim. Euclidian

More information

Lecture 3: Latent Variables Models and Learning with the EM Algorithm. Sam Roweis. Tuesday July25, 2006 Machine Learning Summer School, Taiwan

Lecture 3: Latent Variables Models and Learning with the EM Algorithm. Sam Roweis. Tuesday July25, 2006 Machine Learning Summer School, Taiwan Lecture 3: Latent Variables Models and Learning with the EM Algorithm Sam Roweis Tuesday July25, 2006 Machine Learning Summer School, Taiwan Latent Variable Models What to do when a variable z is always

More information

Linear Equations in Linear Algebra

Linear Equations in Linear Algebra 1 Linear Equations in Linear Algebra 1.1 SYSTEMS OF LINEAR EQUATIONS LINEAR EQUATION,, 1 n A linear equation in the variables equation that can be written in the form a a a b 1 1 2 2 n n a a is an where

More information

AUTOMATIC CONTROL. Andrea M. Zanchettin, PhD Spring Semester, Introduction to Automatic Control & Linear systems (time domain)

AUTOMATIC CONTROL. Andrea M. Zanchettin, PhD Spring Semester, Introduction to Automatic Control & Linear systems (time domain) 1 AUTOMATIC CONTROL Andrea M. Zanchettin, PhD Spring Semester, 2018 Introduction to Automatic Control & Linear systems (time domain) 2 What is automatic control? From Wikipedia Control theory is an interdisciplinary

More information

Basic Concepts in Data Reconciliation. Chapter 6: Steady-State Data Reconciliation with Model Uncertainties

Basic Concepts in Data Reconciliation. Chapter 6: Steady-State Data Reconciliation with Model Uncertainties Chapter 6: Steady-State Data with Model Uncertainties CHAPTER 6 Steady-State Data with Model Uncertainties 6.1 Models with Uncertainties In the previous chapters, the models employed in the DR were considered

More information

Linear, threshold units. Linear Discriminant Functions and Support Vector Machines. Biometrics CSE 190 Lecture 11. X i : inputs W i : weights

Linear, threshold units. Linear Discriminant Functions and Support Vector Machines. Biometrics CSE 190 Lecture 11. X i : inputs W i : weights Linear Discriminant Functions and Support Vector Machines Linear, threshold units CSE19, Winter 11 Biometrics CSE 19 Lecture 11 1 X i : inputs W i : weights θ : threshold 3 4 5 1 6 7 Courtesy of University

More information

Constrained State Estimation Using the Unscented Kalman Filter

Constrained State Estimation Using the Unscented Kalman Filter 16th Mediterranean Conference on Control and Automation Congress Centre, Ajaccio, France June 25-27, 28 Constrained State Estimation Using the Unscented Kalman Filter Rambabu Kandepu, Lars Imsland and

More information

Lecture 7: Weak Duality

Lecture 7: Weak Duality EE 227A: Conve Optimization and Applications February 7, 2012 Lecture 7: Weak Duality Lecturer: Laurent El Ghaoui 7.1 Lagrange Dual problem 7.1.1 Primal problem In this section, we consider a possibly

More information

Suboptimal Open-loop Control Using POD. Stefan Volkwein

Suboptimal Open-loop Control Using POD. Stefan Volkwein Institute for Mathematics and Scientific Computing University of Graz, Austria PhD program in Mathematics for Technology Catania, May 22, 2007 Motivation Optimal control of evolution problems: min J(y,

More information

Newton-Type Algorithms for Nonlinear Constrained Optimization

Newton-Type Algorithms for Nonlinear Constrained Optimization Newton-Type Algorithms for Nonlinear Constrained Optimization Angelika Altmann-Dieses Faculty of Management Science and Engineering Karlsruhe University of Applied Sciences Moritz Diehl Department of Microsystems

More information

Introduction to Model Predictive Control. Dipartimento di Elettronica e Informazione

Introduction to Model Predictive Control. Dipartimento di Elettronica e Informazione Introduction to Model Predictive Control Riccardo Scattolini Riccardo Scattolini Dipartimento di Elettronica e Informazione Finite horizon optimal control 2 Consider the system At time k we want to compute

More information

Nonlinear Stochastic Modeling and State Estimation of Weakly Observable Systems: Application to Industrial Polymerization Processes

Nonlinear Stochastic Modeling and State Estimation of Weakly Observable Systems: Application to Industrial Polymerization Processes Nonlinear Stochastic Modeling and State Estimation of Weakly Observable Systems: Application to Industrial Polymerization Processes Fernando V. Lima, James B. Rawlings and Tyler A. Soderstrom Department

More information

1. Sets A set is any collection of elements. Examples: - the set of even numbers between zero and the set of colors on the national flag.

1. Sets A set is any collection of elements. Examples: - the set of even numbers between zero and the set of colors on the national flag. San Francisco State University Math Review Notes Michael Bar Sets A set is any collection of elements Eamples: a A {,,4,6,8,} - the set of even numbers between zero and b B { red, white, bule} - the set

More information

Measurement-based Run-to-run Optimization of a Batch Reaction-distillation System

Measurement-based Run-to-run Optimization of a Batch Reaction-distillation System Measurement-based Run-to-run Optimization of a Batch Reaction-distillation System A. Marchetti a, B. Srinivasan a, D. Bonvin a*, S. Elgue b, L. Prat b and M. Cabassud b a Laboratoire d Automatique Ecole

More information

State Estimation of Linear and Nonlinear Dynamic Systems

State Estimation of Linear and Nonlinear Dynamic Systems State Estimation of Linear and Nonlinear Dynamic Systems Part IV: Nonlinear Systems: Moving Horizon Estimation (MHE) and Particle Filtering (PF) James B. Rawlings and Fernando V. Lima Department of Chemical

More information

AMS526: Numerical Analysis I (Numerical Linear Algebra)

AMS526: Numerical Analysis I (Numerical Linear Algebra) AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 7: More on Householder Reflectors; Least Squares Problems Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 15 Outline

More information

Theory in Model Predictive Control :" Constraint Satisfaction and Stability!

Theory in Model Predictive Control : Constraint Satisfaction and Stability! Theory in Model Predictive Control :" Constraint Satisfaction and Stability Colin Jones, Melanie Zeilinger Automatic Control Laboratory, EPFL Example: Cessna Citation Aircraft Linearized continuous-time

More information

Here represents the impulse (or delta) function. is an diagonal matrix of intensities, and is an diagonal matrix of intensities.

Here represents the impulse (or delta) function. is an diagonal matrix of intensities, and is an diagonal matrix of intensities. 19 KALMAN FILTER 19.1 Introduction In the previous section, we derived the linear quadratic regulator as an optimal solution for the fullstate feedback control problem. The inherent assumption was that

More information

4 Inverse function theorem

4 Inverse function theorem Tel Aviv University, 2014/15 Analysis-III,IV 71 4 Inverse function theorem 4a What is the problem................ 71 4b Simple observations before the theorem..... 72 4c The theorem.....................

More information

Computational Optimization. Constrained Optimization Part 2

Computational Optimization. Constrained Optimization Part 2 Computational Optimization Constrained Optimization Part Optimality Conditions Unconstrained Case X* is global min Conve f X* is local min SOSC f ( *) = SONC Easiest Problem Linear equality constraints

More information

Lecture 23: November 19

Lecture 23: November 19 10-725/36-725: Conve Optimization Fall 2018 Lecturer: Ryan Tibshirani Lecture 23: November 19 Scribes: Charvi Rastogi, George Stoica, Shuo Li Charvi Rastogi: 23.1-23.4.2, George Stoica: 23.4.3-23.8, Shuo

More information

1 Computing with constraints

1 Computing with constraints Notes for 2017-04-26 1 Computing with constraints Recall that our basic problem is minimize φ(x) s.t. x Ω where the feasible set Ω is defined by equality and inequality conditions Ω = {x R n : c i (x)

More information

Nonlinear Model Predictive Control Tools (NMPC Tools)

Nonlinear Model Predictive Control Tools (NMPC Tools) Nonlinear Model Predictive Control Tools (NMPC Tools) Rishi Amrit, James B. Rawlings April 5, 2008 1 Formulation We consider a control system composed of three parts([2]). Estimator Target calculator Regulator

More information

Convex Optimization Overview (cnt d)

Convex Optimization Overview (cnt d) Conve Optimization Overview (cnt d) Chuong B. Do November 29, 2009 During last week s section, we began our study of conve optimization, the study of mathematical optimization problems of the form, minimize

More information

MATH2070 Optimisation

MATH2070 Optimisation MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints

More information

CS281 Section 4: Factor Analysis and PCA

CS281 Section 4: Factor Analysis and PCA CS81 Section 4: Factor Analysis and PCA Scott Linderman At this point we have seen a variety of machine learning models, with a particular emphasis on models for supervised learning. In particular, we

More information

du(l) 5 dl = U(0) = 1 and 1.) Substitute for U an unspecified trial function into governing equation, i.e. dx + = =

du(l) 5 dl = U(0) = 1 and 1.) Substitute for U an unspecified trial function into governing equation, i.e. dx + = = Consider an ODE of te form: Finite Element Metod du fu g d + wit te following Boundary Conditions: U(0) and du(l) 5 dl.) Substitute for U an unspecified trial function into governing equation, i.e. ^ U

More information

10-725/36-725: Convex Optimization Spring Lecture 21: April 6

10-725/36-725: Convex Optimization Spring Lecture 21: April 6 10-725/36-725: Conve Optimization Spring 2015 Lecturer: Ryan Tibshirani Lecture 21: April 6 Scribes: Chiqun Zhang, Hanqi Cheng, Waleed Ammar Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer:

More information

Course on Model Predictive Control Part II Linear MPC design

Course on Model Predictive Control Part II Linear MPC design Course on Model Predictive Control Part II Linear MPC design Gabriele Pannocchia Department of Chemical Engineering, University of Pisa, Italy Email: g.pannocchia@diccism.unipi.it Facoltà di Ingegneria,

More information

Maximum Theorem, Implicit Function Theorem and Envelope Theorem

Maximum Theorem, Implicit Function Theorem and Envelope Theorem Maximum Theorem, Implicit Function Theorem and Envelope Theorem Ping Yu Department of Economics University of Hong Kong Ping Yu (HKU) MIFE 1 / 25 1 The Maximum Theorem 2 The Implicit Function Theorem 3

More information

Chapter 3 Numerical Methods

Chapter 3 Numerical Methods Chapter 3 Numerical Methods Part 2 3.2 Systems of Equations 3.3 Nonlinear and Constrained Optimization 1 Outline 3.2 Systems of Equations 3.3 Nonlinear and Constrained Optimization Summary 2 Outline 3.2

More information

Optimizing Control of Hot Blast Stoves in Staggered Parallel Operation

Optimizing Control of Hot Blast Stoves in Staggered Parallel Operation Proceedings of the 17th World Congress The International Federation of Automatic Control Optimizing Control of Hot Blast Stoves in Staggered Parallel Operation Akın Şahin and Manfred Morari Automatic Control

More information

Functions with orthogonal Hessian

Functions with orthogonal Hessian Functions with orthogonal Hessian B. Dacorogna P. Marcellini E. Paolini Abstract A Dirichlet problem for orthogonal Hessians in two dimensions is eplicitly solved, by characterizing all piecewise C 2 functions

More information

Definition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.

Definition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality. 8 Inequalities Concepts: Equivalent Inequalities Linear and Nonlinear Inequalities Absolute Value Inequalities (Sections.6 and.) 8. Equivalent Inequalities Definition 8. Two inequalities are equivalent

More information

Long-Run Covariability

Long-Run Covariability Long-Run Covariability Ulrich K. Müller and Mark W. Watson Princeton University October 2016 Motivation Study the long-run covariability/relationship between economic variables great ratios, long-run Phillips

More information

Exact and Approximate Numbers:

Exact and Approximate Numbers: Eact and Approimate Numbers: The numbers that arise in technical applications are better described as eact numbers because there is not the sort of uncertainty in their values that was described above.

More information

ON MODEL SELECTION FOR STATE ESTIMATION FOR NONLINEAR SYSTEMS. Robert Bos,1 Xavier Bombois Paul M. J. Van den Hof

ON MODEL SELECTION FOR STATE ESTIMATION FOR NONLINEAR SYSTEMS. Robert Bos,1 Xavier Bombois Paul M. J. Van den Hof ON MODEL SELECTION FOR STATE ESTIMATION FOR NONLINEAR SYSTEMS Robert Bos,1 Xavier Bombois Paul M. J. Van den Hof Delft Center for Systems and Control, Delft University of Technology, Mekelweg 2, 2628 CD

More information

Calculus of Variation An Introduction To Isoperimetric Problems

Calculus of Variation An Introduction To Isoperimetric Problems Calculus of Variation An Introduction To Isoperimetric Problems Kevin Wang The University of Sydney SSP Working Seminars, MATH2916 May 4, 2013 Contents I Lagrange Multipliers 2 1 Single Constraint Lagrange

More information

Nonlinear State Estimation Methods Overview and Application to PET Polymerization

Nonlinear State Estimation Methods Overview and Application to PET Polymerization epartment of Biochemical and Chemical Engineering Process ynamics Group () onlinear State Estimation Methods Overview and Polymerization Paul Appelhaus Ralf Gesthuisen Stefan Krämer Sebastian Engell The

More information

Linear Algebra is Your Friend: Least Squares Solutions to Overdetermined Linear Systems

Linear Algebra is Your Friend: Least Squares Solutions to Overdetermined Linear Systems Linear Algebra is Your Friend: Least Squares Solutions to Overdetermined Linear Systems R. E. Babcock, Mark E. Arnold Department of Chemical Engineering and Department of Mathematical Sciences Fayetteville,

More information

Dissipativity. Outline. Motivation. Dissipative Systems. M. Sami Fadali EBME Dept., UNR

Dissipativity. Outline. Motivation. Dissipative Systems. M. Sami Fadali EBME Dept., UNR Dissipativity M. Sami Fadali EBME Dept., UNR 1 Outline Differential storage functions. QSR Dissipativity. Algebraic conditions for dissipativity. Stability of dissipative systems. Feedback Interconnections

More information

MODULE 5: DISTILLATION

MODULE 5: DISTILLATION MOULE 5: ISTILLATION LECTURE NO. 3 5.2.2. Continuous distillation columns In contrast, continuous columns process a continuous feed stream. No interruptions occur unless there is a problem with the column

More information

Optimizing Economic Performance using Model Predictive Control

Optimizing Economic Performance using Model Predictive Control Optimizing Economic Performance using Model Predictive Control James B. Rawlings Department of Chemical and Biological Engineering Second Workshop on Computational Issues in Nonlinear Control Monterey,

More information

LECTURE 7. Least Squares and Variants. Optimization Models EE 127 / EE 227AT. Outline. Least Squares. Notes. Notes. Notes. Notes.

LECTURE 7. Least Squares and Variants. Optimization Models EE 127 / EE 227AT. Outline. Least Squares. Notes. Notes. Notes. Notes. Optimization Models EE 127 / EE 227AT Laurent El Ghaoui EECS department UC Berkeley Spring 2015 Sp 15 1 / 23 LECTURE 7 Least Squares and Variants If others would but reflect on mathematical truths as deeply

More information

Linear Algebraic Equations

Linear Algebraic Equations Linear Algebraic Equations Linear Equations: a + a + a + a +... + a = c 11 1 12 2 13 3 14 4 1n n 1 a + a + a + a +... + a = c 21 2 2 23 3 24 4 2n n 2 a + a + a + a +... + a = c 31 1 32 2 33 3 34 4 3n n

More information

Hyperbolic Systems of Conservation Laws. in One Space Dimension. II - Solutions to the Cauchy problem. Alberto Bressan

Hyperbolic Systems of Conservation Laws. in One Space Dimension. II - Solutions to the Cauchy problem. Alberto Bressan Hyperbolic Systems of Conservation Laws in One Space Dimension II - Solutions to the Cauchy problem Alberto Bressan Department of Mathematics, Penn State University http://www.math.psu.edu/bressan/ 1 Global

More information

Optimization and Root Finding. Kurt Hornik

Optimization and Root Finding. Kurt Hornik Optimization and Root Finding Kurt Hornik Basics Root finding and unconstrained smooth optimization are closely related: Solving ƒ () = 0 can be accomplished via minimizing ƒ () 2 Slide 2 Basics Root finding

More information

Math 273a: Optimization Lagrange Duality

Math 273a: Optimization Lagrange Duality Math 273a: Optimization Lagrange Duality Instructor: Wotao Yin Department of Mathematics, UCLA Winter 2015 online discussions on piazza.com Gradient descent / forward Euler assume function f is proper

More information

F and G have continuous second-order derivatives. Assume Equation (1.1) possesses an equilibrium point (x*,y*) so that

F and G have continuous second-order derivatives. Assume Equation (1.1) possesses an equilibrium point (x*,y*) so that 3.1.6. Characterizing solutions (continued) C4. Stability analysis for nonlinear dynamical systems In many economic problems, the equations describing the evolution of a system are non-linear. The behaviour

More information

Review of Optimization Basics

Review of Optimization Basics Review of Optimization Basics. Introduction Electricity markets throughout the US are said to have a two-settlement structure. The reason for this is that the structure includes two different markets:

More information

Aspen Dr. Ziad Abuelrub

Aspen Dr. Ziad Abuelrub Aspen Plus Lab Pharmaceutical Plant Design Aspen Dr. Ziad Abuelrub OUTLINE 1. Introduction 2. Getting Started 3. Thermodynamic Models & Physical Properties 4. Pressure Changers 5. Heat Exchangers 6. Flowsheet

More information

Shooting methods for numerical solutions of control problems constrained. by linear and nonlinear hyperbolic partial differential equations

Shooting methods for numerical solutions of control problems constrained. by linear and nonlinear hyperbolic partial differential equations Shooting methods for numerical solutions of control problems constrained by linear and nonlinear hyperbolic partial differential equations by Sung-Dae Yang A dissertation submitted to the graduate faculty

More information

C/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21

C/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21 C/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21 1 Readings Benenti et al, Ch 310 Stolze and Suter, Quantum Computing, Ch 84 ielsen and Chuang, Quantum Computation and Quantum

More information

Understand the existence and uniqueness theorems and what they tell you about solutions to initial value problems.

Understand the existence and uniqueness theorems and what they tell you about solutions to initial value problems. Review Outline To review for the final, look over the following outline and look at problems from the book and on the old exam s and exam reviews to find problems about each of the following topics.. Basics

More information

Lecture 1: Course Introduction.

Lecture 1: Course Introduction. Lecture : Course Introduction. What is the Finite Element Method (FEM)? a numerical method for solving problems of engineering and mathematical physics. (Logan Pg. #). In MECH 40 we are concerned with

More information

Optimization. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30

Optimization. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30 Optimization Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30 Unconstrained optimization Outline 1 Unconstrained optimization 2 Constrained

More information

Nonlinear Equations. Chapter The Bisection Method

Nonlinear Equations. Chapter The Bisection Method Chapter 6 Nonlinear Equations Given a nonlinear function f(), a value r such that f(r) = 0, is called a root or a zero of f() For eample, for f() = e 016064, Fig?? gives the set of points satisfying y

More information

DISTILLATION. Keywords: Phase Equilibrium, Isothermal Flash, Adiabatic Flash, Batch Distillation

DISTILLATION. Keywords: Phase Equilibrium, Isothermal Flash, Adiabatic Flash, Batch Distillation 25 DISTILLATION Keywords: Phase Equilibrium, Isothermal Flash, Adiabatic Flash, Batch Distillation Distillation refers to the physical separation of a mixture into two or more fractions that have different

More information

EE-597 Notes Quantization

EE-597 Notes Quantization EE-597 Notes Quantization Phil Schniter June, 4 Quantization Given a continuous-time and continuous-amplitude signal (t, processing and storage by modern digital hardware requires discretization in both

More information

Geometric Modeling Summer Semester 2010 Mathematical Tools (1)

Geometric Modeling Summer Semester 2010 Mathematical Tools (1) Geometric Modeling Summer Semester 2010 Mathematical Tools (1) Recap: Linear Algebra Today... Topics: Mathematical Background Linear algebra Analysis & differential geometry Numerical techniques Geometric

More information

Domain s Sweep, a Computational Method to Optimise Chemical and Physical Processes

Domain s Sweep, a Computational Method to Optimise Chemical and Physical Processes Article Domain s Sweep, a Computational Method to Optimise Chemical and Physical Processes Alexandre César Balbino Barbosa Filho Department of Chemical Engineering, Federal University of Campina Grande,

More information

10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #6: Boundary Value Problems (BVPs)

10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #6: Boundary Value Problems (BVPs) 1.34 Numerical Methods Applied to Chemical Engineering Fall 15 Homework #6: Boundary Value Problems BVPs Problem 1. 1 points Most entropies of gas phase molecules tabulated in databases were not directly

More information

Computation fundamentals of discrete GMRF representations of continuous domain spatial models

Computation fundamentals of discrete GMRF representations of continuous domain spatial models Computation fundamentals of discrete GMRF representations of continuous domain spatial models Finn Lindgren September 23 2015 v0.2.2 Abstract The fundamental formulas and algorithms for Bayesian spatial

More information

4F3 - Predictive Control

4F3 - Predictive Control 4F3 Predictive Control - Lecture 2 p 1/23 4F3 - Predictive Control Lecture 2 - Unconstrained Predictive Control Jan Maciejowski jmm@engcamacuk 4F3 Predictive Control - Lecture 2 p 2/23 References Predictive

More information

ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints

ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints Instructor: Prof. Kevin Ross Scribe: Nitish John October 18, 2011 1 The Basic Goal The main idea is to transform a given constrained

More information

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be

More information

CLASS NOTES Computational Methods for Engineering Applications I Spring 2015

CLASS NOTES Computational Methods for Engineering Applications I Spring 2015 CLASS NOTES Computational Methods for Engineering Applications I Spring 2015 Petros Koumoutsakos Gerardo Tauriello (Last update: July 2, 2015) IMPORTANT DISCLAIMERS 1. REFERENCES: Much of the material

More information

9 - Markov processes and Burt & Allison 1963 AGEC

9 - Markov processes and Burt & Allison 1963 AGEC This document was generated at 8:37 PM on Saturday, March 17, 2018 Copyright 2018 Richard T. Woodward 9 - Markov processes and Burt & Allison 1963 AGEC 642-2018 I. What is a Markov Chain? A Markov chain

More information

Likelihood Bounds for Constrained Estimation with Uncertainty

Likelihood Bounds for Constrained Estimation with Uncertainty Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 5 Seville, Spain, December -5, 5 WeC4. Likelihood Bounds for Constrained Estimation with Uncertainty

More information

Dealing with Rotating Coordinate Systems Physics 321. (Eq.1)

Dealing with Rotating Coordinate Systems Physics 321. (Eq.1) Dealing with Rotating Coordinate Systems Physics 321 The treatment of rotating coordinate frames can be very confusing because there are two different sets of aes, and one set of aes is not constant in

More information

New Notes on the Solow Growth Model

New Notes on the Solow Growth Model New Notes on the Solow Growth Model Roberto Chang September 2009 1 The Model The firstingredientofadynamicmodelisthedescriptionofthetimehorizon. In the original Solow model, time is continuous and the

More information

Proper Orthogonal Decomposition (POD)

Proper Orthogonal Decomposition (POD) Intro Results Problem etras Proper Orthogonal Decomposition () Advisor: Dr. Sorensen CAAM699 Department of Computational and Applied Mathematics Rice University September 5, 28 Outline Intro Results Problem

More information

Systems Engineering Spring Group Project #1: Process Flowsheeting Calculations for Acetic Anhydride Plant. Date: 2/25/00 Due: 3/3/00

Systems Engineering Spring Group Project #1: Process Flowsheeting Calculations for Acetic Anhydride Plant. Date: 2/25/00 Due: 3/3/00 10.551 Systems Engineering Spring 2000 Group Project #1: Process Flowsheeting Calculations for Acetic Anhydride Plant Date: 2/25/00 Due: 3/3/00 c Paul I. Barton, 14th February 2000 At our Nowhere City

More information

Azeotropic distillation Example 1

Azeotropic distillation Example 1 Azeotropic distillation Example 1 Separate water from iso-butanol. The phase behavior for this mixture is interesting. There is a minimum boiling azeotrope formed as well as a liquid-liquid phase separation

More information

Aggregate Models based on Improved Group Methods for Simulation and Optimization of Distillation Systems

Aggregate Models based on Improved Group Methods for Simulation and Optimization of Distillation Systems Aggregate Models based on Improved Group Methods for Simulation and Optimization of Distillation Systems Ravindra S. Kamath 1, Ignacio E. Grossmann 1,*, and Lorenz T. Biegler 1 1 Chemical Engineering Department,

More information

It is convenient to introduce some notation for this type of problems. I will write this as. max u (x 1 ; x 2 ) subj. to. p 1 x 1 + p 2 x 2 m ;

It is convenient to introduce some notation for this type of problems. I will write this as. max u (x 1 ; x 2 ) subj. to. p 1 x 1 + p 2 x 2 m ; 4 Calculus Review 4.1 The Utility Maimization Problem As a motivating eample, consider the problem facing a consumer that needs to allocate a given budget over two commodities sold at (linear) prices p

More information

Fast Iterative Solution of Saddle Point Problems

Fast Iterative Solution of Saddle Point Problems Michele Benzi Department of Mathematics and Computer Science Emory University Atlanta, GA Acknowledgments NSF (Computational Mathematics) Maxim Olshanskii (Mech-Math, Moscow State U.) Zhen Wang (PhD student,

More information

3.3.1 Linear functions yet again and dot product In 2D, a homogenous linear scalar function takes the general form:

3.3.1 Linear functions yet again and dot product In 2D, a homogenous linear scalar function takes the general form: 3.3 Gradient Vector and Jacobian Matri 3 3.3 Gradient Vector and Jacobian Matri Overview: Differentiable functions have a local linear approimation. Near a given point, local changes are determined by

More information

Vapor-liquid Separation Process MULTICOMPONENT DISTILLATION

Vapor-liquid Separation Process MULTICOMPONENT DISTILLATION Vapor-liquid Separation Process MULTICOMPONENT DISTILLATION Outline: Introduction to multicomponent distillation Phase Equilibria in Multicomponent Distillation (Pg. 737) Bubble-point and dew-point calculation

More information

Paul Heckbert. Computer Science Department Carnegie Mellon University. 26 Sept B - Introduction to Scientific Computing 1

Paul Heckbert. Computer Science Department Carnegie Mellon University. 26 Sept B - Introduction to Scientific Computing 1 Paul Heckbert Computer Science Department Carnegie Mellon University 26 Sept. 2 5-859B - Introduction to Scientific Computing aerospace: simulate subsonic & supersonic air flow around full aircraft, no

More information

INTEGRATION OF DESIGN AND CONTROL FOR ENERGY INTEGRATED DISTILLATION

INTEGRATION OF DESIGN AND CONTROL FOR ENERGY INTEGRATED DISTILLATION INTEGRATION OF DESIGN AND CONTROL FOR ENERGY INTEGRATED DISTILLATION Hongwen Li, Rafiqul Gani, Sten Bay Jørgensen CAPEC, Department of Chemical Engineering Technical University of Denmark, Lyngby, Denmark

More information

Sparse least squares and Q-less QR

Sparse least squares and Q-less QR Notes for 2016-02-29 Sparse least squares and Q-less QR Suppose we want to solve a full-rank least squares problem in which A is large and sparse. In principle, we could solve the problem via the normal

More information

Integration. 5.1 Antiderivatives and Indefinite Integration. Suppose that f(x) = 5x 4. Can we find a function F (x) whose derivative is f(x)?

Integration. 5.1 Antiderivatives and Indefinite Integration. Suppose that f(x) = 5x 4. Can we find a function F (x) whose derivative is f(x)? 5 Integration 5. Antiderivatives and Indefinite Integration Suppose that f() = 5 4. Can we find a function F () whose derivative is f()? Definition. A function F is an antiderivative of f on an interval

More information

Linear Equations in Linear Algebra

Linear Equations in Linear Algebra 1 Linear Equations in Linear Algebra 1.4 THE MATRIX EQUATION A = b MATRIX EQUATION A = b m n Definition: If A is an matri, with columns a 1, n, a n, and if is in, then the product of A and, denoted by

More information

Theoretical Models of Chemical Processes

Theoretical Models of Chemical Processes Theoretical Models of Chemical Processes Dr. M. A. A. Shoukat Choudhury 1 Rationale for Dynamic Models 1. Improve understanding of the process 2. Train Plant operating personnel 3. Develop control strategy

More information

Flash Light Reflectors. Fountains and Projectiles. Algebraically, parabolas are usually defined in two different forms: Standard Form and Vertex Form

Flash Light Reflectors. Fountains and Projectiles. Algebraically, parabolas are usually defined in two different forms: Standard Form and Vertex Form Sec 6.1 Conic Sections Parabolas Name: What is a parabola? It is geometrically defined by a set of points or locus of points that are equidistant from a point (the focus) and a line (the directri). To

More information

Parameter Estimation in a Moving Horizon Perspective

Parameter Estimation in a Moving Horizon Perspective Parameter Estimation in a Moving Horizon Perspective State and Parameter Estimation in Dynamical Systems Reglerteknik, ISY, Linköpings Universitet State and Parameter Estimation in Dynamical Systems OUTLINE

More information

L1-5. Reducing Rows 11 Aug 2014

L1-5. Reducing Rows 11 Aug 2014 L1-5. Reducing Rows 11 Aug 2014 Never send a human to do a machine's job. Agent Smith Primary concepts: Row-echelon form, reduced row-echelon form, Gauss-Jordan elimination method Online tetbook (Hefferon)

More information

Introduction to Differential Equations

Introduction to Differential Equations Math0 Lecture # Introduction to Differential Equations Basic definitions Definition : (What is a DE?) A differential equation (DE) is an equation that involves some of the derivatives (or differentials)

More information

Closed-loop Behavior of Nonlinear Model Predictive Control

Closed-loop Behavior of Nonlinear Model Predictive Control 2 TWMCC Texas-Wisconsin Modeling and Control Consortium 1 Technical report number 2002-04 Closed-loop Behavior of Nonlinear Model Predictive Control Matthew J. Tenny and James B. Rawlings Department of

More information

Control Systems. State Estimation.

Control Systems. State Estimation. State Estimation chibum@seoultech.ac.kr Outline Dominant pole design Symmetric root locus State estimation We are able to place the CLPs arbitrarily by feeding back all the states: u = Kx. But these may

More information

Lecture 5: Rules of Differentiation. First Order Derivatives

Lecture 5: Rules of Differentiation. First Order Derivatives Lecture 5: Rules of Differentiation First order derivatives Higher order derivatives Partial differentiation Higher order partials Differentials Derivatives of implicit functions Generalized implicit function

More information