An Algorithm for Tuning NMPC Controllers with Application to Chemical Processes

Size: px
Start display at page:

Download "An Algorithm for Tuning NMPC Controllers with Application to Chemical Processes"

Transcription

1 Ths s an open access artcle publshed under an ACS AuthorChoce Lcense, whch permts copyng and redstrbuton of the artcle or any adaptatons for non-commercal purposes. Artcle pubs.acs.org/iecr An Algorthm for Tunng NMPC Controllers wth Applcaton to Chemcal Processes Federco Lozano Santamaría and Jorge M. Goḿez* Grupo de Dsenõ de Productos y Procesos, Departamento de Ingenería Químca, Unversdad de los Andes. Carrera 1 No. 18A-1, Bogota, Colomba Downloaded va on September 3, 18 at :4:3 (UTC). See for optons on how to legtmately share publshed artcles. ABSTRACT: The advantages of lnear/nonlnear model predctve control (N)MPC for dealng wth the multple nput multple output problem, for performng optmzaton and for handlng constrants are well-known and because of that t has been appled wdely n the chemcal ndustry. However, there s a recurrent problem for ths knd of controllers and t s how to defne the best tunng parameters to acheve a good closed-loop response. Ths s an open queston for research even when the common practce s to defne the (N)MPC tunng parameters by tral and error or by the expertse of the control engneer. There are some works that propose a systematc defnton of the (N)MPC tunng parameters, but most of them are restrcted to certan predcton models or do not defne all the tunng parameters. Ths papers presents a general tunng algorthm for (N)MPC controllers that allows the systematc defnton of all the tunng parameter and t s not restrcted to a specfc predcton model or to a problem formulaton. It s based on multobjectve optmzaton for the defnton of the objectve functon weghts and on the optmzaton of a closed loop performance ndex for the defnton of the horzon lengths. Three cases of chemcal processes are consdered n detal to llustrate the applcaton and advantages of the proposed (N)MPC tunng algorthm. 1. INTRODUCTION Nonlnear model predctve control (NMPC) s an advanced control strategy wdely used n dfferent ndustres because of ts capablty to handle constrants, to perform optmzaton and to handle the multvarable problem drectly. The essence of NMPC s to solve an optmal control problem (OCP) n a recedng horzon scheme to construct the control law, n other words, at every tme perod t mnmzes certan performance ndex subject to a (non)lnear model (equalty constrants) and operatonal lmts (nequalty constrants). Even though (N)MPC controllers have been used n many applcatons t s clear that ther good performance depends on two mportant factors: the use of an accurate enough model to represent the plant dynamc and the selecton of tunng parameters to obtan a good closed loop response. 1 If the controller exhbts poor performance, even when ts tunng parameters have been mproved, t s possble that the model used for predcton s not approprate and t should be refned. 1 Ths paper s not focused on the selecton of predcton models for (N)MPC, rather t assumes that a nonlnear model can descrbe the process dynamc precsely. On the other hand, f the model s adequate, the closed loop performance of the system can be mproved selectng approprate tunng parameters for the controller. Usually, the (N)MPC tunng has been done va tral and error or based on the desgner expertse, but t s possble to tune the controller systematcally and there are many studes that try to solve the tunng problem from dfferent perspectves. 1 In addton, the ncreasng number of (N)MPC applcatons stpulates a systematc tunng procedure. The tradtonal tral and error methodology for tunng (N)MPC controllers s an neffcent strategy because t requres the evaluaton of a large number of combnatons. Also, many of the parameters have coupled or overlappng effects on the performance of the controller; thus, t s clear the need for a more precse and consstent method for tunng these controllers. The man dea of a systematc tunng procedure for (N)MPC controllers s to defne the controller parameters (e.g., predcton horzon, control horzon, weghts of the dfferent objectves) based on performance ndexes of the closed loop behavor of the system. It mght seem easy to defne a performance ndex for the closed loop response as a smlar ndex s defned for the OCP that s solved perodcally, but there could be more aspects that are mportant for the control engneer that are not represented n the objectve functon of the OCP. Moreover, the OCP s usually nonlnear and s subject to nequalty constrants, whch make t mpossble to fnd an analytcal expresson of the control law. 3 In consequence, the performance ndex defned for the closed loop behavor of the system cannot be related explctly wth the tunng parameters of the controller. In the lterature there are many works dealng wth the problem of tunng (N)MPC controllers from dfferent perspectves, but none of them, as far as we know, s capable to defne all the Receved: March 1, 16 Revsed: July 6, 16 Accepted: August 5, 16 Publshed: August 5, Amercan Chemcal Socety 915 DOI: 1.11/acs.ecr.6b111

