SEMI-GLOBAL EXPONENTIAL STABILIZATION OF LINEAR SYSTEMS SUBJECT TO \INPUT SATURATION" VIA LINEAR FEEDBACKS. Zongli Lin & Ali Saberi

Size: px
Start display at page:

Download "SEMI-GLOBAL EXPONENTIAL STABILIZATION OF LINEAR SYSTEMS SUBJECT TO \INPUT SATURATION" VIA LINEAR FEEDBACKS. Zongli Lin & Ali Saberi"

Transcription

1 Appeared n Systems & Control Letters, vol 1, pp-9, 199 SEMI-GLOBAL EXPONENTIAL STABILIZATION OF LINEAR SYSTEMS SUBJECT TO \INPUT SATURATION" VIA LINEAR FEEDBACKS Zongl Ln & Al Saber School of Electrcal Engneerng and Computer Scence Washngton State Unversty Pullman, WA 991- ABSTRACT It s known that a lnear tme-nvarant system subject to \nput saturaton" can be globally asymptotcally stablzed f t has no egenvalues wth postve real parts It s also shown by Fuller [] and Sussmann and Yang [1] that n general one must use nonlnear control laws and only some specal cases can be handled by lnear control laws In ths paper we show the exstence of lnear state feedback and/or output feedback control laws for sem-global exponental stablzaton rather than global asymptotc stablzaton of such systems We explctly construct lnear statc state feedback laws and/or lnear dynamc output feedback laws that sem-globally exponentally stablze the gven system Our results complement the \negatve result" of [] and [1] Key Words: Sem-global exponental stablzaton, bounded control, nput saturaton

2 1 1 INTRODUCTION In ths paper we focus on the problem of stablzaton of a general lnear system whch s subject to \nput saturaton" Ths problem has a rch hstory (see, for example, []), and much of the lterature of the 19's and 19's on the absolute stablty was motvated by ths problem (see, for example, [1], [], []) A recent result due to Songtag and Sussmann ([1]) shows that only lnear stablzable systems havng no open-loop egenvalues wth postve real parts can be globally asymptotcally stablzed by a bounded control Another nterestng aspect of ths problem was shown by Fuller ([]) and more recently by Sussmann and Yang ([1]) They showed that for a system of a chan of ntegrators of length n where n and whch s subject to \nput saturaton", there does not exst a lnear control law that globally asymptotcally stablzes the gven system The mplcaton of the results of [1], [] and [1] s straghtforward and can be concluded as follows: Gven a lnear system whch s subject to \nput saturaton", the global stablzaton can be solved f and only f all the egenvalues of the gven system are n the closed left half plane, and, even then, n general one must use nonlnear control and only very smple cases can be handled va lnear feedback control laws (An nterestng nonlnear control law of nested saturaton type for global asymptotcal stablzaton of a chan of ntegrators subject to \nput saturaton" was proposed n [1], whch was later extended by [11]) In ths paper we present a result that complements the \negatve results" of [] and [1] We consder sem-global exponental stablzaton of general lnear systems subject to \nput saturaton" and show that, n contrast to the case of global asymptotc stablzaton, one can sem-globally exponentally stablze such systems va lnear feedback laws Here by sem-global exponental stablzaton, as usual, we mean local exponental stablzaton of the system such that the doman of attracton of the closed-loop system contans an a pror gven bounded set (For precse denton of sem-global exponental stablzaton, see Dentons 1 and ) Relaxng the requrement of global stablzaton to that of sem-global stablzaton, from engneerng pont of vew, makes sense, snce n general a plant's model s usually vald n some regon of the state space Such relaxaton gves us smple lnear control laws and stronger stablty property for the closed-loop system, that s, the exponental stablty of the closed-loop system, rather than asymptotcal stablty Ths paper s organzed as follows We formulate our problem n secton Secton deals wth state feedback case, whle the output feedback case s dealt wth n secton Secton draws the conclusons of our current work PROBLEM STATEMENT We consder a lnear system subject to \nput saturaton" descrbed by _x = Ax + B h (u) (1) y = Cx ()

3 where x < n s the state, u < m s the control nput to the saturator, y < p s the measurement output, and h (s) s a bounded vector functon dened as wth h (s) = [ h1 (s 1 ); h (s ); ; hm (s m )] h (s ) 8 < : = s f js j h <?h f s <?h (:) > h f s > h where s = [s 1 ; s ; ; s m ] and h = [h 1 ; h ; ; h m ]; h > We make the followng assumptons on the system (1)-() A1 All the egenvalues of A are located on the closed left half s-plane; A The par (A; B) s stablzable; A The par (A; C) s detectable Remark 1 We should pont out that assumptons A1 and A are equvalent to the noton of asymptotc null-controllablty that was ntroduced n [8] and [9] Before statng the problem at hand, we have the followng dentons Denton 1 (Sem-global exponental stablzaton va lnear statc state feedback) The system (1)-() s sem-globally exponentally stablzable by lnear statc state feedback f for any a pror gven bounded set of ntal condtons W < n, there exsts a state feedback law u = Kx such that the equlbrum x = of the closed-loop system s locally exponentally stable and W s contaned n the doman of attracton of the equlbrum x = Denton (Sem-global exponental stablzaton va lnear dynamc output feedback of dynamcal order l) The system (1)-() s sem-globally exponentally stablzable by lnear dynamc output feedback of dynamcal order l, f for any a pror gven bounded set W < n+l, there exsts a lnear dynamc output feedback control law _z = A con z + B con y; z < l () u = C con z + D con y () such that the equlbrum (; ) of the closed-loop system consstng of the system (1)-() and the controller ()-() s locally exponentally stable and W s contaned n the doman of attracton of the equlbrum (; ) The problem posed n ths paper s to establsh the sem-global exponental stablzaton va lnear statc state feedback laws and/or lnear dynamc output feedback laws for the system (1)- ()

