Application of IHMPC to an unstable reactor system: study of feasibility and performance

Size: px
Start display at page:

Download "Application of IHMPC to an unstable reactor system: study of feasibility and performance"

Transcription

1 Proceedngs of the 9th Internatonal Symposum on Dynamcs and Control of Process Systems (DYCOPS 21), Leuven, Belgum, July 5-7, 21 Mayuresh Kothare, Moses Tade, Alan Vande Wouwer, Ilse Smets (Eds.) MoAT2.2 Applcaton of IHMPC to an uable reactor system: study of feasblty and performance Alejandro H. González Eduardo J. Adam Maran G. Marcoveccho Darc Odloak Itute of Technologcal Development for the Chemcal Industry (INTEC), CONICET-UNL. Gemes 345, (3) Santa Fe - Argentna. alejgon,eadam@santafe-concet.gov.ar INGAR- Ituto de Desarrollo y Dseo, Avellaneda 3657, (3) Santa Fe - Argentna. marangm@santafe-concet.gov.ar Department of Chemcal Engneerng, Unversty of São Paulo, Av. Prof. Lucano Gualberto, trv 3 38, São Paulo, Brazl. odloak@usp.br Abstract: Almost all the theoretcal aspects of Model Predctve Control (MPC), such as stablty, recursve feasblty and even the optmalty are now well establshed for both, the nomnal and the robust case. The stablty and recursve feasblty are usually guaranteed by means of addtonal termnal corants, whle the optmalty s acheved consderng closed-loop predctons. However, these sgnfcant mprovements are not always applcable to real processes. An nterestng case s the control of open-loop uable reactor systems. There, the tradtonal nfnte horzon MPC (IHMPC), whch cotutes the smplest strategy ensurng stablty, needs to nclude an addtonal termnal corant to cancel the uable modes, producng n ths way feasblty problems. The termnal corant could be an equalty or an ncluson corant, dependng on the local controller assumed for predctons. In both cases, however, a prohbtve length of the control horzon s necessary to produce a reasonable doman of attracton for real applcatons. In ths work, we propose an IHMPC formulaton that has maxmal doman of attracton (.e. the doman of attracton s determned by the system and the corants, and not by the controller) and s sutable for real applcatons n the sense that t accounts for the case of output trackng, t s offset free f the output target s reachable, and mnmzes the offset f some of the corants become actve at steady-state. Keywords: model predctve control, doman of attracton, uable reactor. 1. INTRODUCTION When a coraned open-loop uable system, as an uable reactor system, s attempted to be controlled the guarantee of recursve feasblty and coraned stablty s a hghly desrable controller property. Frst, the maxmal stablzable sets assocated to the system equlbrum should be carefully determned snce, opposte to what happens wth stable systems, nput corants could make mpossble the rejecton of large dsturbances, ndependently of the controller. Then, a controller wth guaranteed stablty that explctly takes nto account these lmtatons should be desgned. In ths context, MPC appears to be the most sutable opton. In fact, the stablty, feasblty and even optmalty of MPC s now well establshed n the theoretcal aspects (Mayne et al. (2), Rawlngs and Mayne (29)). Standard approaches use the dual-mode predcton paradgm (Scokaert and Rawlngs (1998)) n conjuncton wth an nfnte horzon. Wthn ths paradgm t s assumed that a fxed uncoraned feedback K (local controller) proceeds for predctons beyond the control horzon. stablzng n ths way the uable modes. In ths context, a major obstacle s to establsh a trade-off between the desrable volume of the doman of attracton (the set of states for whch the controller can generate a feasble nput), the overall complexty (computatonal cost), and the achevable performance for a gven control horzon (degree of optmalty). Assumng that the control horzon s chosen small for computatonal reasons, the doman of attracton s domnated by the aggressveness of the fxed uncoraned feedback, snce addtonal (termnal) corants are needed to assure the feasblty of the local control law. For stable systems, the null local controller K = (Rawlngs and Muske (1993)), whch represents the poorest tuned local controller, produces the maxmal doman of attracton. Ths s the case of the classcal nfnte horzon MPC (IHMPC). However, for the general case of uable systems, a termnal corant that cancels the uable modes s needed (as they cannot be steered to the orgn by the proposed local null controller), producng agan a severe reducton of the resultng doman of attracton. Nagrath et al. (22) presented an nterestng example of a open-loop uable jacketed chemcal reactor (CSTR) controlled by MPC. The objectve s to keep the Copyrght held by the Internatonal Federaton of Automatc Control 27