2 Industral & Engneerng Chemstry Research tunng parameters for any knd of (N)MPC controller and the development of a more general methodology s stll a challenge and an open area for research. 4 For example, Shrdhar and Cooper 5 present a tunng strategy based on a complaton of heurstcs and on the defnton of a well-condtoned optmzaton problem. Ths strategy begns wth the approxmaton of the predcton model to a frst order plus dead tme (FOPDT) model and then t uses some smple equatons to calculate all the tunng parameters of the controller, ncludng the length of the horzons. Nevertheless, the approxmaton to a FOPDT model and the use of heurstcs mght not be accurate enough to guarantee a good closed loop performance or a robust controller. It s mportant to note that ths approach can also be appled to nonlnear MPC, but frst the model must be approxmate to a FOPDT model n order to dentfy some characterstcs of the process such as tme constants and dead tmes whch are requred n the tunng expressons. A more rgorous approach proposed by D Carno and Bemporad 6 s a tunng strategy based on matchng the MPC closed loop performance to the closed loop performance of a favorte controller. To match the two controllers they propose a mnmzaton of the dfference of the control law predcted by both controllers. However, t only defnes the objectve functon weghts and t s lmted to lnear models wthout nequalty constrants n whch t s possble to fnd an explct soluton of the feedback control sequence. In another work by Francsco and Vega 7 a multobjectve optmzaton strategy, specfcally goal programmng, s used to solve the conflctng objectves of the controller and to defne the penalzaton weghts of the rate of change of the manpulated varables. Then, a random search s used to defne the length of the horzons based on the same performance ndex of the multobjectve optmzaton problem. Ths strategy s lmted to lnear models wthout constrants and for nonlnear models t s necessary to lnearze them around the operaton pont whch reduces the effcacy of the fnal tunng parameters on the closed-loop performance. One fnal example s the tunng procedure presented by Vallero et al. 8 n whch a multobjectve optmzaton procedure s used to defne the weghts of the conflctng objectves assumng a fx control and predcton horzon. The multobjectve OCP s solved usng the enhanced normalzed normal constrant or normal boundary ntersecton method and the Pareto front s defned. Once the analyst has chosen a compromsed soluton on the Pareto front, the result of the multobjectve optmzaton can be translated nto a weghted sum whch s a smpler and more common approach for NMPC controllers. In ths Artcle, we present a tunng algorthm for NMPC controllers that allows the defnton of the tunng parameters (predcton horzon, control horzon, and the objectve functon weghts) and that s not restrcted to a specfc type of predcton model or problem formulaton. The proposed tunng algorthm s based on the constrant optmzaton of a performance ndex of the closed loop behavor of the controller. It uses a multobjectve optmzaton technque, specfcally a utopa pont trackng approach, to defne the weghts of the dfferent objectves and a nonlnear ft to approxmate the behavor of the closed-loop performance ndexes wth respect to the length of the horzons. Ths fnal step allows the formulaton and soluton of a new optmzaton problem n whch the tunng parameters of the controller are the optmzaton varables. The rest of ths Artcle s structured as follows: secton presents a bref descrpton of NMPC and dynamc optmzaton. The tunng strategy, whch s the man contrbuton of ths work, 916 Artcle s descrbed n detal n secton 3. It presents each step of the algorthm and the dfferent optmzaton technques used wthn t such as multobjectve optmzaton usng the utopa trackng approach and the approxmaton of the performance ndexes to quadratc functons of the predcton and control horzons. Secton 4, descrbes the advanced step NMPC (asnmpc) controller. Secton 5 llustrates the applcaton of the NMPC tunng algorthm wth two case studes of chemcal processes, a CSTR reactor, and an extractve dstllaton column. For the frst case, two possble scenaros are consdered whch result n a fnal repertory of three examples that apply the proposed tunng algorthm. The fnal conclusons and consderatons of ths Artcle are presented n secton 6.. BACKGROUND ON NMPC AND DYNAMIC OPTIMIZATION Nonlnear model predctve control (NMPC) s an advanced control strategy that solves an OCP at every tme perod. The soluton to ths problem s a control sequence over a future horzon, but from ths sequence only the frst element s mplemented n the plant to construct the control law. Fgure 1 presents a smple example of how model predctve control works. At the current tme (t k ), an OCP subject to a Fgure 1. Representaton of the recedng horzon strategy n the (N)MPC formulaton. model of the process s defned and solved onlne n a future predcton horzon (N p ) where only a number of control actons are allowed (N u ). The soluton of the optmzaton problem s the predcton of the future behavor of the process and the necessary control actons to acheve the desred operaton. However, only the frst value of the manpulated varables s feedback to the process and the rest future actons predcted are dscarded. The defnton of the OCP s updated based on new measurements of the state varables and t s solved agan. The crtcal step n the mplementaton of NMPC controllers s the soluton of the OCP because t has to be solved perodcally and n less tme than a samplng tme nterval. A general formulaton of the OCP s gven by eq 1, where x d are the dfferental states, x a the algebrac states, y the measured outputs, w I the dsturbances n the states, w O the dsturbances n the outputs, and u the manpulated varables. The objectve functon, eq 1a, s composed by two terms: a runnng cost (ϕ), whch s a weghted sum of dfferent objectves lke a quadratc trackng functon, a quadratc penalzaton of the rate of change of the manpulated varables or an energy or economc functon, and a termnal cost (ϕ f ), whch s only a functon of the states at the fnal tme of the predcton horzon and s normally used to DOI: 1.11/acs.ecr.6b111

3 Industral & Engneerng Chemstry Research approxmate the fnte horzon problem to the nfnte horzon problem. 9 The optmzaton problem s subject to a set of dfferental and algebrac eqs eqs 1b 1d that can be lnear defnng a quadratc programmng problem (QP) or nonlnear defnng a nonlnear programmng problem (NLP). Equaton 1f s also an equalty constrant, but t s presented separately from the others because t represents the measured outputs for the control problem. The nequaltes of the problem, eq 1e, are normally assocated wth varables bounds or bounds on ther rate of change, but they can also be nonlnear expressons. tk mn OBJ = ϕ( t, y, u) d t + ϕ( y, u ) f x, x, u f f d a tk+τnp (1a) x s.t. d dt d = f(, t x, x, u, w) d a I (1b) x d ( t k ) = x d (1c) ct (, xd, xa, u, wi ) = (1d) ht (, xd, xa, u, wi ) (1e) y = gt (, xd, xa, wo ) (1f) Note that eq 1c represents the ntal condton of the dfferental states whch s updated at each samplng nstant. In the presence of model plant msmatch the smple approach of updatng the ntal condtons wth the value of the states observed, f all the dfferental states can be measured, can produce a steady-state offset that deterorates the performance of the controller. Thus, an output feedback method s requred to obtan an offset free response. 1 Usng the formulaton presented n eq 1, the output feedback can be done usng an observer such as an extended Kalman flter (EKF) or a movng horzon estmator (MHE) whch soluton provdes the ntal condtons of the problem (x d ) and the value of the dsturbances (w I,w O ). There are other smpler approaches for handlng the feedback, when all the dfferental states are measured, n order to elmnate the offset and they are the conventonal feedback and the steady-state target settng. 1 In the frst one, a constant bas, calculated as the dfference between the output predcted and the output measured, s added to the rght-hand sde of eq 1f. 4 In the second one, the set-ponts of the outputs are replaced by a reference value, whch s obtanng by solvng a steady-state optmzaton problem that mnmzes the dfference between the reference and the set-pont subject to the model that consders the bas. 1 If the optmzaton problem gven by eq 1 s of large-scale or has complex nonlnear terms ts soluton mght take an mportant amount of tme ntroducng delays and even nstabltes n the closed loop control. In addton, the effects of the tunng parameter of the controller on the closed loop performance are not easy to predct and they mght not be monotonc.,11 3. NMPC TUNING ALGORITHM The optmal tunng problem wth respect to the controller parameters can be formulated as follows: 11 mn Jx ( d, xa) p u (a) N, N, W, τ s.t. f ( xd, xa, u, wi ) = (b) 917 u = gx (, x, N, N, W, τ) Artcle d a p u (c) hx ( a, xd ) (d) Where the objectve functon, eq a, s a performance ndex for the closed loop behavor of the controller. Equaton b s a general set of dfferental algebrac equatons that represent the real plant, and t s a functon of the states, the control law, and the dsturbances. Ths allows to tune the controller for a specfc type of antcpated or predefned dsturbances. Equaton d are nequalty constrant for the closed loop behavor (e.g., the maxmum overshoot allowed). Note that the objectve functon of the problem defned by eq s an ndcator of the whole closed loop performance of the process (e.g., the ntegral absolute error), whch s dfferent from the objectve of eq 1 that represents the OCP objectve (e.g., a quadratc functon of trackng wth respect to a specfc set-pont). Also, the OCP defned n eq 1 s solved recurrently at every samplng nterval, whle the problem of eq s only solved once for the defnton of the controller tunng parameters. In most cases t s mpossble to defne exactly the eq b. Moreover, eq c s the explct feedback control law expressed as a functon of the dfferental states, the algebrac states and the controller tunng parameters (e.g., predcton horzon N p, control horzon N u, objectve functon weghts W, samplng tme τ); and t can only be defned n ths way for lnear model predctve controllers wthout nequalty constrants. If t were possble to formulate explctly the optmzaton problem of eq ts soluton would be the tunng parameters of the NMPC controller that mnmze the specfed closed loop performance ndex. Therefore, there s a need to formulate the optmzaton problem of eq n a dfferent way to fnd an alternatve soluton to ths problem consderng ts lmtatons. The algorthm presented hereafter s one alternatve for solvng ths optmzaton problem for tunng NMPC controllers, but before ntroducng t n detal t s mportant to analyze the tunng parameters of the controller and ther general effect on the closed loop performance. Samplng Tme. It s the tme nterval n whch a new control sgnal s feedback to the system. The samplng nterval should be small enough to capture adequately the dynamc of the process, but the smaller t s the optmzaton problem becomes larger. 1 It s not adequate as a tunng parameter because t should be fxed based on the equpment nstalled and the lmtatons of sensors and actuators. It also mpacts drectly those parameters that are specfed n samplng ntervals lke the predcton and control horzons. 5 It s mportant to consder the Shannon s samplng theorem when selectng the samplng tme because t defnes an upper bound for ths parameter to avod loss of nformaton durng the samplng of a sgnal, n other words, t states that the samplng frequency should be greater than two tmes the maxmum frequency of the sgnal. 13 Note that the frequency of nterest here can be referred to the manpulated varables or to the dsturbances, beng the frst one more mportant because t ndcates how fast the actuators can response. Also, there are some emprcal gudelnes that suggest a samplng tme between 1% and 3% of the perod of oscllaton for oscllatory systems and of the rse tme for nonoscllatory systems. 14 Predcton Horzon. It defnes the upper lmt of the tme horzon for the predcton of the process behavor. If the process model s lnear, ncreasng the predcton horzon has a monotonc effect on the closed loop performance mprovng ts DOI: 1.11/acs.ecr.6b111