4 STATE FEEDBACK DESIGN In ths secton we examne the problem of sem-global exponental stablzaton va lnear state feedback control of the asymptotc null-controllable lnear systems Our man result s gven n the followng theorem Theorem 1 The lnear system (1)-() satsfyng assumptons A1 and A s sem-globally exponentally stablzable va lnear state feedback Namely, for any a pror gven (arbtrarly large) bounded set W and any (arbtrarly small) numbers h > ; = 1 to m, there s a lnear control law u =?Kx such that (a) The equlbrum x = of the closed-loop system s locally exponentally stable; (b) W s contaned n the doman of attracton of the equlbrum x = Before provng ths theorem, let us dgress to prove a lemma, whch wll play a fundamental role n our proof of Theorem 1 Lemma 1 Consder a lnear sngle nput system n the controllable canoncal form where A = _x = Ax + Bu ; B =?a n?a n?1?a n??a 1 Assume that all the egenvalues are n the closed left half s-plane Let K() < 1n be the state feedback gan such that (A? BK()) =? + (A) Then, there exsts an > such that for all <, kk()e (A?BK())t k e?t (:1) ke (A?BK())t k r?1 e?t (:) for some > and > ndependent of, where r s the largest algebrac multplcty of the egenvalues of A Proof of Lemma 1 : Let p 1 = det(si? A) = py =1 (s? ) n : where = j, = j Then, for each = 1 to p, the n generalzed egenvectors of A are gven by ([]): 1 n? n?1 ; p = 1 (n? 1) n? ; ; p n = 1 C n?1 n? n?n?1 C n?1 n?1 n?n :

5 Smlarly, for each = 1 to p, the n generalzed egenvectors of A? BK() are gven by q 1 = 1 n? n?1 ; q = where =? + and C n s dened as 1 (n? 1) n? ; ; q n = n! Cn = n (n?)!! otherwse : We next form the followng two nonsngular transformaton matrces whch s ndependent of, and It then follows that P?1 AP = P = [p 1 1 ; p1 ; ; p1 n 1 ; ; p p 1 ; pp ; ; pp n p ] Q() = [q 1 1; q 1 ; ; q 1 n 1 ; ; q p 1 ; qp ; ; qp n p ]: J 1 J ; J = J p C n?1 n? n?n?1 C n?1 n?1 n?n 1 1 ; (:) : and Q?1 ()(A? BK())Q() = J 1 J ; J = J p 1 1 : (:) By the denton of generalzed egenvectors, we have the followng relatonshps, and Ap 1 = p 1; Ap j = p j?1 + p j ; j = ; ; ; n ; = 1; ; ; p () (A? BK())q 1 = q 1; (A? BK())q j = q j?1 + q j ; j = ; ; ; n ; = 1; ; ; p () Denotng A n = [?a n?a n?1?a 1 ], t then follows form () and () that, for each = 1 to p, we have,

6 for j = 1; ; ; n, from whch we have K()q j = A n q j? Cj?1 = A n = A n = A n n?j = X n?j k= A n p j = C j?1 n?1 n?j+1 + C j? n?1 n?j+1 = Cn j?1 (A n? K())qj = C j?1 n?1 n?j+1 + C j? n?1 n?j+1 = Cn j?1 n n?j+1 C j?1 j?1 C j?1 j (? + ) C j?1 (? + n?1 ) n?j C j?1 j P C j?1 n?j n?1 X k= C j?1 j?1 P 1k= (?) k 1?k? Cn j?1 (? + ) n?j+1 k= Ck n?j (?)k n?j?k n?j (?) k C k k+j?1 p j+k? Cj?1 n X k=? Cn j?1 (? + ) n?j+1 n?j+1 n?j+1 (?) k C k n?j+1 n?j?k+1 + ( n?j+1 ) X n?j (?) k Ck+j?1C k n j+k?1 n?j?k+1? Cn j?1 (?) k Cn?j+1 k n?j?k+1 + ( n?j+1 ) = ( n?j+1 ) where ( n?j+1 ) s a polynomal n whose coecents of terms of order lower than n? j + 1 are all zero Hence, we have, for < 1, k= jk()q j j j n?j+1 (:) where j s some postve constant ndependent of We next note that both Q() and Q?1 () are contnuous functons of satsfyng Q() = P and Q?1 () = P?1 Now from the contnuty of norm functons t follows that there exsts an, < 1, such that for all <, kq()k kp k + 1; kq?1 ()k kp?1 k + 1: (:8) Fnally () and (8) show that, for all <, k K ()e (A?BK())t k = kk()q()e Q?1 ()(A?BK())Q()t Q?1 ()k