2 temperature of the reactng mxture coant at a desred value, whle the dsturbances to the system nclude the feed temperature and the jacket feed temperature and the only manpulated varable s the jacket flow rate. For ths knd of system, t s usual to adopt a cascade control structure: an nner-loop for the control of the jacket temperature and an outer-loop for the control of the reactor temperature. The authors compared three dfferent controllers: a classcal cascade controller, a fnte horzon MPC and an IHMPC. The output performance s clearly better for the MPC strateges, whle only the IHMPC assures stablty. As the authors declared, the problem wth the IHMPC s that to mplement approprately the cancellaton of the uable modes (termnal corant) a prohbtve large control horzon s needed. Agan, the problem of a reduced doman of attracton for small control horzons arses. More recently, González and Odloak (29) reformulates the orgnal IHMPC to allow an augmented doman of attracton for both, stable and uable systems. The man dea was to nclude an approprate set of slack varables nto the MPC optmzaton problem that, together wth some model formulaton propertes, allows a maxmal closed-loop doman of attracton (.e., the doman of attracton s determned by the system and the corants, and not by the controller). Ths paper proposes the study of the applcaton of IHMPC to an uable reactor system n terms of the doman of attracton and the output performance. Furthermore, a generalzaton of the IHMPC proposed n González and Odloak (29) s presented, and some steady state optmalty propertes, related to the capablty of the controller to account for unreachable output references, are dscussed. Notaton: vector (a, b) denotes a T b T T ; for a gven λ, λx = {λx : x X}. For a symmetrc postve defnte matrx P, x P = x T P x denotes the weghted Eucldean norm. Matrx I n R n n denotes the dentty matrx. n,m R n m denotes the null matrx. Consder a R na, b R nb and a set Γ R na+nb, then { the projecton operaton s defned as P roj a (Γ) = a R na : b R nb, (a, b) Γ }. Gven two sets S 1, S 2, the set S 1 \S 2 s defned as S 1 \S 2 = {x : x S 1 and x / S 2 }. 2. REACTOR SYSTEM Consder a contnuous strred-tank reactor (CSTR), n whch an exothermc adabtc rreversble frst-order reacton (A B) s descrbed by the followng non-lnear state equatons (Nagrath et al. (22), Russo and Bequette (1996)): ẋ 1 = q + φk(x 2 )x 1 + qx 1f (1) ẋ 2 = βφk(x 2 ) x 1 (q + δ)x 2 + δx 3 + qx 2f (2) ẋ 3 = δ 1 δδ 2 x 2 δ 1 (q c + δδ 2 )x 3 + δ 1 q c x 3f (3) In these equatons x 1 s the dmensonless concentraton of reactant A, x 2 s the dmensonless reactor temperature, x 3 s the dmensonless jacket temperature, x 1f s the dmensonless feed concentraton of reactant A to the reactor, x 2f s the dmensonless feed temperature, x 3f s the dmensonless jacket feed temperature and q c s the jacket flow rate. The state vector s defned as x := x 1 x 2 x 3 T, whle x 1f, x 2f and x 3f are the possble dsturbances to the reactor. In ths case, x 1f s consdered coant, and then the dsturbance vector wll be gven by l := x 2f x 3f T. Clearly, the set of equatons presented before s nonlnear. Eq. (1) represents the dynamc materal balance for the reactant A, Eq. (2) represents the dynamc energy balance nsde the CSTR, and Eq. (3) represents the dynamc energy balance around the coolng jacket. For the three equatons, the usual assumptons of coant volume, perfect mxng and coant physcal parameters are made. The tradtonal operaton of a CSTR conssts n an ndrect control of concentraton by means of the control of the reactor temperature (x 2 ), usng the coolng jacket flow rate (q c ) as manpulated varable. However, as Russo and Bequette (1996) and Russo and Bequette (1998) remark, a multplcty behavor could be found for the three-state CSTR model when q c s the manpulated varable. The exstence of the nput multplctes n the system can severely degrade the performance of controlled output and moreover, unfeasble operaton regons can appear. For ths reason, the selecton of an adequate operaton pont s a key for the correct operaton of the reactor. Several authors studed and derved condtons for steadystate multplctes for a CSTR. The parameters chosen n ths work are those shown n Russo and Bequette (1998), whch exhbt open-loop uable behavor for a range of reactor temperatures bounded by the lmt ponts: φ =.72, β = 8., δ =.3, γ = 2, q = 1., δ 1 = 1, δ 2 = 1., x 1f = 1., x 2f =. and x 3f = MODELING THE SYSTEM AND CONSTRAINTS The am of ths secton s to dscuss both, a lnear predcton model and the way the corants affect t when uable systems are attempted to be descrbed. As was shown n Nagrath et al. (22) block dagonal transton matrces, whch separate the uable from the stable modes of the systems, are desrable to represent uable systems for IHMPC. In ths context, a sutable model s as follows: x (k + 1) x un (k + 1) x st (k + 1) = I n F un x (k) x un (k) F st x st (k) y (k) = Υ Υ un Υ st x (k) x un (k) x st (k) +, B B un B st u (k) (4) where x X R n, n = max (nu, ny), represents the ntegratng modes artfcally nduced by the ncremental form of the model, x st X st R ns represents the stable modes, x un X un R nun represents the orgnal uable modes of the system, u (k) = u (k) u (k 1) R nu, y (k) R ny. Ths partcular block dagonal form of model (4) can be obtaned from the step response of the transfer functon model (González and Odloak (29), Rodrgues and Odloak (23)), or by an approprate smlarty transformaton of a gven state space model. The system has nun and ns uable and stables poles, respectvely. In addton, n s the number of ntegratng Copyrght held by the Internatonal Federaton of Automatc Control 271