4 Industral & Engneerng Chemstry Research Artcle stablty. It should be selected as large as possble but fnte. As the predcton horzon s ncreased the sze and complexty of the dynamc optmzaton problem does also ncrease. 1 Control Horzon. Ths s the number of control actons that are allowed durng the OCP and t s lower or equal than the predcton horzon. It affects how aggressve the control acton s and defnes a trade-off between robustness of the controller for large control horzons and easy of computaton of the OCP soluton for small control horzons. 1,1 The control nputs can also be parametrzed n a blockng scheme n whch the user specfes ponts on the control horzon that are not computed and are set equal to the prevous control acton. 4 Before ntroducng the rest of the NMPC tunng parameters t s mportant to consder n detal the objectve functon of eq 1. Usually ths objectve functon s composed of dfferent objectves (e.g., quadratc trackng of the set-pont, penalzaton of the rate of change of the manpulated varables) and the compromse among these s expressed n a sngle objectve functon constructed as a weghted sum, eq 3. Also, eq 4 shows the most common objectve functon used n (N)MPC where W are weghts for every ndvdual objectve (ϕ ). In eq 4, the frst term s a quadratc trackng of the outputs wth respect to a set-pont, the frst summaton s done over the number of outputs n y and the second one over the dscrete tmes untl the predcton horzon N p, and the second term s a penalzaton of the rate of change of the manpulated varables, the frst summaton s done over the number of manpulated varables n u and the second one over the dscrete tmes untl the control horzon N u. The second term can also be expressed as the change of the manpulated varables wth respect to a reference. Note that ths s a dscrete tme representaton = 1 mn OBJ = Wϕ( t, y, u) xd, xa,u n o (3) = 1 k= 1 j= 1 k= sp mn OBJ = W ( y y ) + W ( Δu ) xd, xa,u ny k, j Np nu Nu 1 jk, Weghts on the Outputs. Tths weghts are used n the objectve functon to scale the varables and to prortze the dfferent objectves accordng to ther relatve mportance. Increasng a specfc weght, whle keepng the rest constant, drves the control effort toward a more tghter control n that varable. 1 Weghts on the Change or Rate of Change of the Inputs. They suppress the aggressve changes of the manpulated varables makng a more robust controller, but they also make the response on the controlled varables slower. 5 Settng a small penalty on ths part of the objectve functon produces a more aggressve response and decreases the ablty of the controller to handle drastc changes or dsturbances. Algorthm for Tunng NMPC Controllers. An algorthm for tunng NMPC controllers s developed n whch the fnal result s the value of all the tunng parameters wth the excepton of the samplng tme that s consdered as an nput for the algorthm. Fgures and 3 present every step of the algorthm and the shadowed blocks are the stages n whch the tunng parameter values are obtaned. The algorthm conssts of three phases. The frst one s the defnton of the model, the plant and the ntalzaton of some parameters and sets. The second one s (4) Fgure. Phase I of the algorthm for tunng NMPC controllers. the defnton of the OCP objectve functon weghts usng multobjectve optmzaton and the computaton of key performance ndexes (KPI) for each confguraton. Note that a KPI can be any type of metrc used to quantfy the closedloop performance of the process and some examples are the ntegral square error (ISE), the overshoot percentage, the maxmum soluton tme of the OCP and the economc proft. Fnally, the thrd phase s the soluton of an optmzaton problem formulated based on the closed loop performance and the KPIs obtaned. Each step of the algorthm s descrbe next. In Phase I of the algorthm the model, the real plant and the ntalzaton parameters are defned. The algorthm starts by defnng the model of the process. For example, t can be a set of dfferental equatons that descrbes the dynamc behavor of the system ncludng nequalty constrants. These two elements correspond to eq 1b 1e of the OCP formulaton. Wthn the tunng algorthm t s mportant to consder the model plant msmatch because every practcal mplementaton of NMPC exhbts a msmatch and the way ths s handled has a sgnfcant effect on the tunng parameters of the controller. 15 Therefore, t s necessary to defne a smulaton model for the real plant f the tunng cannot be done usng the plant tself. Some alternatves for modelng the real plant behavor are usng a more detaled model than the one used for predcton, ntroducng whte nose n the measurements or modfyng the parameters of the predcton model. Once ths two models, or the plant measurements and the predcton model, are defned the next step s to 918 DOI: 1.11/acs.ecr.6b111