7 (kp?1 k + 1) (kp?1 k + 1) (kp?1 k + 1) (kp?1 k + 1) (kp?1 k + 1) = e?t px =1 px =1 kk()[q 1; q ; ; q n ]e J t k kk()[q 1; q ; ; q n ] px Xn jx =1 j=1 l=1 px Xn jx =1 j=1 l=1 px Xn jx =1 j=1 l=1 l n?l+1 t j?l e?t =(j? l)! l (j? l)j?l n?j+1 l (j? l)! (j? l)j?l (j? l)! e?t where = (kp?1 k + 1) P p P n P j l (j?l)j?l =1 j=1 l=1 (j?l)! e t te t t e t =! t n?1 e t =(n? 1)! e t te t n? e t =(n? )! k e t e?t s ndependent of Ths shows (1) Usng (8), () can be shown as follows For all <, k e (A?BK())t k = kq()e Q?1 ()(A?BK())Q()t Q?1 ()k (kp k + 1)(kP?1 k + 1) (kp k + 1)(kP?1 k + 1) (kp k + 1)(kP?1 k + 1) (kp k + 1)(kP?1 k + 1) (kp k + 1)(kP?1 k + 1) = e?t r?1 px =1 px =1 ke J t k k px Xn =1 j=1 l=1 px Xn e t te t t e t =! t n?1 e t =(n? 1)! e t te t n? e t =(n? )! k e t jx jx =1 j=1 l=1 px Xn jx =1 j=1 l=1 t j?l e?t =(j? l)! (j? l) j?l e?t (j? l)!j?l (j? l) j?l e?t r?1 (j? l)! s ndepen- where r = maxfn 1 ; n ; ; n p g and = (kp k + 1)(kP?1 k + 1) P p =1 dent of P n P j (j?l) j?l j=1 l=1 (j?l)! Proof of Theorem 1 : The dea of the proof s as follows We rst consder the gven system (1)-() wthout the saturaton element h (e, h (u) = u) Namely, we consder the lnear system _x = Ax + Bu: (:9)

8 Then we show that there exst a famly of state feedback gan matrces K() < mn ; >, such that the closed-loop system consstng of (9) and the state feedback law u =?K()x (:1) s exponentally stable for all >, e, all the egenvalues of A? BK() are n the open left half s-plane Moreover, for any a pror gven bounded set W and any h > ; = 1 to m, there exsts an > such that for all = 1 to m, ju (t)j h ; 8 (; ] and 8x() W; where u (t) s the th element of u =?K()x Havng done ths, now t s straghtforward to verfy that the applcaton of the state feedback law (1) wth (; ] to the orgnal system (1)-() results n a closed-loop system that remans lnear for all x W snce ju j h and h s lnear n ths regon The results of the theorem thus follow We now begn the proof by ntroducng the followng state transformaton x =?~x; ~x = [~x 1; ~x ; ; ~x p; ~x c] ; ~x < n ; ~x c < nc where? s such that (??1 A?;??1 B) s n the followng trangular canoncal form ([])??1 A? = A 1 A 1 A 1p A 1c A A p A c A p A pc A c ;??1 B = Here 's represent submatrces of less nterest and for = 1; ; ; p, A = ; B =?a n?a n?1?a n??a 1 B 1 B B p Clearly, (A ; B ) s controllable, all the egenvalues of A are on the closed left half s-plane, and all the egenvalues of A c have strctly negatve real parts For = 1; ; ; p, let K () = [K 1(); K (); ; Kn ()] be chosen such that (A? B K ()) =? + (A ) For the later use, we make the followng observaton Observaton 1 For all, < 1, kk ()k < k, for some postve constant k Proof : Let f l ; l = 1; ; ; n g be the egenvalues of A, then Yn l=1 (s? l) = s n + a 1 s n?1 + + a n 1

9 8 Hence the characterstc equaton of A? B K () s gven by Yn l=1 (s +? l) = s n + (a 1 + K n ())s n?1 + + (a n + K 1 ()) = from whch t s straghtforward to see that for any j; j = 1; ; ; n, K j () s a polynomal n and K j () = It then follows trvally that for < 1, there exsts some k > such that kk ()k k We then form a state feedback gan K() as follows K() = K 1 ( (r +1)(r +1)(r p+1) ) K ( (r +1)(r +1)(r p+1) ) K p?1 ( rp+1 ) K p () where r s the largest algebrac multplcty of the egenvalues of A It s trval to see that all the egenvalues of A? BK() have strctly negatve real parts and hence the system (9) under the control u =?K()x s stable for all > We next show that for the gven bounded set W and the gven vector h, there exsts an >, such that for all = 1 to m, ju (t)j h ; 8 (; ] and 8x() W To ths end, let us wrte out the closed-loop system dynamcs (9)-(1) n the new state ~x as follows, _~x = (A? B K ())~x + _~x c = A c ~x c px l=+1 A l ~x l + A c ~x c ; = 1; ; ; p Snce all the egenvalues of A c are n the open left half s-plane, there exsts a > and an c >, both ndependent of, such that k~x c k c e?t k~x c ()k We then vew ~x c as an nput sgnal to the dynamcs of ~x p By Lemma 1, there exsts an p, < p mnf1=; g, such that for all < p, kk p ()e (Ap?BpKp())t k p e?t for some p > We then have kk p ()~x p k kk p ()e (Ap?BpKp())t ~x p ()k + kk p () p e?t k~x p ()k + c p ka pc k e (Ap?BpKp())(t? ) A pc ~x c ()d k e?(t? ) e? d k~x c ()k p e?t k~x p ()k + c p ka pc ke?t e?(?) d k~x c ()k p e?t k~x p ()k + c p ka pc k e?t k~x? c ()k p p e?t kx()k??1