3 modes (ntroduced by the ncremental form of the model) that s equal to the maxmum between the number of system nput and outputs. Matrx Υ s gven by Υ = In n,(n ny) f nu > ny, and by Υ = I n f nu ny. Matrces Υ un and Υ st account for the effect of the uable and stable states n the output. On the other hand, the nput feasble set U s defned as follows: U = { u : u max u u max and u mn u (k 1) u max }, where u (k 1) s the past value of the nput u. In addton, t s assumed that the states x = ( x, x un, x st) are coraned to belong to a set X, gven by X = X X un X st. Here, ths set s defned by the operatng wndow of the process. Set X must satsfy the nput corants, as follows: B u mn x B u max. Remark 1. Notce that the present formulaton takes a specal care of nput ncrements. Frstly, the nput ncrement s consdered as nput n the system (4), ead of the nput tself. Ths property gves an alternatve way to acheve an offset-free control, n comparson to the target calculaton strategy used n Nagrath et al. (22), that needs a separate optmzaton problem to be solved. Secondly, nput ncrement corants are ncluded together wth the nput corants. Ths cotutes an mportant feature of real processes usually dsregarded by the typcal MPC formulatons, and contrbutes to a better descrpton of the whole system, snce ths knd of corants lmts the maxmal doman of attracton of the system, as can be seen n the next sub-secton. 3.1 Characterzaton of the coraned steady states of the system Wthout loss of generalty t s assumed here that nu = ny = n (for non-square systems the procedure to characterze the steady state s smlar). For a gven output target (or set-pont) y sp, any steady state of the system ( ) x s, x un s, x st s, u s assocated wth ths target output should satsfy the followng condton I n I n F un I nun F st I ns Υ Υ un Υ st x s x un s x st s u s = B B un B st y sp. (5) From equaton (5), and assumng that rank ( B ) = nu, t follows that any steady state of the system are gven by ( ) x s, x un s, x st s, u s = (y sp,,, ). Ths last condton represents a useful property of the specfc model formulaton (4), as t says that any possble steady state can be condensed n a sngle state component ( xs), whle the other states are null 1. Now, snce the system s subject to corants, t should 1 Notce that the steady state s condensed n the state component that was artfcally ncluded n model (4) be steered to those steady states that satsfy the corants. The set of these admssble steady states s defned as 2 X s = { x s = ( x s, x un s, x st ) s X : x s X, x un s {} and x st s {} }. Notce that from the latter defnton, t follows that the set of feasble output steady states, y s = Cx s = x s, s drectly gven by X (ths means that any feasble ntegratng state s a steady state of the system). Remark 2. It s frequent n real applcatons that the desred output set-pont y sp s not reachable, that s, the desred steady state x s = (y sp,, ) s not n X s. Ths could be caused by a msmatch between the model used to compute the optmal steady state and the model used to compute the dynamc forecast. Despte n ths case an output offset wll necessarly appear, ths should not be a cause of ablty. 3.2 Characterzaton of the stablzable sets for the non-stable states A remarkable characterstc of the coraned uable systems s that there exsts a lmted set of non-stable states, called maxmal stablzable set, out of whch the system cannot be stablzed by any controller. It s useful at ths pont to group the ntegratng and the pure uable modes nto a sngle vector, x = ( x, x un), of non-stable states. In ths way system (4) can be rewrtten as x (k + 1) F x st = (k + 1) F st x (k) x st + (k) B B st u (k) y (k) = Υ Υ st x (k) x st, (k) where B T = B T B unt, F = dag (I n, F un ), Υ = Υ Υ un. Now we explot the steady state characterzaton presented n the last secton n order to defne some useful sets. Frst, let us consder the (equlbrum) set of feasble non-stable steady states, Xs = P roj x (X s ). Based on ths defnton, t s possble to defne the set of non-stable states that can be admssbly steered, by means of an admssble sequence of j control actons, from X = X X un to the equlbrum set X St j ( X, Xs ) = s : {x () X : for all k =,,j 1, u (k) U such that x (k) X and x (j) Xs }. Ths set (called the stablzable set for the non-stable states) s a control nvarant set for states x, for all j 1 (see Lemma 1 n González and Odloak (29)). Remark 3. As can be seen n Remark 1 of González and Odloak (29), the set St j (X, Xs ) tends to a lmted set as the number of steps j tends to. So, by ncreasng the ndex j up to N, n such a way that St N+1 (X, Xs ) St (X, Xs ), t s possble to N 2 Notce that, as was already sad, X s such that the nput corants are fulflled (.e., B u mn x B u max) Copyrght held by the Internatonal Federaton of Automatc Control 272