5 Industral & Engneerng Chemstry Research Artcle Fgure 3. Phase II and III of the algorthm for tunng NMPC controllers. consder the state estmaton problem and an alternatve to handle model plant msmatch. In ths paper we consder, wthout loss of generalty, that all the states can be measured, thus we do not solve a state estmaton problem; but estmators lke the Kalman flter, extended Kalman flter or MHE (movng horzon estmaton) can be used n ths step of the tunng algorthm. 16 For handlng the model plant msmatch and to avod computatonal delays we used the asnmpc strategy coupled wth NLP senstvty whch s a fast alternatve to update the value of the manpulated varables once the real measurements of the process are avalable. 17 Ths s descrbed n more detal n secton 4 because t s appled for the case studes presented and the algorthm s not restrcted to usng t. Also, other alternatves can be used here lke a proportonal correcton of the manpulated varables based on the error n the measured varables. 18 The rest of phase I ncludes defnng the type of control problem for whch the controller s beng desgned (e.g., dsturbance rejecton or set-pont trackng) and ntalzng some parameters and sets. The parameters that must be ntalzed are the samplng tme (τ), that should be selected based on the system lmtatons and on the Shannon s samplng theorem; the set of control objectves (ϕ), whch corresponds to each element presented n the weghted sum objectve functon, eq 3; a set of performance ndexes (e.g., ntegral square error, overshoot percentage, economc proft) (KPI_Set) and a set of dfferent confguratons of predcton horzon and control horzon (H_Set). Note that the H_Set elements are only an ntal confguratons of N p and N u and later n the algorthm more elements wll be added to the set. However, the ponts of ths ntal confguraton must have a good dsperson allowng a good samplng of the whole regon defned by N p and N u to ft response surfaces n ths space. 19 One alternatve to ntalze the H_Set s presented n Fgure 4, ths confguraton s based on a central composed desgn of experments for a nonunform regon and allows a good samplng of the space defned by N p and N u. 19 Note that the samplng space shown n Fgure 4 depends on the value of the parameter N p max whch s an upper bound for the predcton horzon and t s defned by the analyst. In ths step of the tunng algorthm addtonal parameters mght be ncluded such as an nput blockng scheme or nternal model control (IMC) flter constants, but t wll ncrease the number of cases that must be evaluated n the phase II. In other words, the H_Set wll be composed not just by the predcton and control horzon, but t wll have addtonal elements correspondng to the addtonal aspects of the controller. For example, f an nput blockng s ncluded n the controller each element of the H_Set wll have the form of (N p, N u,bs),wherebs s the blockng scheme. Also, addng more tems to each element of the H_Set ncreases the complexty of the phase III, but t s not a restrcton for applyng the tunng algorthm proposed. In phase II of the algorthm for each element of the set H_Set, whch means for each confguraton of predcton horzon 919 DOI: 1.11/acs.ecr.6b111

6 Industral & Engneerng Chemstry Research Artcle Fgure 4. Intal confguraton of H_Set. For the examples presented later n ths paper N p max takes values of 1 and 5, whch means that the samplng s done at values of N p equals to (, 5, 8, 1) and (, 5, 38, 5), respectvely. and control horzon, the followng s done: () Solve the NMPC problem for each ndvdual control objectve (e.g., quadratc trackng of one state varable wth respect to ts set-pont, quadratc penalzaton of the rate of change of a manpulated varable). At every perod of the NMPC, when an OCP s solved, the values of all the objectves are computed and stored (ϕ,j,k * ). Also, the notaton here ndcates that the objectve s computed for every tme perod when the objectve j s mnmzed and the horzon confguraton k s used. It s mportant to menton that for a specfc set of ndexes (e.g., =1,j =1,k = 1) the varable ϕ,j,k * s actually a vector ndexed n the dscrete tme t because the objectve functon value s computed at every samplng tme. The astersk (*) symbol ndcates the value of the varable/expresson at the optmal soluton. () Once the NMPC has been solve for every ndvdual objectve (ϕ j ) an upper bound (ϕ U,k ) and a lower bound (ϕ L,k ) for each objectve are computed from the values stored prevously. Note that the upper and lower bounds are computed usng the maxmum and mnmum operators over the j ndex and the dscrete tme (t) on the varable ϕ,j,k *. Then, usng these bounds the range of all objectves s computed. () The OCP objectve functon weghts are calculated based on the range of each objectve. (v) Another NMPC problem s solved usng a composed objectve functon whch s defned as the weghted sum of all the objectves and for ths fnal result the KPIs are computed and saved. The las three steps of phase II of the proposed algorthm are better explaned n the followng paragraphs and n the U Appendx A whch shows n great detal how to compute ϕ,k and ϕ L,k for the case study 1 (secton 5.1). At the end of Phase II a set of weghts and a set of KPIs must have been defned for each confguraton of predcton and control horzon. The dea behnd ths way of calculatng the objectve functon weghts s a multobjecve optmzaton technque called utopa trackng approach whch mnmzes the dstance between the Pareto front and the utopa pont. Fgure 5 llustrates the utopa pont, the nadr pont, the Pareto font and the dstance that s mnmzed usng ths approach for a case consstng only of two objectves. Zavala and Flores use ths utopa trackng approach to solve onlne the multple conflctng objectves n a NMPC controller. They solve n parallel as many optmzaton problems as objectves are defned 9 Fgure 5. Illustraton of the utopa trackng approach for two objectves. to fnd the utopa pont and then the OCP that s solved to defne the feedback value of the manpulated varables has the followng objectve functon: 1 = 1 L ϕ ϕ mn U L xd, xa,u ϕ ϕ no (5) Note that n eq 5 s expressed n terms of the elements of the followng vectors: ϕ s a vector of objectves, ϕ L s a vector of lower bounds for the objectves (utopa pont), and ϕ U s a vector of upper bounds for the objectves (nadr pont). Also, each dstance from the objectve to the utopa pont s standardzed dvdng t by the range of the objectve because the order of magntude of the objectves mght dffer sgnfcantly and produces an ll-condtoned optmzaton problem. It s possble to avod the onlne soluton of more than one optmzaton problem wthn every tme nterval f the global coordnates of the utopa and the nadr pont are defned prevously. To compute the utopa and the nadr pont t s necessary to solve a NMPC problem for each objectve and, once ths s done, t s possble to use eq 5 as the objectve functon of the OCP. However, consderng that the utopa pont s an unreachable pont because t mnmzes all the objectves smultaneously, the absolute value operator of eq 5 can be omtted and the objectve functon can be rearranged as follows: = 1 L = 1 L ϕ ϕ ϕ ϕ mn = mn U L U L xd, xa,u ϕ ϕ xd, xa,u ϕ ϕ n n = 1 = 1 L ϕ ϕ = mn U L U L xd, xa,u ϕ ϕ ϕ ϕ (6) n n Fnally, takng nto account that the argument of mnmzng a functon plus a constant s the same as mnmzng only the functon (t s also vald f the problem s constraned) 3 the OCP objectve functon can be expressed as a weghted sum of the ndvdual objectves where each weght s the nverse of the objectve range, eq 7. DOI: 1.11/acs.ecr.6b111