10 9 for some postve constant p ndependent of Also we have, for all < p, k~x p k ke (Ap?BpKp())t ~x p ()k + k e (Ap?BpKp())(t? ) A pc ~x c ()d k p rp?1 e?t k~x p ()k + c p ka pc k (? p) rp?1 e?t k~x c ()k p rp?1 e?t kx()k for some postve constant p ndependent of Vewng ~x c and ~x p as nputs to the dynamcs of ~x p?1 and usng the nequaltes (1) and (), we have, for some < p?1 p, and for all <, p?1 kk p?1 ( rp+1 )~x p?1 k kk p?1 ( rp+1 )e (A p?1?b p?1 K p?1 ( rp+1 ))t ~x p?1 ()k +kk p?1 ( rp+1 ) +kk p?1 ( rp+1 ) e (A p?1?b p?1 K p?1 ( rp +1 ))(t? ) A p?1p ~x p ()d k e (A p?1?b p?1 K p?1 ( rp +1 ))(t? ) A p?1c ~x c ()d k p?1 rp+1 e?rp +1 t kx()k + p p?1 ka p?1p k rp?1 + c p?1 ka p?1c k rp+1 e?rp +1 (t? ) e? d kx()k p?1 rp+1 e?rp +1 t kx()k + p p?1 ka p?1p k e?rp +1 t + c p?1 ka p?1c k rp+1 e?rp +1 t rp+1 e?rp +1 (t? ) e? d kx()k e?(?rp +1 ) d kx()k p?1 e?rp +1 t kx()k + p p?1 ka p?1p ke?rp +1 t kx()k + c p?1 ka p?1c k rp +1 t? ( e? kx()k p?1 )rp+1 p?1 e?rp +1 t kx()k for some postve constant p?1 ndependent of, and smlarly, k~x p?1 k ke (A p?1?b p?1 K p?1 ( rp+1 )t ~x p?1 ()k + k e?(?rp +1 ) d kx()k e (A p?1?b p?1 K p?1 ( rp+1 )(t? ) A p?1p ~x p ()d k +k e (A p?1?b p?1 K p?1 ( rp +1 )(t? ) A p?1c ~x c ()d k p?1 (rp+1)(r p?1?1) e? Z rp +1 t k~xp?1 ()k + p p?1 ka p?1p k t e?rp +1 (t? ) e? d (rp+1)(r kx()k p?1?1) rp?1 + c p?1 ka p?1c k e?rp +1 (t? ) e? d kx()k (rp+1)(r p?1?1) p?1 +1 (rp+1)r p?1?1 e?rp t p p?1ka p?1pk kx()k + (rp+1)r p?1?1 c p?1 ka p?1c k + +1 (? ( p?1 )rp+1 ) (rp+1)r p?1?1 e?rp t kx()k p?1 e? rp +1 t kx()k r p?1(r p+1)?1 kx()k

11 1 for some postve constant p?1 ndependent of Contnung n the same manner, we can show that for each = p? ; p? ; 1, there exsts such that for all < +1, kk ( (r +1+1)(r p+1) )~x k e?(r +1 +1)(r + +1)(rp+1) t kx()k and k~x k e? (r +1 +1)(r + +1)(rp +1) t kx()k r (r +1 +1)(r + +1)(r p+1)?1 for some postve constants and ndependent of We then have, for all < 1, ku()k = kk()xk px =1 kk ( (r +1+1)(r p+1) ))~x k px =1 e?(r +1 +1)(r + +1)(rp+1) t kx()k (:11) Let R > be such that W fx : kxk Rg, h = mnfh 1 ; h ; ; h m g, and let = mnf 1 ; h =(R P p =1 )g Then t mmedately follows from (11) that, for all = 1 to m, ju (t)j h ; 8 (; ] and 8x() W whch concludes our proof We next demonstrate our desgn strategy by the followng example Example 1: Consder the lnear system (1)-() wth A = ?1?1???1?1? ; B = where h s any bounded functon satsfyng () It s straghtforward to verfy that ths system s stablzable wth ve controllable modes at f?1;?j;?j; j; jg, where j = p?1, and an uncontrollable mode at? Followng the algorthm gven n the proof of Theorem 1, we construct the followng famly of lnear bounded state feedback control laws whch sem-globally stablzes the gven system, u =?[ ]x where > s a tunable parameter to be chosen accordng to the a pror gven bounded set W and the value of h Let the set W be gven by W = fx : kxk 1g and h = : Then an estmate of s gven by = :1 The smulaton results are shown n Fgure 1 1 ;

12 11 OUTPUT FEEDBACK DESIGN Ths secton deals wth the problem of sem-global exponental stablzaton of detectable and asymptotc null-controllable systems Our man result s gven n the followng theorem Theorem 1 Let assumptons A1 to A be satsed Then the system (1)-() s sem-globally exponentally stablzable va lnear output feedback of dynamcal order n Namely, for any a pror gven (arbtrarly large) bounded set W < n and any (arbtrarly small) numbers h > ; = 1 to m, there exsts a lnear output feedback law of dynamcal order n such that (a) The equlbrum (; ) of the closed loop system s locally exponentally stable; (b) W s contaned n the doman of attracton of the equlbrum (; ) Proof : We rst construct a famly of dynamc output feedback controllers parameterzed n as follows _^x = A^x + B h (?K()^x) + L(y? C ^x) (1) u =?K()^x () where K() s as gven n the proof of Theorem 1, and L s any matrx such that all the egenvalues of A? LC are n the open left half s-plane Followng the same dea of the proof of Theorem 1, we rst consder the closed-loop system wthout saturaton element Namely, we set h (u) = u n both the system (1)-() and the proposed controller (1)-() Then we show that for the gven set W and h > ; = 1 to m, there exsts an > such that for all = 1 to m, ju (t)j h ; 8 (; ] and 8[x() ; ^x() ] W: (:) where u (t) s the th element of u =?K()^x Havng done ths, the result of the theorem then follows readly snce the closed-loop system wth saturaton element, namely, (1)-() and (1)-(), remans lnear for all [x() ; ^x() ] W To show ths, we observe that the closed-loop system wth h (u) = u can be rewrtten as _x = (A? BK())x + BK()e () _e = (A? LC)e () u =?K()x + K()e () where e = x? ^x The stablty of ths above system for all > follows from the separaton prncple Next we need to show that for the gven W and the gven h >, = 1; ; ; m, there exsts an > such that () holds To ths end, as n the proof of Theorem 1, we wrte the system ()-() as _~x = (A? B K ())~x + _~x c = A c ~x c px l=+1 A l ~x l + A c ~x c +? BK()e; = 1; ; ; p () (8) _e = (A? LC)e: (9)

13 1 where??1 = [? 1 ;? ; ;? p] Vewng [~x c; e ] as a new ~x c and usng Observaton 1, t can be shown exactly as n the proof of Theorem 1, that there exsts an 1 such that for all = 1 to m, ju 1 (t)j h =; 8 (; 1 ] and 8[x() ; ^x() ] W; where u 1 (t) s the th element of?k()x Also notng that ke(t)k k e ke()k for some k e > and ke()k kx()k + k^x()k, t then follows from Observaton 1 that there exsts an, such that for all = 1 to m, ju (t)j h =; 8 (; ] and 8[x() ; ^x() ] W; where u (t) s the th element of K()e Takng = mnf 1; g, we complete our proof We next demonstrate our output feedback desgn by the followng numercal example Example 1 Consder the system (1)-(), where A and B are as gven n Example 1, C = [ 1 ], and h s any bounded functon satsfyng () It can be easly vered that all the assumptons A1 to A are satsed Choosng the observer gan L=[?9? ], we place the egenvalues of A?LC at f?1j;?1j;?1;?g Together wth the state feedback gan obtaned n Example 1, K()=[ + + e ] ; we obtaned the followng observer-based controllers whch sem-globally exponentally stablze the gven system _^x = A^x + B h (?K()^x) + L(y? C ^x) u =?K()^x where s a tunable parameter to be chosen accordng to the a pror gven bounded set W and the value of h Let the set W be gven by W = fx : kxk 1g and h = : Then an estmate of s gven by = :1 The smulaton results are shown n Fgures and CONCLUSIONS In ths paper, we establshed the exstence of the lnear control laws, both state feedback and output feedback type, for sem-global exponental stablzaton of lnear tme-nvarant systems subject to \nput saturaton" The explct constructon of such control laws was also gven References [1] MA Azerman and FR Gantmacher, Absolute Stablty of Regulator Systems, Holden-Day, San Francsco, CA, 19 [] BDO Anderson and JB Moore, Lnear Optmal Control, Prentce-Hall, Englewood Cls, 191

14 1 [] CT Chen, Lnear System Theory and Desgn, Holt, Rnehart and Wnston, New York, 198 [] AT Fuller, \In the large stablty of relay and saturated control systems wth lnear controllers," Internatonal Journal of Control, vol 1, pp 8-, 19 [] T Kalath, Lnear Systems, Prentce-Hall, Englewood Cls, NJ, 198 [] KS Narendra and JH Taylor, Frequency Doman Crtera for Absolute Stablty, Academc Press, 19 [] VM Popov, Hyperstablty of Control Systems, Sprnger-Verlag, Berln, 19 [8] WE Schmtendorf and BR Barmsh, \Null controllablty of lnear systems wth constraned controls," SIAM J Control and Optmzaton, vol 18, pp -, 198 [9] ED Sontag, \An algebrac approach to bounded controllablty of lnear systems," Internatonal Journal of Control, vol 9, pp , 198 [1] ED Sontag ans HJ Sussmann, \Nonlnear output feedback desgn for lnear systems wth saturatng controls," Proc 9th IEEE Conf Decson and Control, pp 1-1, 199 [11] ED Sontag and Y Yang, \Global stablzaton of lnear systems wth bounded feedback," Report SYCON-91-9, Rutgers Center for Systems and Control, 1991 [1] HJ Sussmann and Y Yang, \On the stablzablty of multple ntegrators by means of bounded feedback controls," Report SYCON-91-1, Rutgers Center for Systems and Control, 1991 [1] AR Teel, Feedback Stablzaton: Nonlnear Solutons to Inherently Nonlnear Problems, PhD dssertaton, College of Engneerng, Unversty of Calforna, Berkeley, CA, 199

15 1-1 1 a b c d e f g Fgure 1: Example 1 = :1 a) x 1 ; b) x ; c) x ; d) x ; e) x ; f) x ; g) u