4 defne the largest possble doman of attracton for the noable states as Θ = St N (X, Xs ). Remark 4. If we now defne Θ = {x X : x Θ }, then ths set s the maxmal doman of attracton of any controller (largest possble doman of attracton of the system) snce t does not depend on the selected control law, but on the nature of the system and the states, as well as on the nput corants. Remark 5. The equlbrum set for the pure uable states s gven by Xs un = P roj x un (X s ) = {}. So, t s possble to defne the stablzable set for the uable states as St un j (X un, {}). Furthermore, the largest possble doman of attracton for the uable states s gven by Θ un = P roj x un (Θ ). 4.1 Classcal IHMPC 4. IHMPC FORMULATIONS As was establshed n Nagrath et al. (22), the man advantage of the nfnte over the fnte horzon s the elmnaton of the requrement of tunng for nomnal stablty. For uable systems, however, the non-stable modes must be canceled to acheve coraned stablzablty of the predctons (a corant s ncluded that forces ths cancellaton at the end of the control horzon m). For trackng a non-zero target, the classcal IHMPC formulaton adapted to model (4) s as follows: Problem 1 mn V k = u k subject to: m 1 j= { x (k + j k) x sp 2 Q + u (k + j k) 2 R u (k + j k) U, j =,, m 1 } + x st (k + m k) 2 P x (k + m k) y sp = (6) x un (k + m k) = (7) where x sp = (y sp,, ), x (k k) = x (k), u (k + j k) s the control move computed at tme k to be appled at tme k+j, m s the control horzon, Q and R are postve weghtng matrces of approprate dmenson, y sp s the output reference, and u k = ( u (k k),, u (k + m 1 k)). Because of the termnal corants (6) and (7), the cost of the IHMPC can be wrtten as a fnte horzon cost wth a termnal penalty term (the termnal matrx P s computed by solvng the Lyapunov equaton P = Q + F stt P F st ). Two man problems arse when ths formulaton s ntended to be appled. The doman of attracton for the non-stable modes s gven by the m-stablzable set St m (X, {}), because of corants (6) and (7). Ths set s very small, manly f the practcal case of nput ncrement corants s consdered, because t consders as target set the orgn (ead of the equlbrum set ) and because t consders only m steps to reach ths target set. On the other hand, f an unreachable set-pont s used, the cost becomes unbounded and feasblty/stablty s lost. Xs 4.2 IHMPC wth large doman of attracton A possble soluton to these problems s the ncluson of slack varables to relax the termnal corants. In González and Odloak (29) a formulaton was presented that accounts for the problem of ncludng slack varables nto the nfnte horzon MPC optmzaton problem, wth the fnal objectve of enlargng the resultng doman of attracton. The man dea of ths approach was to separate the convergence (man objectve of an IHMPC) n two steps: the frst one s devoted to steer the non-stable state x to the set St m (X, Xs ) n a fnte number of steps; whle the second one s devoted to steer the ntegratng and stable states to the desred equlbrum pont (( x, x st) (y sp, ) ). The slack varables assure the feasblty at any tme and for any non-stable state n the maxmal doman of attracton St (X, Xs ). As a result, the controller has the largest possble doman of attracton,.e. the doman of attracton s gven by Θ, whch does not depend on the control law. 4.3 A novel IHMPC wth large doman of attracton The strategy presented n González and Odloak (29) has some lmtatons, snce t does not deal wth an arbtrary number of uable states. A possble generalzaton of ths strategy conssts of usng a generalzed Mnkowsk functonal, assocated to the stablzable sets St un j (X un, {}), for m j N (where N s as n Remark 3), as the cost functon of a frst optmzaton problem of a two-stage MPC formulaton. Before presentng the novel IHMPC formulaton, we ntroduce the followng defntons: Defnton 1. Gven a convex set S X, the Mnkowsk functonal Ψ S assocated to S s defned as Ψ S (x) = nf{µ : x µs}. To see the propertes of the functon Ψ S (x), see Blanchn (1999). Consder now a sequence of -symmetrc convex sets S 1 S 2... S n. Then, a correspondng sequence of parwse dsjont sets, Υ +1 = nt(s +1 )\nt(s ), = 1,..., n 1, whch are a partton of S n, could be defned. Now, followng the dea of the Mnkowsk functonal presented above, t s possble to assocate a functon to the whole sequence, n such a way that the level surfaces of ths new functonal are the contours of the sets S : Defnton 2. Gven a sequence of convex sets S 1 S 2... S n, the generalzed Mnkowsk functonal Ψ {S1,...,S n} assocated to S s defned as { ΨνS Ψ {S1,...,S n}(x) = (x) f x Υ +1, = 1,..., n 1 Ψ ν1s 1 (x) f x S 1 where the coeffcents ν are such that ν S ν +1 S +1. Remark 6. To obtan the coeffcents ν the followng optmzaton problem must be solved: ν = mn{ν : νs ν +1 S +1 }, for = 1,..., n 1, and ν n = 1. Once the coeffcent are obtaned, the sequence of sets ν S are such that ν S ν +1 S +1, for = 1,..., n 1. Copyrght held by the Internatonal Federaton of Automatc Control 273

5 The generalzed Mnkowsk functonal appled to uable stablzable sets has the followng propertes, whch are useful for the MPC formulaton: Ψ {St un m,,st un N } (x un ) s greater than zero for all non-null values of x un, Ψ {St un m,,st un N } (x un ) s null f and only f x un s null, and the contour of the stablzable sets {St un m, St un N } are level surfaces of the functonal Ψ {St un m,,st un N } (x un ). Based on the above defntons, the proposed IHMPC formulaton, whch conssts of the followng optmzaton problems that are solved sequentally: Problem 2a Problem 2b mn u b,k,δ k,δun k mn u a,k V a,k = Ψ {St un subject to: m,,st un N } (x un (k + m k)) u a (k + j k) U, j =,, m 1 V b,k = m 1 j= + u b (k + j k) 2 R subject to: u b (k + j k) U, j =,, m 1 { x (k + j k) x sp + δ (k, j) 2 Q } + x st (k + m k) 2 P + δ k 2 S x (k + m k) y sp + δ k = (8) x un (k + m k) + F unm δk un = (9) Ψ {St un m,,st un N } (x un (k + m k)) Ψ (1) where S s a postve( weghtng matrces ) of approprate dmenson, δ (k, j) = δk, F unj δk un, are slack varables, and Ψ s the optmal cost of Problem 2a. Because of the slacked termnal corants (8) and (9), the cost of ths IHMPC can be wrtten as a fnte horzon cost wth a termnal penalty term, as t s done n a classcal IHMPC. Corant (1) forces the uable states to reman n the stablzable set determned by Problem 2a. The followng algorthm produces a stablzng control law wth a doman of attracton gven by Θ: Algorthm 1. Solve Problem 2a and pass the optmal value of the cost to Problem 2b. Implement the frst control acton u b (k k). Also, the control sequence obtaned from the executon of Algorthm 1 at successve tme steps drves the output of the closed loop system asymptotcally to a pont that mnmzes δk 2 (partcularly, f the output set-pont S s reachable, the output of the closed loop system s asymptotcally steered to t wthout offset). Remark 7. The termnal corant for the uable and ntegratng states n Problem 2b can be wrtten as C y sp x (k) δ C un k u b,k = F unm (x un (k) δ un k ) where C = B B B, C un = F unm 1 B un F unm 2 B un B un. So, wth ths two-stage formulaton, the control horzon m should be, large enough to assure that matrx rank. C T C unt T s full 5. APPLICATION TO THE UNSTABLE REACTOR The am of the smulaton results s to compare the performance and feasblty of the proposed formulaton wth the classcal IHMPC, when the uable reactor of secton 2 s consdered. The objectve s to control one output varable (reactor temperature) manpulatng one nput varable (jacket flow rate). Usng Taylor seres expanson and a convenent transformaton, the followng dagonalzed dscrete tme lnear model s obtaned (T=.5): A =.9531, B = and C = The nput corants are gven by: u max = 1.32, u mn =, u max =.1. The nput ncrement bounds are chosen small to clearly show ts effect on the controllers doman of attracton. The tunng parameters of the proposed IHMPC are: Q = 5, R =.1 and S = The coeffcents ν of the generalzed Mnkowsk functonal used for Problem 2a are gven by: ν 5 = 1.8, ν 6 = 1.5, ν 7 = 1.4, ν 8 = 1.3, ν 9 = 1.15 and ν 1 = 1. The tunng parameters of the classcal IHMPC are: Q = 5,R =.1. Frst, we analyze the doman of attracton for the noable modes of both controllers. As was already sad, the doman of attracton of the IHMPC depends on the control horzon, and t s gven by St m (X, {}). Fgure 1 shows these sets for m = 1, m = 2, m = 24, m = 28 and m = 3 (dashed-lne). On the other hand, the doman of attracton of the proposed controller s the maxmal doman of attracton of the system (and so, t does not depend on the control horzon), and t s gven by St 15 (X, Xs ) (sold-lne). Notce that for m > 28 the doman of attracton of the IHMPC remans almost the same as the one obtaned wth m = 28 and furthermore, ths maxmal set s smaller than the maxmal doman of attracton of the system. Ths shows that f nput ncrement corants are consdered, the doman of attracton of the classcal IHMPC could not be the largest possble, even for very large control horzons. Now, the output performance of both controllers are compared. Frst, a state dsturbance s smulated, such that the orgnal non-stable states s n St 7 (X, Xs ). The dsturbance s gven by: x() = T, whch correspond to the followng dsturbance n the orgnal state varables: concentraton of reactant =.12, reactor temperature =.23 and jacket temperature =.25 (wrtten as devaton varables). The proposed controller steers frst the system to St m (X, Xs ), wth m = 5, n two steps, and then regulates the system to the desred equlbrum pont. Fgure 2 shows the evoluton of the non-stable states (sold-lne and crcles). On the other hand, the classcal IHMPC needs a control horzon equal Copyrght held by the Internatonal Federaton of Automatc Control 274

6 Fg. 1. Doman of attracton for both, the proposed controller and the classcal IHMPC. Fg. 3. Input, nput ncrement and output responses for a set-pont change. new IHMPC formulaton was presented that explots the propertes of a partcular model structure and exhbts the largest possble doman of attracton. As other recent formulatons, t guarantees recursve feasblty and stablty for trackng both, reachable and unreachable output set-ponts. Furthermore, n the latter case, the resultng controller steers the system to an admssble statonary output that mnmzes the dstance to the desred setpont, wthout the necessty of a target calculaton stage. Fg. 2. Non-stable state evoluton to 3 to account for ths dsturbance. Fgure 2 shows the non-stable state evoluton for the IHMPC and m = 15 (dashed-lne and crcles), where t can be seen that the corants are volated on the rght hand sde of the fgure. In a second stage, a set-pont change of.1 s smulated. A control horzon of m = 5 was selected for the proposed controller, whle a control horzon of m = 9 and m = 12 was selected for the IHMPC n order to make t feasble. Fgure 3 shows the tme responses, where t can be seen that the proposed controller has a slghtly better performance. Fnally, a set-pont change of.35 s smulated, whch s an unreachable target (t corresponds to an unreachable equlbrum state x sp = 1.77 T ). In ths case, the IHMPC cannot be used, whle the proposed controller, because of the effect of the slack varables, steers the system to a feasble pont that mnmzes the dstance from the desred set-pont. Fgure 2 shows the non-stable state evoluton (dotted-lne and crcles), together wth the unreachable equlbrum state (crcle-star). 6. CONCLUSION A study was developed of the capablty of IHMPC to account for uable reactor systems. Performance and feasblty (together wth stablty) was studed, and a REFERENCES Blanchn, F. (1999). Set nvarance n control. Automatca, 35, González, A.H. and Odloak, D. (29). Enlargng the doman of attracton of stable mpc controllers, mantanng the output performance. Automatca, 45, Mayne, D., Rawlngs, J., Rao, C., and Scokaert, P. (2). Coraned model predctve control: Stablty and optmalty. Automatca, 36, Nagrath, D., Prasad, V., and Bequette, W. (22). A model predctve formulaton for control of open-loop uable cascade systems. Chemcal Engneerng Scence, 57, Rawlngs, J. and Mayne, D.Q. (29). Model Predctve Control: Theory and Desgn. Nob Hll Publshng. Rawlngs, J. and Muske, K. (1993). The stablty of coraned recedng horzon control. IEEE Trans. on Autom. Control, 38, Rodrgues, M. and Odloak, D. (23). Mpc for stable lnear systems wth model uncertanty. Automatca, 39, Russo, L.P. and Bequette, W. (1996). Effect of process desgn on the open-loop behavor of a jacketed exothermc cstr. Computers chem. Engng., 2, Russo, L.P. and Bequette, W. (1998). Operablty of chemcal reactors: multplcty behavor of a jacketed styrene polmerzaton reactor. Chemcal Engneerng Scence, 53, Scokaert, P.O.M. and Rawlngs, J.B. (1998). Coraned lnear quadratc regulaton. IEEE Trans. on Autom. Control, 43, Copyrght held by the Internatonal Federaton of Automatc Control 275

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

Robust Model Predictive Control

Robust Model Predictive Control Robust Model Predctve Control Formulatons of robust control [1] he robust control problem concerns to the control of plants that are only approxmately nown. Usually, t s assumed that the plant les n a

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

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

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

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

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

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

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

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

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

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

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

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

THE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS

THE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS Copyrght 22 IFAC 5th rennal World Congress, Barcelona, Span HE GUARANEED COS CONROL FOR UNCERAIN LARGE SCALE INERCONNECED SYSEMS Hroak Mukadan Yasuyuk akato Yoshyuk anaka Koch Mzukam Faculty of Informaton

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

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

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

A PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY.

A PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY. Proceedngs of the th Brazlan Congress of Thermal Scences and Engneerng -- ENCIT 006 Braz. Soc. of Mechancal Scences and Engneerng -- ABCM, Curtba, Brazl,- Dec. 5-8, 006 A PROCEDURE FOR SIMULATING THE NONLINEAR

More information

CHAPTER III Neural Networks as Associative Memory

CHAPTER III Neural Networks as Associative Memory CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people

More information

Control of Uncertain Bilinear Systems using Linear Controllers: Stability Region Estimation and Controller Design

Control of Uncertain Bilinear Systems using Linear Controllers: Stability Region Estimation and Controller Design Control of Uncertan Blnear Systems usng Lnear Controllers: Stablty Regon Estmaton Controller Desgn Shoudong Huang Department of Engneerng Australan Natonal Unversty Canberra, ACT 2, Australa shoudong.huang@anu.edu.au

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

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

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

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

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

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

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of

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

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

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

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

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: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem. prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

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

The equation of motion of a dynamical system is given by a set of differential equations. That is (1)

The equation of motion of a dynamical system is given by a set of differential equations. That is (1) Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence

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

Dynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)

Dynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence) /24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes

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

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

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

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

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Implicit Integration Henyey Method

Implicit Integration Henyey Method Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure

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

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

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

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function A Local Varatonal Problem of Second Order for a Class of Optmal Control Problems wth Nonsmooth Objectve Functon Alexander P. Afanasev Insttute for Informaton Transmsson Problems, Russan Academy of Scences,

More information

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system. Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

More information

(Online First)A Lattice Boltzmann Scheme for Diffusion Equation in Spherical Coordinate

(Online First)A Lattice Boltzmann Scheme for Diffusion Equation in Spherical Coordinate Internatonal Journal of Mathematcs and Systems Scence (018) Volume 1 do:10.494/jmss.v1.815 (Onlne Frst)A Lattce Boltzmann Scheme for Dffuson Equaton n Sphercal Coordnate Debabrata Datta 1 *, T K Pal 1

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

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

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Feb 14: Spatial analysis of data fields

Feb 14: Spatial analysis of data fields Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s

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

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

Electrical double layer: revisit based on boundary conditions

Electrical double layer: revisit based on boundary conditions Electrcal double layer: revst based on boundary condtons Jong U. Km Department of Electrcal and Computer Engneerng, Texas A&M Unversty College Staton, TX 77843-318, USA Abstract The electrcal double layer