7 Industral & Engneerng Chemstry Research arg mn ( x* * d, xa, u* ) = ( xd, xa, u) n arg mn 1 ϕ = U ( x, x, u) ϕ ϕ d a = 1 = 1 L ϕ ϕ U L U ϕ ϕ n = = 1 n arg mn + C = ( x, x, u) L d a n ϕ ϕ L Wϕ When the utopa trackng approach s used for defnng the OCP weghts all the objectves receve the same relatve mportance. 4 The phase III of the algorthm s composed of two steps. The frst one s the computaton of a response surface that s a functon of the predcton horzon (N p ) and the control horzon (N u ) for every KPI n the KPI_Set. Note n Fgure 4 that only specfc measurements of the KPI are avalable after phase II of the proposed tunng algorthm and there s not an explct functon of the KPI n the whole space defned by N p and N u. Because of ths t s necessary to use these measured ponts, whch are computed after each teraton of phase II, to approxmate a functon or response surface that can predct accurately the behavor of the KPIs. To compute the response surface t s necessary to solve the problem RS-KPI (response surface for KPI), stated n eq 8. Ths problem mnmzes the devaton between the measured ponts (obtaned n Phase II) and a specfc functon; n other words, t s a lnear or nonlnear ft. In ths paper we use a quadratc approxmaton as t s shown n eq 9 to descrbe how each KPI depends on N p and N u, but other types of response surfaces can be used for ths approxmaton. mn ( K K) a1, a,..., am HSet _ s.t. K = f( a, a,..., a ), H_ Set 1 m f ( a, a,..., a ) = a N + a N + a N + a N 1 m p 1 p u 1 u + a N N + a (7) (8) 11 p u (9) The second step of the phase III s to solve the horzons problem (HP) whch s smlar to the problem stated by eq, but the only decson varables are N p and N u because the objectve functon weghts have been defned prevously. The HP mnmzes a KPI of the closed loop behavor of the system subject to the nature of the control and predcton horzon, to a constrant n the soluton tme of the OCP, and to other nequalty constrants based on the performance ndexes (e.g., maxmum allowable overshoot percentage, mnmum rse tme). eq 1 presents a general formulaton of the HP, where the functon F s a KPI functon obtaned from solvng the RS-KPI problem, eq 8, for a specfc performance ndex. G s a vector of KPI functons and each one corresponds to the soluton of a RS-KPI problem. mn FN (, N) Np, Nu s.t. t sol τ GN (, N) N N N ( N, N ) p u p u max u p p u p + (1) The fnal step of the algorthm s to check f the soluton of the HP s already n the H_Set, f so the algorthm fnsh and the arguments of the soluton of the HP are the predcton and Artcle control horzon for the NMPC controller. Note that ths par of ponts have a vector of objectve functon weghts assocated, whch were found n phase II. If the soluton of HP s not n the H_Set ths new pont s added to the set, and the phase II s repeated for ths pont to defne the correspondng objectve functon weghts. 4. NLP SENSITIVITY AND ASNMPC CONTROLLER The deal NMPC assumes that the OCP can be solved nstantaneously, that all the states are measured and that there s no model plant msmatch. However, f all these assumptons are consdered vald durng the tunng of the controller the fnal result mght not be robust and the controller could fal even under small dsturbances. Thus, t s necessary to consder an addtonal level of complexty. For dong so, n ths paper we consder the advanced step NMPC (asnmpc) controller that avods computatonal delays and t s capable of handlng model plant msmatch. The asnmpc solves the OCP n advanced, whch means that at the current tme t k and wth the measurements of the current states and manpulated varables, the predcton model s used to predct the states at the next tme perod t k+1 and the OCP for ths last perod s solved between t k and t k+1. Usng ths strategy the delays generated due to the computatonal tme are avoded, but there can be stll a msmatch between the states predcted and the measured values at t k+1, thus a rapd correcton usng NLP senstvty has to be done. If the parameters (p) of an optmzaton problem, whch n the case of the OCP correspond to the ntal condtons and dsturbances, are assocated wth artfcal constrants of the form x p p =, where x p s a varable, the NLP senstvty calculatons can be reduced to solve the lnear system gven by eq Note that ths s a lnear equaton n whch H L s the Hessan matrx of the Lagrange functon (L), A s the Jacoban matrx of the equalty constrants, V s a dagonal matrx, whch contans the dual varables (v), L s the Lagrange functon, c s a vector of equalty constrants, Z s a dagonal matrx whch contans all the varables of the problem, and λ are the Lagrange multplers for the equalty constrants. Equaton 11 s obtaned after applyng the chan rule over the frst order optmalty condtons of a constraned NLP problem when t s solved usng an nteror pont algorthm, such as the one mplemented n the solver IPOPT. These dervatves are taken wth respect to the parameters to obtan the senstvty of the varables (z,x p ). Also, the left-hand sde matrx corresponds to the KKT matrx at the optmal soluton whch s avalable after solvng the optmzaton problem. For a more detaled dscusson about asnmpc controller, ts propertes and NLP senstvty calculatons the reader s referred to the followng references. 5 7 H λ L zx L( z, x,, v) A I p p Δz xzlz (, x, λ, v) Lz (, x, λ, v) cz (, x) I Δ x p p xx p p p xp p p T T A c z x Δ λ x (, ) p p Δv V Z Δλ I = Δp (11) 91 DOI: 1.11/acs.ecr.6b111