16 a c e g b d f h Fgure : Example 1 = :1 a) x 1 ; b) x ; c) x ; d) x ; e) x ; f) x ; g) ^x 1 ; h) ^x

17 k j l m Fgure : Fgure contnued ) ^x ; j) ^x ; k) ^x ; l) ^x ; m) u

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

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

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

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

Dynamic Systems on Graphs

Dynamic Systems on Graphs Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,

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

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

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

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

Improved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays

Improved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays Avalable onlne at www.scencedrect.com Proceda Engneerng 5 ( 4456 446 Improved delay-dependent stablty crtera for dscrete-tme stochastc neural networs wth tme-varyng delays Meng-zhuo Luo a Shou-mng Zhong

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

Robust observed-state feedback design. for discrete-time systems rational in the uncertainties

Robust observed-state feedback design. for discrete-time systems rational in the uncertainties Robust observed-state feedback desgn for dscrete-tme systems ratonal n the uncertantes Dmtr Peaucelle Yosho Ebhara & Yohe Hosoe Semnar at Kolloquum Technsche Kybernetk, May 10, 016 Unversty of Stuttgart

More information

Canonical transformations

Canonical transformations Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,

More information

form, and they present results of tests comparng the new algorthms wth other methods. Recently, Olschowka & Neumaer [7] ntroduced another dea for choo

form, and they present results of tests comparng the new algorthms wth other methods. Recently, Olschowka & Neumaer [7] ntroduced another dea for choo Scalng and structural condton numbers Arnold Neumaer Insttut fur Mathematk, Unverstat Wen Strudlhofgasse 4, A-1090 Wen, Austra emal: neum@cma.unve.ac.at revsed, August 1996 Abstract. We ntroduce structural

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

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

Controller Design for Networked Control Systems in Multiple-packet Transmission with Random Delays

Controller Design for Networked Control Systems in Multiple-packet Transmission with Random Delays Appled Mehans and Materals Onlne: 03-0- ISSN: 66-748, Vols. 78-80, pp 60-604 do:0.408/www.sentf.net/amm.78-80.60 03 rans eh Publatons, Swtzerland H Controller Desgn for Networed Control Systems n Multple-paet

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

LocalReliableControlforLinearSystems with Saturating Actuators

LocalReliableControlforLinearSystems with Saturating Actuators LocalRelableControlforLnearSystems wth Saturatng Actuators Shoudong Huang James Lam Bng Chen Dept. of Engneerng Dept. of Mechancal Engneerng Dept. of Mathematcs Australan Natonal Unversty Unversty of Hong

More information

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 7, July 1997, Pages 2119{2125 S (97) THE STRONG OPEN SET CONDITION

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 7, July 1997, Pages 2119{2125 S (97) THE STRONG OPEN SET CONDITION PROCDINGS OF TH AMRICAN MATHMATICAL SOCITY Volume 125, Number 7, July 1997, Pages 2119{2125 S 0002-9939(97)03816-1 TH STRONG OPN ST CONDITION IN TH RANDOM CAS NORBRT PATZSCHK (Communcated by Palle. T.

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

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

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent

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

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

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

On the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros

On the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong

More information

hapter 6 System Norms 6. Introducton s n the matrx case, the measure on a system should be nduced from the space of sgnals t operates on. hus, the sze

hapter 6 System Norms 6. Introducton s n the matrx case, the measure on a system should be nduced from the space of sgnals t operates on. hus, the sze Lectures on Dynamc Systems and ontrol Mohammed Dahleh Munther. Dahleh George Verghese Department of Electrcal Engneerng and omputer Scence Massachuasetts Insttute of echnology c hapter 6 System Norms 6.

More information

Quantum Mechanics I - Session 4

Quantum Mechanics I - Session 4 Quantum Mechancs I - Sesson 4 Aprl 3, 05 Contents Operators Change of Bass 4 3 Egenvectors and Egenvalues 5 3. Denton....................................... 5 3. Rotaton n D....................................

More information

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980 MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and

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

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence. Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm

More information

An explicit solution to polynomial matrix right coprime factorization with application in eigenstructure assignment

An explicit solution to polynomial matrix right coprime factorization with application in eigenstructure assignment Journal of Control Theory Applcatons () 147 14 An explct soluton to polynomal matrx rght coprme factorzaton wth applcaton n egenstructure assgnment Bn ZHOU Guangren DUAN ( Center for Control Theory Gudance

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

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

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

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

Linear Algebra and its Applications

Linear Algebra and its Applications Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler

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

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness. 20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed

More information

Lyapunov-Razumikhin and Lyapunov-Krasovskii theorems for interconnected ISS time-delay systems

Lyapunov-Razumikhin and Lyapunov-Krasovskii theorems for interconnected ISS time-delay systems Proceedngs of the 19th Internatonal Symposum on Mathematcal Theory of Networks and Systems MTNS 2010 5 9 July 2010 Budapest Hungary Lyapunov-Razumkhn and Lyapunov-Krasovsk theorems for nterconnected ISS

More information

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,

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

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

A novel nested non-linear feedback law for global stabilisation of linear systems with bounded controls

A novel nested non-linear feedback law for global stabilisation of linear systems with bounded controls Internatonal Journal of Control Vol 81 No 9 September 008 135 133 Downloaded By: [Zhou Bn] At: 1:05 30 June 008 A novel nested non-lnear feedback law for global stablsaton of lnear systems wth bounded

More information

Lecture 4: Universal Hash Functions/Streaming Cont d

Lecture 4: Universal Hash Functions/Streaming Cont d CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected

More information

Beyond Zudilin s Conjectured q-analog of Schmidt s problem

Beyond Zudilin s Conjectured q-analog of Schmidt s problem Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs

More information

Estimation: Part 2. Chapter GREG estimation

Estimation: Part 2. Chapter GREG estimation Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the

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

Google PageRank with Stochastic Matrix

Google PageRank with Stochastic Matrix Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d

More information

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014) 0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes

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

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

Stability Analysis and Anti-windup Design of Switched Systems with Actuator Saturation

Stability Analysis and Anti-windup Design of Switched Systems with Actuator Saturation Internatonal Journal of Automaton and Computng 14(5), October 2017, 615-625 DOI: 101007/s11633-015-0920-z Stablty Analyss and Ant-wndup Desgn of Swtched Systems wth Actuator Saturaton Xn-Quan Zhang 1 Xao-Yn

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

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

SINGLE OUTPUT DEPENDENT QUADRATIC OBSERVABILITY NORMAL FORM

SINGLE OUTPUT DEPENDENT QUADRATIC OBSERVABILITY NORMAL FORM SINGLE OUTPUT DEPENDENT QUADRATIC OBSERVABILITY NORMAL FORM G Zheng D Boutat JP Barbot INRIA Rhône-Alpes, Inovallée, 655 avenue de l Europe, Montbonnot Sant Martn, 38334 St Ismer Cedex, France LVR/ENSI,

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

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

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

C4B Machine Learning Answers II. = σ(z) (1 σ(z)) 1 1 e z. e z = σ(1 σ) (1 + e z )

C4B Machine Learning Answers II. = σ(z) (1 σ(z)) 1 1 e z. e z = σ(1 σ) (1 + e z ) C4B Machne Learnng Answers II.(a) Show that for the logstc sgmod functon dσ(z) dz = σ(z) ( σ(z)) A. Zsserman, Hlary Term 20 Start from the defnton of σ(z) Note that Then σ(z) = σ = dσ(z) dz = + e z e z

More information

MEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x

MEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x MEM633 Lectures 7&8 Chapter 4 Descrptons of MIMO Systems 4- Drect ealzatons y() s s su() s y () s u () s ( s)( s) s y() s u (), s y() s u() s s s y() s u(), s y() s u() s ( s)( s) s () ( s ) y ( s) u (

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

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

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

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

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

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

System in Weibull Distribution

System in Weibull Distribution Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co

More information

The Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor

The Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor Prncpal Component Transform Multvarate Random Sgnals A real tme sgnal x(t can be consdered as a random process and ts samples x m (m =0; ;N, 1 a random vector: The mean vector of X s X =[x0; ;x N,1] T

More information

ISS of interconnected impulsive systems with and without time-delays

ISS of interconnected impulsive systems with and without time-delays ISS of nterconnected mpulsve systems wth and wthout tme-delays Sergey Dashkovsky,1 Mchael Kosmykov,2 Lars Nauok,1 Unversty of Bremen, Centre of Industral Mathematcs, P.O.Box 330440, 28334 Bremen, Germany

More information

Zeros and Zero Dynamics for Linear, Time-delay System

Zeros and Zero Dynamics for Linear, Time-delay System UNIVERSITA POLITECNICA DELLE MARCHE - FACOLTA DI INGEGNERIA Dpartmento d Ingegnerua Informatca, Gestonale e dell Automazone LabMACS Laboratory of Modelng, Analyss and Control of Dynamcal System Zeros and

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

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 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

A new Approach for Solving Linear Ordinary Differential Equations

A new Approach for Solving Linear Ordinary Differential Equations , ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of

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

Lecture 10: May 6, 2013

Lecture 10: May 6, 2013 TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,

More information

Stability analysis for class of switched nonlinear systems

Stability analysis for class of switched nonlinear systems Stablty analyss for class of swtched nonlnear systems The MIT Faculty has made ths artcle openly avalable. Please share how ths access benefts you. Your story matters. Ctaton As Publshed Publsher Shaker,

More information

Scroll Generation with Inductorless Chua s Circuit and Wien Bridge Oscillator

Scroll Generation with Inductorless Chua s Circuit and Wien Bridge Oscillator Latest Trends on Crcuts, Systems and Sgnals Scroll Generaton wth Inductorless Chua s Crcut and Wen Brdge Oscllator Watcharn Jantanate, Peter A. Chayasena, and Sarawut Sutorn * Abstract An nductorless Chua

More information

Chapter 2 A Class of Robust Solution for Linear Bilevel Programming

Chapter 2 A Class of Robust Solution for Linear Bilevel Programming Chapter 2 A Class of Robust Soluton for Lnear Blevel Programmng Bo Lu, Bo L and Yan L Abstract Under the way of the centralzed decson-makng, the lnear b-level programmng (BLP) whose coeffcents are supposed

More information

e - c o m p a n i o n

e - c o m p a n i o n OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency

More information

Inexact Newton Methods for Inverse Eigenvalue Problems

Inexact Newton Methods for Inverse Eigenvalue Problems Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.

More information

R R 2 fl 2 + F 2 z j z 2 R n, g Fgure : R s polytopc and the boundary of R and R j s characterzed as beng a subset of fl j + F j z j z 2 R n, g (here

R R 2 fl 2 + F 2 z j z 2 R n, g Fgure : R s polytopc and the boundary of R and R j s characterzed as beng a subset of fl j + F j z j z 2 R n, g (here Quadratc Stablzaton and Control of Pecewse-Lnear Systems Arash Hassb Stephen Boyd Informaton Systems Laboratory Stanford Unversty Stanford, CA 935-55 USA arash@sl.stanford.edu boyd@sl.stanford.edu Abstract

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

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

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k) ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of

More information

Off-policy Reinforcement Learning for Robust Control of Discrete-time Uncertain Linear Systems

Off-policy Reinforcement Learning for Robust Control of Discrete-time Uncertain Linear Systems Off-polcy Renforcement Learnng for Robust Control of Dscrete-tme Uncertan Lnear Systems Yonglang Yang 1 Zhshan Guo 2 Donald Wunsch 3 Yxn Yn 1 1 School of Automatc and Electrcal Engneerng Unversty of Scence

More information

An L 2 Disturbance Attenuation Approach. to the Nonlinear Benchmark Problem. where is the (nondimensionalized) translational position

An L 2 Disturbance Attenuation Approach. to the Nonlinear Benchmark Problem. where is the (nondimensionalized) translational position An L Dsturbance Attenuaton Approach to the Nonlnear Benchmark Problem Panagots Tsotras Dept. of Mechancal, Aerospace and Nuclear Engneerng Unversty of Vrgna Charlottesvlle, VA 9- Martn Corless and Maro

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

Systems of Equations (SUR, GMM, and 3SLS)

Systems of Equations (SUR, GMM, and 3SLS) Lecture otes on Advanced Econometrcs Takash Yamano Fall Semester 4 Lecture 4: Sstems of Equatons (SUR, MM, and 3SLS) Seemngl Unrelated Regresson (SUR) Model Consder a set of lnear equatons: $ + ɛ $ + ɛ

More information

A property of the elementary symmetric functions

A property of the elementary symmetric functions Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,

More information

Stabilization and Performance Analysis for a Class of Switched Systems

Stabilization and Performance Analysis for a Class of Switched Systems 43rd IEEE Conference on Decson and Control December 14-17, 2004 Atlants, Paradse Island, Bahamas ThB02.6 Stablzaton and Performance Analyss for a Class of Swtched Systems Le Fang, Ha Ln, and Panos J. Antsakls

More information

CALCULUS CLASSROOM CAPSULES

CALCULUS CLASSROOM CAPSULES CALCULUS CLASSROOM CAPSULES SESSION S86 Dr. Sham Alfred Rartan Valley Communty College salfred@rartanval.edu 38th AMATYC Annual Conference Jacksonvlle, Florda November 8-, 202 2 Calculus Classroom Capsules

More information

ISSN On error probability exponents of many hypotheses optimal testing illustrations

ISSN On error probability exponents of many hypotheses optimal testing illustrations Journal Afrka Statstka Vol. 6, 2011, pages 307 315. DOI: http://dx.do.org/10.4314/afst.v61.1 Journal Afrka Statstka ISS 0825-0305 On error probablty exponents of many hypotheses optmal testng llustratons

More information

topology If p = q and det(s + ), the pencl s + s called a regular pencl Pencls not satsfyng these condtons are referred to as sngular pencls A complet

topology If p = q and det(s + ), the pencl s + s called a regular pencl Pencls not satsfyng these condtons are referred to as sngular pencls A complet Orbt Closures of Sngular atrx Pencls D Hnrchsen Insttut fur Dynamsche Systeme Unverstat Bremen 8 Bremen Germany J O'Halloran Dept of athematcal Scences Portland State Unversty Portland, OR 9, USA Abstract

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

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