More information

Calculation of time complexity (3%)

Calculation of time complexity (3%) Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add

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

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

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

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

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

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

PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY

PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY POZNAN UNIVE RSITY OF TE CHNOLOGY ACADE MIC JOURNALS No 86 Electrcal Engneerng 6 Volodymyr KONOVAL* Roman PRYTULA** PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY Ths paper provdes a

More information

A LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS

A LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS A LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS Max M.D. SANTOS, Eugêno B. CASTELAN, Jean-Claude HENNET Abstract Ths paper consders the problem of control of dscrete-tme

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

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

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

DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM

DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI

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

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

More information

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look

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

Design Equations. ν ij r i V R. ν ij r i. Q n components. = Q f c jf Qc j + Continuous Stirred Tank Reactor (steady-state and constant phase)

Design Equations. ν ij r i V R. ν ij r i. Q n components. = Q f c jf Qc j + Continuous Stirred Tank Reactor (steady-state and constant phase) Desgn Equatons Batch Reactor d(v R c j ) dt = ν j r V R n dt dt = UA(T a T) r H R V R ncomponents V R c j C pj j Plug Flow Reactor d(qc j ) dv = ν j r 2 dt dv = R U(T a T) n r H R Q n components j c j

More information

A particle in a state of uniform motion remain in that state of motion unless acted upon by external force.