8 Industral & Engneerng Chemstry Research Artcle Table 1. Model Parameters for Cases 1 and parameter value parameter value V 1.9 m 3 k h 1 v 1.5 m 3 /h E kj/kmol F {A,B,C,M} {36.3, 453.6,, 45.36} kmol/h C p,w 75.3 kj/kmol K C p, {A,B,C,M} {146.5, 75., 19.6, 81.7} kj/kmol K UA 3386 kj/h K T 4 C T w,n 15.5 C C (t =){A,B,C,M} {, 4.64,, } kmol m 3 ΔH rxn kj/kmol Along ths manuscrpt, we focus on NMPC and thus the OCP, after dscretzaton of the dfferental equatons, s defned as a large-scale NLP. The solver IPOPT s chosen for solvng ths NLP problem because t has been proven effectve for the type of formulatons that arse n chemcal processes 3,8 and t has been apply n NMPC controllers wth good results. 9 The IPOPT solver mplements a determnstc optmzaton algorthm based on the Newton s method for solvng the KKT condtons of the problem. Moreover, t uses a prmal-dual nteror pont algorthm, n whch the nequalty constrants are handled n the objectve functon ntroducng a logarthm barrer and a barrer parameter, and a flter lne search method for solvng the frst order optmalty condtons. sipopt s a toolbox that can be found as an extenson of IPOPT solver and that performs the NLP senstvty calculatons automatcally, eq 11. The only requrement for the user s to defne the artfcal constrants wthn the problem formulaton and a seres of suffxes used to communcate the problem wth the solver ndcatng whch of the varables are artfcal. For further nformaton about the solvers IPOPT and ts extenson sipopt the reader s referred to the references. 5,3 5. EXAMPLES Ths secton presents three examples that show the applcaton of the tunng algorthm descrbed n secton 3. All the optmzaton problems were formulated n Pyomo, 31 an optmzaton software mbedded n Python, and solved wth the nonlnear solver IPOPT, the NLP senstvty calculaton was performed wth the extenson of ths solver sipopt. The whole tunng algorthm was programed n Python Case 1: CSTR wth Two Control Objectves. Ths s an example adapted from ref 3, n whch a CSTR s used for the producton of propylene glycol, and t s desred to control the reactor temperature durng the start-up operaton and n the presence of dsturbances. The hydrolyss reacton of propylene oxde to produce propylene glycol s carred out wth excess of water, n the presence of methanol and usng a strong acd catalyst. The reacton s frst-order n propylene oxde concentraton. The dynamc model and operatonal constrants for ths example are gven by eq 1, where A s propylene oxde, B s water, C s propylene glycol, and M s methanol. Ths model s based on molar balances eq 1a and energy balances eq 1b assumng that the hold-up of coolng flud n the jacket s neglgble; also the parameters of the model are presented n Table 1. Here C s the molar concentraton of speces, r s the reacton rate, V s the reactor volume, ϑ s the stochometrc coeffcent of speces, v s the volumetrc feed flow rate, T s the reactor temperature, C p s the heat capacty, F s the molar flow rate, ΔH rxn s the reacton enthalpy, T w s the nlet temperature of the coolant flud, U s the global heat transfer coeffcent, and A s the heat transfer area. The objectve of ths control problem s to mantan an operatonal temperature of 63 C manpulatng the coolant flud feed 9 flow rate (m ẇ ). Note that the reactor do not start from ts steady state operaton pont, thus t s a start-up operaton and after h a dsturbance s ntroduced; more specfcally the nlet temperature drops lnearly from 4 to 1 C n an 1 h nterval. dc =ϑ r + C C v ( ), { A, B, C, M} dt V (1a) dt Q F C T T ΔH rv A B C M p ( ) ( ) {,,, }, rxn = dt CVC r = k exp E RT C A { A, B, C, M} p, (1b) (1c) = UA Q m wcp,w( Tw,n T) 1 exp m wcp,w (1d) T 8 C (1e) The real plant s consdered to be the same model descrbed by eq 1 but decreasng the frequency factor of the reacton rate expresson by %. Addtonal model plant msmatch s ntroduced addng whte nose of ampltude 1% to the measurements of the concentraton and temperature at each samplng perod. Accordng to the phase I of the algorthm proposed n secton 3 after defnng the type of control problem, the real plant model for smulaton and the predcton model t s necessary to defne the samplng tme, the control objectves and the KPIs that evaluate the closed-loop performance of the controller. For ths example a samplng tme of.1 h s selected whch s small enough consderng that the tme constant of ths process for changes around ts fnal steady state s approxmately.9 h. Two control objectves are defned for ths problem: a quadratc trackng of the temperature set-pont wthn the predcton horzon, eq 13, and a penalzaton of the drastc changes of the coolant feed flow rate wthn the control horzon, eq 14. Fnally, three KPIs are selected to evaluate the closed-loop behavor of the process: the ntegral square error (ISE) of the temperature trackng, the maxmum soluton tme of the OCP wthn the NMPC scheme and the average concentraton of propylene glycol (C) durng the tme wndow of the operaton. ϕ = 1 ϕ = = N ( T T ) sp p (13) = N 1 w ( Δm ) u (14) Usng these defntons the phase I of the algorthm s over, and one can proceed to execute phase II and III. Nevertheless, DOI: 1.11/acs.ecr.6b111

9 Industral & Engneerng Chemstry Research before dong so t s necessary to defne the horzons problem (HP) whch n ths case s the mnmzaton of the ISE of the temperature trackng, eq 15a, subject to a lower lmt n the average concentraton of propylene glycol ( CC ), eq 15b, toa upper lmt n the tme allowed for solvng (t sol ) the OCP, eq 15c, and to the nature of the predcton and control horzons, eq 15d. Note that every element of the optmzaton problem defned n eq 15 are KPIs of the NMPC closed-loop performance and a response surface s defned for each one after solvng the RS-KPI problem, n ths case we use a quadratc approxmaton for each functon. Examples of these response surface functons are presented n Fgure 6, whch are constructed for the fnal teraton of the algorthm and from top to bottom s the OCP maxmum soluton tme, the average concentraton of propylene glycol (C) and the ISE of the Fgure 6. Response surface for the KPIs n the case 1. temperature trackng. In addton, the quadratc fttng of the response surfaces s good enough for these cases producng a R statstc greater than.9 and, furthermore, ths functons capture the behavor of the KPIs as a functon of the horzons whch s not lnear nor monotonc. t= tf mn ( T T ) dt s.t. C t sol t= C τ = sp.35 kmol/m.1 h 3 Artcle (15a) (15b) (15c) Nu Np Np max = 5 (15d) After takng all these defnton nto account and executng phases II and III of the algorthm the fnal tunng parameters are N p = N u = 11, W 1 = , and W = For a step by step computaton of the objectve functon weghts, the reader s referred to the Appendx A. Frst of all, note that the fnal confguraton of predcton horzon and control horzon s not ncluded n the ntalzaton of H_Set, ths s a result of solvng the HP problem every tme the phase III of the algorthm s executed. In addton, wth every teraton of phase III the response surfaces of the KPIs are mproved by addng a new pont to the samplng space, and ths new pont s closer to the optmal soluton of the HP. Second of all, the weghts for the composed objectve functon are the result of phase II that executes the utopa trackng multobjectve approach for the confguraton N p = N u = 11 and scale all the objectves to have the same level of mportance. 5.. Case : CSTR wth Three Control Objectves. Ths example uses the same model and consderatons of the case 1 wth the only excepton that an addtonal objectve for the OCP s ntroduced and t s the maxmzaton of the propylene glycol concentraton at the fnal tme of the predcton, eq 16. As the utopa trackng approach consders all the objectves n the mnmzaton sense t s necessary to mnmze the negatve of the concentraton n order to maxmze t. Introducng ths addtonal objectve ncreases the complexty of the tunng algorthm as an addtonal weght has to be determned and, durng Phase II, an extra NMPC problem has to be solved. However, ths shows that the proposed tunng algorthm s capable of handlng as many objectves as the analyst decde to nclude even f t s a nonstandard objectve, such as eq 16 that represents a fnal cost. ϕ = C ( t = τn ) 3 C p (16) The results of executng the tunng algorthm wth ths change are clearly dfferent from those of the case 1 and are the followng: N p = 19, N u = 14, W 1 = , W = ,andW 3 =.376. Addng one extra objectve to the problem formulaton changes the predcton horzon, the control horzon and the weghts of the common objectves snce the prortes n the objectve functon and the velocty wth whch the controller response to dsturbances change. Comparng case 1 and case the value of W 1 does not change sgnfcantly but the value of W s reduced allowng more drastc and fast changes of the coolng flud feed flow rate to acheve a tghter temperature control and thus maxmze the concentraton of the desred product at the end of the predcton horzon, n fact the ISE of the temperature trackng s mproved by a.56% n case. Moreover, the horzon lengths for case are larger than for case 1 whch ntroduces more control actons durng the predcton horzon 93 DOI: 1.11/acs.ecr.6b111

10 Industral & Engneerng Chemstry Research Artcle The phase I of the algorthm uses the same ntalzaton for the H_Set as the prevous two cases and the controller s desgned for dsturbance rejecton usng as benchmark dsturbance a snusodal dsturbance n the ethanol feed composton of ampltude 5% and perod of 1 mn. Addtonal model plant msmatch s ntroduced by addng a random nose of ampltude 5% n the lqud hold-up values at each samplng perod. The samplng tme s chosen as.5 mn whch s close to the tme constant of the process for changes around ts steady state ( mn), but lower than the rse tme ( 6 mn). Four objectves are consdered for the OCP formulaton eq 17 among them s one economc objectve of proft maxmzaton (t ncludes the proft from dstllate D and the cost from the reboler duty Q R ), one trackng objectve of ethanol mole fracton n dstllate (x D EtOH ), and two penalzatons of the changes of the manpulated varables, the reflux rato (R) and the reboler duty (Q R ), wth respect to a reference value. Fnally, three KPIs are selected to evaluate the closedloop behavor of the process: the total economc proft, the maxmum soluton tme of the OCP wthn the NMPC scheme and the average ethanol mole fracton n dstllate. ϕ = 1 Np = CD C Q D Q R, (17) ϕ = Np = EtOH D, ( x x ) D sp (18) Fgure 7. Profles for the controlled varables (a) and the manpulated varable (b) for case 1 and case. ncreasng the robustness of the controller. The profles of the fnal tunng confguraton for the asnmpc controllers are shown n Fgure 7 and t also compares the results of the case 1 and case. In addton, Fgure 7 shows a tghter temperature control for case than for case 1 that s acheved wth faster and more drastc changes of the manpulated varable. Usng the tunng parameters obtaned from the algorthm proposed n ths paper t s possble to mantan the reactor temperature around ts setpont even n the presence of nose, dsturbances and model plant msmatch wthout drastc changes n the coolng flud flow rate Case 3: Extractve Dstllaton Column. Ths fnal example s a larger and more complex problem than the prevous two whch serves to show that the NMPC tunng algorthm proposed s capable of handlng hghly nonlnear models and actve nequalty constrants that produces complex nteractons of the tunng parameters of the controller. Ths case s the desgn of a NMPC controller wth economc orentaton for an extractve dstllaton column used n the separaton of the azeotropc mxture of water and ethanol usng glycerol as an entraner. More detals about ths case and a detal descrpton of the dynamc model used for predcton can be found n a prevous work of the authors. 33 In summary, the model s composed by a set of dfferental algebrac equatons that represent the mass balances, energy balances, phase equlbrum equatons, and hydraulc relatons for each stage of the column. Also, the system s subject to a mnmum purty constrant of the dstllate, whch s a molar fracton of ethanol greater or equal than 99.5%. 94 ϕ = 3 ϕ = 4 Nu = Nu = R, R,ref ( Q Q ) ( R R ) ref (19) () For executng phase II and III of the algorthm t s necessary to formulate the horzons problem (HP), whch s the maxmzaton of the economc proft subject to the ethanol purty constrant n dstllate and to the nature of the predcton and control horzon as t s shown n eq 1. Every element n the HP s a KPI of the closed loop behavor and thus t s approxmated wth a response surface solvng the RS-KPI problem. Examples of these response surfaces are presented n Fgure 8 whch are constructed for the fnal teraton of the algorthm and from top to bottom s the OCP maxmum soluton tme, the average ethanol percentage n dstllate and the economc proft. t= tf mn ( CD CQ)dt t= D s.t. x 99.5% t sol D EtOH τ =.5 mn max u p p N N N = 1 Q R (1a) (1b) (1c) (1d) After takng all these defntons nto account and executng phase II and III of the algorthm the fnal tunng parameters of the asnmpc controller are N p =8,N u =5,W 1 =.7, W = 5.3, W 3 =.1, and W 4 = Note that usng ths tunng algorthm the order of magntude of the objectve weghts can vary sgnfcantly due to the dfferences n scales of every objectve. For example, the economc objectve, eq 17, s on the order of 1 3, the mole fracton s expressed as a percentage DOI: 1.11/acs.ecr.6b111

11 Industral & Engneerng Chemstry Research Artcle Fgure 8. Response surface for the KPIs n the case 3. so ts order s of 1, the reboler duty s on the order of 1 and the reflux rato s on the order of 1 1. However, ths dfferences n the weghts allows a better prortzaton of the conflctng objectves presented n the composed objectve functon of the OCP. Fgure 9 shows a comparson of the closed loop profles usng the tunng parameters obtaned from the proposed algorthm and a set of arbtrary parameters defned by tral and error, as those defned n a prevous work. 33 Usng a tral and error approach s dffcult to defne the penalzaton weghts for the manpulated varables n order to use all of them to control a specfc varable and n ths case Fgure 9a and Fgure 9b show how poorly tuned penalzaton weghts drve all the control effort toward only one manpulated varable, the reflux rato, even when two varables are avalable. The proposed tunng Fgure 9. Profles for the case 3 and comparson of the asnmpc controller performance usng the tunng algorthm versus a tral and error alternatve. (a) Reboler duty, (b) reflux rato, and (c) ethanol mole fracton n dstllate. algorthm avods ths knd of behavor and defnes the composed objectve functon weghts such as all the parameters receve the same level of mportance and all the manpulated varables can be used to control the process. Also, the tunng algorthm for ths case ams to maxmze the economc proft of the process whle satsfyng the constrants and an ncrease of the 1.3% s obtaned. Note that ths mprovement n economc proft s obtaned even when the predcton and control horzons are smaller than those defned n the tral and error approach. 6. CONCLUSIONS AND PERSPECTIVES Ths Artcle presents a general tunng algorthm for NMPC controllers that conssts of three man phases. The frst one s 95 DOI: 1.11/acs.ecr.6b111

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #3: Systems of Nonlinear Equations and Optimization

10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #3: Systems of Nonlinear Equations and Optimization 10.34 Numercal Methods Appled to Chemcal Engneerng Fall 2015 Homework #3: Systems of Nonlnear Equatons and Optmzaton Problem 1 (30 ponts). A (homogeneous) azeotrope s a composton of a multcomponent mxture

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

REAL TIME OPTIMIZATION OF a FCC REACTOR USING LSM DYNAMIC IDENTIFIED MODELS IN LLT PREDICTIVE CONTROL ALGORITHM

REAL TIME OPTIMIZATION OF a FCC REACTOR USING LSM DYNAMIC IDENTIFIED MODELS IN LLT PREDICTIVE CONTROL ALGORITHM REAL TIME OTIMIZATION OF a FCC REACTOR USING LSM DYNAMIC IDENTIFIED MODELS IN LLT REDICTIVE CONTROL ALGORITHM Durask, R. G.; Fernandes,. R. B.; Trerweler, J. O. Secch; A. R. federal unversty of Ro Grande

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Lecture 20: November 7