A particle in a state of uniform motion remain in that state of motion unless acted upon by external force. The fundamental prncples of classcal mechancs were lad down by Galleo and Newton n the 16th and 17th centures. In 1686, Newton wrote the Prncpa where he gave us three laws of moton, one law of gravty,

More information

The Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method

The Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse

More information

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue

More information

CinChE Problem-Solving Strategy Chapter 4 Development of a Mathematical Model. formulation. procedure

CinChE Problem-Solving Strategy Chapter 4 Development of a Mathematical Model. formulation. procedure nhe roblem-solvng Strategy hapter 4 Transformaton rocess onceptual Model formulaton procedure Mathematcal Model The mathematcal model s an abstracton that represents the engneerng phenomena occurrng n

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

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

CHALMERS, GÖTEBORGS UNIVERSITET. SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD

CHALMERS, GÖTEBORGS UNIVERSITET. SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD CHALMERS, GÖTEBORGS UNIVERSITET SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS COURSE CODES: FFR 35, FIM 72 GU, PhD Tme: Place: Teachers: Allowed materal: Not allowed: January 2, 28, at 8 3 2 3 SB

More information

2 More examples with details

2 More examples with details Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and

More information

Author's personal copy

Author's personal copy Journal of Process Control 21 (2011) 1296 1305 Contents lsts avalable at ScenceDrect Journal of Process Control j ourna l ho me pag e: www.elsever.com/locate/jprocont Model predctve control of nonlnear

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems

More information

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton

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

Prediction of steady state input multiplicities for the reactive flash separation using reactioninvariant composition variables

Prediction of steady state input multiplicities for the reactive flash separation using reactioninvariant composition variables Insttuto Tecnologco de Aguascalentes From the SelectedWorks of Adran Bonlla-Petrcolet 2 Predcton of steady state nput multplctes for the reactve flash separaton usng reactonnvarant composton varables Jose

More information

The Feynman path integral

The Feynman path integral The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

Fuzzy Boundaries of Sample Selection Model

Fuzzy Boundaries of Sample Selection Model Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN

More information

An identification algorithm of model kinetic parameters of the interfacial layer growth in fiber composites

An identification algorithm of model kinetic parameters of the interfacial layer growth in fiber composites IOP Conference Seres: Materals Scence and Engneerng PAPER OPE ACCESS An dentfcaton algorthm of model knetc parameters of the nterfacal layer growth n fber compostes o cte ths artcle: V Zubov et al 216

More information

Neuro-Adaptive Design - I:

Neuro-Adaptive Design - I: Lecture 36 Neuro-Adaptve Desgn - I: A Robustfyng ool for Dynamc Inverson Desgn Dr. Radhakant Padh Asst. Professor Dept. of Aerospace Engneerng Indan Insttute of Scence - Bangalore Motvaton Perfect system

More information