Lecture 20: November 7 0-725/36-725: Convex Optmzaton Fall 205 Lecturer: Ryan Tbshran Lecture 20: November 7 Scrbes: Varsha Chnnaobreddy, Joon Sk Km, Lngyao Zhang Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer:

More information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

This column is a continuation of our previous column

This column is a continuation of our previous column Comparson of Goodness of Ft Statstcs for Lnear Regresson, Part II The authors contnue ther dscusson of the correlaton coeffcent n developng a calbraton for quanttatve analyss. Jerome Workman Jr. and Howard

More information

Chapter 13: Multiple Regression

Chapter 13: Multiple Regression Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS) Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

More information

VQ widely used in coding speech, image, and video

VQ widely used in coding speech, image, and video at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

An Interactive Optimisation Tool for Allocation Problems

An Interactive Optimisation Tool for Allocation Problems An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents

More information

Note 10. Modeling and Simulation of Dynamic Systems

Note 10. Modeling and Simulation of Dynamic Systems Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL

More information

Some modelling aspects for the Matlab implementation of MMA

Some modelling aspects for the Matlab implementation of MMA Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

Linear Feature Engineering 11

Linear Feature Engineering 11 Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19

More information

Negative Binomial Regression

Negative Binomial Regression STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...

More information

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

Second Order Analysis

Second Order Analysis Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to

More information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

Open Systems: Chemical Potential and Partial Molar Quantities Chemical Potential

Open Systems: Chemical Potential and Partial Molar Quantities Chemical Potential Open Systems: Chemcal Potental and Partal Molar Quanttes Chemcal Potental For closed systems, we have derved the followng relatonshps: du = TdS pdv dh = TdS + Vdp da = SdT pdv dg = VdP SdT For open systems,

More information

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law: CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and

More information

Lecture 12: Classification

Lecture 12: Classification Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna

More information

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:

More information

Supplementary Notes for Chapter 9 Mixture Thermodynamics

Supplementary Notes for Chapter 9 Mixture Thermodynamics Supplementary Notes for Chapter 9 Mxture Thermodynamcs Key ponts Nne major topcs of Chapter 9 are revewed below: 1. Notaton and operatonal equatons for mxtures 2. PVTN EOSs for mxtures 3. General effects

More information

Solution Thermodynamics

Solution Thermodynamics Soluton hermodynamcs usng Wagner Notaton by Stanley. Howard Department of aterals and etallurgcal Engneerng South Dakota School of nes and echnology Rapd Cty, SD 57701 January 7, 001 Soluton hermodynamcs

More information

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc

More information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

2016 Wiley. Study Session 2: Ethical and Professional Standards Application

2016 Wiley. Study Session 2: Ethical and Professional Standards Application 6 Wley Study Sesson : Ethcal and Professonal Standards Applcaton LESSON : CORRECTION ANALYSIS Readng 9: Correlaton and Regresson LOS 9a: Calculate and nterpret a sample covarance and a sample correlaton

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

Three-Phase Distillation in Packed Towers: Short-Cut Modelling and Parameter Tuning

Three-Phase Distillation in Packed Towers: Short-Cut Modelling and Parameter Tuning European Symposum on Computer Arded Aded Process Engneerng 15 L. Pugjaner and A. Espuña (Edtors) 2005 Elsever Scence B.V. All rghts reserved. Three-Phase Dstllaton n Packed Towers: Short-Cut Modellng and

More information

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN

COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department

More information

Physics 5153 Classical Mechanics. Principle of Virtual Work-1

Physics 5153 Classical Mechanics. Principle of Virtual Work-1 P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

Supporting Information

Supporting Information Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to

More information

Appendix B. The Finite Difference Scheme

Appendix B. The Finite Difference Scheme 140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

Chapter 11: Simple Linear Regression and Correlation

Chapter 11: Simple Linear Regression and Correlation Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests

More information

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium? APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare

More information

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results. Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson

More information

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:5-5: Copyrght 25 Dan Dll (dan@bu.edu) Department

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

Comparison of Regression Lines

Comparison of Regression Lines STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence

More information

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

SIO 224. m(r) =(ρ(r),k s (r),µ(r))

SIO 224. m(r) =(ρ(r),k s (r),µ(r)) SIO 224 1. A bref look at resoluton analyss Here s some background for the Masters and Gubbns resoluton paper. Global Earth models are usually found teratvely by assumng a startng model and fndng small

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Solving Nonlinear Differential Equations by a Neural Network Method

Solving Nonlinear Differential Equations by a Neural Network Method Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,

More information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions to exam in SF1811 Optimization, Jan 14, 2015 Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable

More information

ADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING

ADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING 1 ADVANCED ACHINE LEARNING ADVANCED ACHINE LEARNING Non-lnear regresson technques 2 ADVANCED ACHINE LEARNING Regresson: Prncple N ap N-dm. nput x to a contnuous output y. Learn a functon of the type: N

More information

Tracking with Kalman Filter

Tracking with Kalman Filter Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,

More information

1 Convex Optimization

1 Convex Optimization Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

Process Modeling. Improving or understanding chemical process operation is a major objective for developing a dynamic process model

Process Modeling. Improving or understanding chemical process operation is a major objective for developing a dynamic process model Process Modelng Improvng or understandng chemcal process operaton s a major objectve for developng a dynamc process model Balance equatons Steady-state balance equatons mass or energy mass or energy enterng

More information

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

On the correction of the h-index for career length

On the correction of the h-index for career length 1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat

More information

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

( ) 1/ 2. ( P SO2 )( P O2 ) 1/ 2.

( ) 1/ 2. ( P SO2 )( P O2 ) 1/ 2. Chemstry 360 Dr. Jean M. Standard Problem Set 9 Solutons. The followng chemcal reacton converts sulfur doxde to sulfur troxde. SO ( g) + O ( g) SO 3 ( l). (a.) Wrte the expresson for K eq for ths reacton.

More information

Lecture 21: Numerical methods for pricing American type derivatives

Lecture 21: Numerical methods for pricing American type derivatives Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

Adiabatic Sorption of Ammonia-Water System and Depicting in p-t-x Diagram

Adiabatic Sorption of Ammonia-Water System and Depicting in p-t-x Diagram Adabatc Sorpton of Ammona-Water System and Depctng n p-t-x Dagram J. POSPISIL, Z. SKALA Faculty of Mechancal Engneerng Brno Unversty of Technology Techncka 2, Brno 61669 CZECH REPUBLIC Abstract: - Absorpton

More information

Analytical Chemistry Calibration Curve Handout

Analytical Chemistry Calibration Curve Handout I. Quck-and Drty Excel Tutoral Analytcal Chemstry Calbraton Curve Handout For those of you wth lttle experence wth Excel, I ve provded some key technques that should help you use the program both for problem

More information

On a direct solver for linear least squares problems

On a direct solver for linear least squares problems ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set

More information

Digital Signal Processing

Digital Signal Processing Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

The optimal delay of the second test is therefore approximately 210 hours earlier than =2.

The optimal delay of the second test is therefore approximately 210 hours earlier than =2. THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple

More information