Ilchmann, Achim: Nonidentifierbased highgain adaptive control


 Lily Bailey
 1 years ago
 Views:
Transcription
1 lchmann, Achim: Nonidentifierbased highgain adaptive control Zuerst erschienen bei: London : Springer, 1993 SBN (Lecture notes in control and information sciences ; 189). Zugl.: Hamburg, Univ., FB Mathematik, Habil.Schr. : 1993
2 Lecture Notes in Control and nformation Sciences 189 Editors: M. Thoma and W. Wyner
3
4 r Achim lchmann NondentifierBased HighGain Adaptive Control SpringerVerlag ondon Berlin Heidelberg New York Paris Tokyo Hong Kong Barcelona Budapest
5 Series Advisory Board L.D. Davisson' M.J. Grimble' H. Kwakernaak' A.G.J. MacFarlane J.L. Massey 'J. Stoer Y. Z. Tsypkin ' A.J. Viterbi Author Achim lchmann, PhD nstitut frr Angewandte Mathematik, Universität Hamburg, Bundesstrasse 55, Hamburg, Germany SBN 354G'19t458 SpringerVerlag Berlin Heidelberg New York SBN G SpringerVerlag New York Berlin Heidelberg Apart from any fair dealing for the purposes of research or private surdy, or criticism or review, as permined under the Copyright, Designs and Patents Act 19E8, this publication may only be rcproduced, storcd or transmitted, in any form or by any me8ns, with the prior permission in writing of the publishers, or in the case of reprographic reproduction in accordance with the terms of licences issued by the Copyright Licensing Agency. Enquiries concerning rcproduction outside those terms strould be sent to the publistrers. G SpringerVerlag London Limited 1993 Printed in Great Britain The publistrermakes no rcprcscnbtion, expreer or implicd, with regard to the accuracy of the information contained in thie book and cannot accept any legal responsibility or liability for any emors or omissions that may be made. Tlpesetting: Camen ready by author hinted and bound by Antony Rowe Ltrl., Chippentram, Wiltstrirp 69/383G' Printed on acidfree paper
6 'r\ P rrerace '[']rc sr:rninal work of Morse, Nussbaurn and Willems & l3yrrres irr 1983/4 has initiated the study of adaptive controllers for dyramical systems in which the adaptation strategy does not invoke any identification mechanism. Over the last clecaclc, this field of adaptive control has become a rnajor research t,opic. ''he present work gives a rather complete'state of the arrt'of the following more specific area: The system classes under consideration contain linear (possibly nonlinearly perturbed), finite dimensional, continuous tirne systems which are stabilizable by highgain output feedback, therefore, in particular the system is rninimum phase. Simple aclaptive controllers involving a simple switching strategy in the feedback are designed. The switching strategy is mainly tuned by a one parameter controller based on output data alone. Control objectives consiclcrcd are stabilization, tracking, and servomechanisnr action. n addition, robustness with respect to nonlinear perturbations and perforrnance improvements are investigated. wrote the present text during a two years research visit to the Centre for Systerrrs :rnd Control Engineering at the University of Exeter, U.K., frorn October September The hospitality of the centre, with its stimulating environrnent, made a big contribution and thank especially Dave Owens and Stuart, 'lownley, of the centre, for numerous helpful discussions and suggestions. [ :rlso benefitted frorn many stimulating discussions rn'ith Gene Ryan of the Univcrsity of Bath and Hartmut Logemann of the University of Bremen. am indebted to leinrich Voß of the University of larnburg who read the mzrnuscript ancl rnade several critical and helpful comments. Finally, thanks are due to Dir:t,er Neuffer frorn the University of Stuttgart who spent considerable tirne an<l pat,iencc on introclucing me to SMULNK and MATLA. My visit was nr:rclr: possible by o two years research grzrnt from Deutsche Forschutrgsgt:rrte,ittschzrft (DFC;) ancl additional support carr]e frorn the University of Exeter zrnd thc iic SCFNC prograrrrne, whicir zrre hereby gratefrrlly acknowledged. arnl;urg, tebrrtary, 1993 Ar:hzrn ilr:htnann
7
8 Contents Nornenclature ix rrtroduction HighGain Stabilizability 2.1 Minimurn phase systems 2.2 llighgain stabilizable systems Notes and References 28 Ahnost Strict Positive Realness 3.1 Almost strictly positive real systems 3.2 Minimum phase systems 3.3 Notes and References Jniversal Adaptive Stabilization Switching functions Stabilization via Nussbaumtype switching Stabilizatiorr via switching decision function FJxponential stabilization via exponential weighting factor Exponential stabilization via piecewise constant gain Notes and References 101 fjniversal Adaptive T\'acking 5.1 Asymptotic tracking 5.2 )'lracking 5.3 Notes ancllteferences l1'2 t.)9 L.)
9 vltt CONTENt'S 6 R.obustness L Additive nonlinear state and input perturbations 6.2 Sector bounded inputoutput nonlinearities 6.3 )Tracking controller r25 t34 r Notes and References Perforrnarlce mproved output and gain behaviour Arbitrary good transient and steadystate response Notes and References 183 Exponential Stability of the Terrninal Systern Rootloci of minimum phase systems 8.2 Topological aspects 8.3 Notes and References 186 r Referencers t97 ndex 203
10 NorrrenclatLlre l/ ltr+ (rr_ ) a+(a) R[.r]'' "" R(") "  G L,,(K) r].r (o),(a) /r"'i" (1)) /r,r* (Ä) lal l'l l" ll'll LrQ) {1,..., i/} the set of nonnegativc (nonposit,ive) real open right (left) half conrplex plarre the set of rn x rrl rnatrices ovcr the polynornials ring of real the set of rn x m matrices over the fielcl of rational real functions general linear group of invertible n x n rnatrices with entries in 1{ {* e l lllrll < Ä} for rn N, ) > 0 the spectrurn of the matrix,4 g (ln x't rnininral singular value of the rnatrix A C,"^" maxinral singular value of thc rnatrix A e C,"*'n the determinant of the matrix A e C"^" numbers positive \t< r,p'r > for r [t',p  pt' ]R'"' definite ll'llrtlre vector space of rnea,srrrable firnctions / :  U1.", 1C R an interval, z being defirrecl by the context,, srrctr that l/( ) lt4,1(,):), wht:re
11 NOMENC4TURE ll/( ) llr"1'; c, (1, R) wr,* (1, R) d.r( ), Dr(')  ( r rr/p l/ll/(")ll"a"l { Lr es sup llf (") ll lr s for p [l,oo) f"r p  oo the vector space of ptimes continuously differentiable functions/ : * R*,p NU{oo} the Sobolev space of functions / :, * R which are absolutely continuous on compact intervals and /('), /(') g.["" (R) ' 'distance' functions defined in (5.12) respectively (518)
12 Chapter 1 ntroduction A wide range of control theory deals with the design of a feedback controller for a. knoutn plant so tirat certain control objectives are achieved. The fundarnental clifference between this approach and that of adaptiue controlis that in adaptive corrtrol the plant is ttot knoun exactly, only structural information is available, e.g. nrinirnality, rninimum phase, or known relative degree. The aim is therefore to clesign a single controller which achieves prespecified control objectives for every rnember of a given class. The controller has to learn from the output data and, b:rsed on this information, to adjust its parameters. The first, attempts in adaptive control go back to the late 1950's, but it was only in the 1970's that a breakthrough was made. Subsequently, during the 1980's the field of adaptive control has matured. For a survey see Aströln (1987) and Narendra (1991). Up to the end of the 1970's, adaptive controllers were a combination of identification or estimation mechanisms of the plant paranreters together with a feedback controller. An area of nonidentzfierbased adaptive control was initiated by Mareels (1984), Märtensson (1985), Morse (1983), Nussbaum (1983), and Willems and Byrnes (1984). n their approach, the adaptive feedback strategy is not based on any identification or estirnation of the process to be controlled. This seminal work opened up an intensively studied specialised field within adaptive control, where the class of systems under consideration are either minirnum phase or, more generally, only stabilizable and detectable. See lchmann (1991) for a survey. n the present text, nonidentifierbased adaptive controllers for minimum phase systems are studied, thus all controllers are designed according to the highgazn properties of the system class. No assumptions are made on the upper bound of the order of the process, nor on the upper bound of the sign of the highfrecluency gain, no injection of probing signals is required, and the control strat,egy is rnore efficient than for nonminimum phase systems. 'he objective is to provide a single controller (consisting of a feedback law ancl a pararrreter zrdaptation l:rw) which can control each system belonging to a certain cla.ss of
13 2 systems. The control objectives are stabilization, tracking or servornechanism action, partly under performance requirements and in the presence of nonlinear perturbations. We illustrate the idea by the simplest example we can think of:''he system to be st,abilized belongs to the class of scalar systems describecl by b(t) y(t) ar(t) + öu(l) cx(t), z(0)  xs) (1 t) where e,b,c,ro R are unknown and the only structural assumption is cö > 0, i.e. the sign of the highfrequency gain is known to be positive. lf we apply the feedback law u(t)  ky(t) to (1.1), then the closedloop system has the form i(t) la kcblr(t),r(0)  x:s (12) Clearly, if aflcbl < lßl and sfgn(ß) : sign(cb), then (1 2) isexponentiallyst,able. {owever, a,b,c are not known and thus the problem is to find adaptively an appropriate k so that the motion of the feedback system tends to zero. Now a timeuarying feedback is built into the feedback law u(t)  k(t)y(t), (i.3) where,t(t) has to be adjusted so that it gets large enough to ensure stability but also remains bounded. This can be achieved by the adaptation rule Ä1ry  y(t)2, e(0) R (1 4) The nonlinear closedloop system (1.1), (1.3),(1.4), i.e. J'(t)  la  k(t)cbfu(t), k(t)  "' l: "(")'ds * e(0), (*(0),'(0)) R2 (1 5) has at least a solution on a small interval [0,r), and the nontrivial solution r(t) _ "flt"ft( s )crjas r19; is rnonotonically increasing as long as c  k(t)cb ) 0. lence k(l) 2 l(cr(o))' + ft(o) increases as well. Therefore, there exists at* ) 0 such that o k(t. )cä  g and (1.5) yields o  ft(f)cö < 0 for all t > t*. lence the solution r(t) decays exponentially and liml*"" e(r)  ßoo R exists. This is a special example for the following concept of universal adaptive control. Suppose E denotes a certain class of linear, finite dimensional, tinrcinvariant systems of the form i(t) vu) Ar(t) + Bu(t), z(0)  C r(t) + Du(t) ' g \ t (1 6)
14 3 wlrere: (tl, B,C,D) [R'xn x R'',x'2 x R,'"" x R'r'x') are unknown, nt is usually fixecl, t,he state dirnension n is an arbitrary and unknown nurnber. 'fhe aim is to design a single adaptive output feedback mechanisrn,rr(l)  f (y( )lto,rl) which is a universal stabilizer for the class. i.e. if "(l)  f (y( )llo'l) is applied to any systenr (1.6) belonging to, then the output 37(l) of the closedloop system tends to zero as tends to infinity and the intcrtral variables are bounded. n the present t,ext, most of the adaptive stabilizers are of the following sinrple forrn (cf. F igtrre 1.1): A 'tuning' parameter A(l), generated by an aclaptation law k(t)  g(y(l)),,t(0),lo, (r 7 t whcrc g :R'' * R is continuous and locally Lipschitz, is irnplementecl into thc fc,'rlback law via u(t)  F(,L(t))y(t), whert: l/ :R r trr"* is piecewise continuous ancl locally Lipschitz. (t 8) r t Adaptive Controller Adaptation Law Process i:arbu a:cr*du L Figure 1.1: Universal adaptive stabilizer Definitiorr A controller, consisting of the aclaptation law (1 7) ancl the feedback rule (1.8), is c.af lr:rl a ttniue.rsul adaptiue stabilizerfor the class of systems X, if for arbitrary init,iäl condition ro l" and any system (1.6) belonging to, tiie closc.rlloop systenr (1 6)(1.8) has a solution the properties (i) t,lrere cxists zr unique solution (r( ),Ä'()):[U, x)  R'.'+1, (ii) e,( ), y(.), rr( ), t'(.) are boundccl,
15 (iii) lirnl*oo y(t)  0, (i") liml*oo k(r)  ßoo R exists. The concept of adaptive tracking is similar. Suppose a class./rer of reference signals is given. t is desired that the error between the output y(t) of (1.6) and the reference signal y."r(l) "(t) : y(t)  y..r(t) is forced, via a simple adaptive feedback mechanism, either to zero or towards a ball around zero of arbitrary small prespecified radius Ä > 0. The latter is called )tracking. To achieve asymptotic tracking, an internal model itr) u(t)  A e (t) * B* u(t), (0) : 40 : c e (t) * D* u(t) ( 1.e) wlrere (A*, B*, C*, D") e [t"'" n' y Tf7.n'Xtnx R"'' x Rt, i, implemented in series interconnection with an universal The precompensator resp. internal model reference signals. An internal model is not adaptive stabilizer, cf. Figure 1.2. (1.9) contains the dynamics of the necessary if Atracking is desired. Adaptive Tracking Controller nternal Model Process 9."f : A' * B'u u:c'4* D' i:ar*bu gcr*du Figure 1.2: Universal Adaptive Tlacking with nternal Model Definition A controller, consisting of an adaptation lau,t(1.7), a feedback lau (1 8), and an internal model (1 9) is called a uniuersal adaptiue tracking controller for the class of systems! and reference signals.)y'..r, if for every U."r(.).)."r. ts R', o R"', and every system (1.6) belonging to X, the closedloop systern (1 6)(1.9) satisfies
16 5 (i) t,here exists a unique solution (r( ), ( ),f(.))'[0,m) * R72+n'+i (ii) the variables r(/),y(t), r(r), (l) 'blow up' no faster than 9.er(l), (iii) limt*o,[y(t)  9..r(l)]  0, (ir') liml*"o fr(l)  k.'. R exists. F'or prespecifiecl Ä > 0, (1 7), (1,8) is called a un,zaersal adapt.iue \stabzlizer resp. ),tracking controllerif (i),(ii), and (iv) hold true, but instead of (iii) the weaker condition [v(t)  e.er(l)]  E^(o) as l*oo is satisfied, i.e. the error e(l) approacires the closed as tcnds to oo. f zr universal adaptive controller is applied to ( 1.6) then we call the systern L the termznol systern, provided it is well defined. ball of radius ) around zero for some (ro, Ao) R." x R, '(,t,))tcl r(r) J Many results presented in this text fit into the framework described above. We will also consider linear systerns subjected to nonlinear perturbations in the state, input and output, corrupted input and output, noise, and nonclillerentiable gain adaptation. Due to the nonlinearities, the solution of the closedloop systern of t,he norninal system and ttre aclaptive feedback rnechanisrn is no longer unique, but all solution will meet the desired control objectives. Some feedback strategies contain nondifferential gain adaptation, other have multiparameter gain adaptation, i.e. g(.) i" (1 7) is a mapping from Rto R' for some n{ > 1. Many results can be extended, by no mearrs trivially, to classes of infinitedimensional systems. This will not be treated here, but the zrva.ilable literature is discussed in the sections'notes and References'ending each chapter. ''tre outline of the chapters is as follows. n Chapter 2 ancl 3 we do not deal with any adaptation rnechanisrns, inst,ead the systern classes under consi<ieration are analysecl ancl results to be used later are prr:parcd. n ('Lrapter 2, we study irr detail the piropi:rtics of nrult,ivzrri:rblc rnininlunr plrzrse sysl,errrs, give corrvenit:nt, slat,e spac.e forrns, prove the so called highgain lcmrnat,a for relative clegree ancl 2 systr:rns, and clr:rive irnl>ortant, incclualitit:s relaling past inputs ;rncl out,1>uts with t]re present, output. T'lris k:ads t,o a ral, her cornplete understanding of highgain stzrbilizable systerns and toc,ls which
17 will be used throughout the remaining chapters. n Chapter 3, the class of strictly positive real ancl alrnost strictly positivc real systems is investigated. Although this class is more restrictive than minimunr phase systems it turns out that, by simplc input and output transformations, every minimum phase system is equivalent to an almost strictly positive real system. The result will become important for the stability proofs of adaptive stabilizers given in Chapter 4. Recently published results on multivariable strictly positive real systems, in particular its relationsphip to the Lur'e equations, are used to understand the effect of highgain control, and simplify the proofs for adaptive stabilizers. Moreover, it allows consideration not only of strictly proper, but of proper linear systems. n the first section of Chapter 4, the concept of switching functions is studied. Different switching functions are introduced and it is shown how they relate to the Nussbaum conditions. These results are needed for the remaining sections of the chapter. n Section 4.2, various universal adaptive stabilizers based on Nussbaumtype switching are derived for systems (A, B,C,D) under milcl assumptions on the highfrequency gain matrix. A universal adaptive stabilizer for the class of all singleinput, singleoutput, positive or negative highgain stabilizable systems is given. Throughout the section the feedback strategy is continuous respectively piecewise continuous, i.e. f'(.) in (1.8) is continuous respectively piecewise constant. n Section 4.3, an alternative switching strategy based on a switching decision function is introduced. Apart from robustness properties shown in Chapter 6, the advantage of this different approach is tliat there is no need to implement a scalinginvariant Nussbaum function whicli is behaving very rapidly. n Sections 4.4 and 4.5, we deal with the problem of how to obtain exponential decay of the state r(l) of the closedloop system. n Section 4.4, this is achieved by introducing an exponential weighting factor in the gain adaptation, whereas in Section 4.5 a different approach uses piecewise constant gain implementation in the feedback strategy. n Chapter 5, the problem of how to track signals belonging to a class of reference signals is investigated. One solution to the problem of asymptotic tracking is presented in Section 5.1. We use series interconnection between arr internal model, representing the dynamics of the reference signals, and universal adaptive stabilizers studied in Chapter 4. This approach is restricted to sinusoid reference signals, whereas in Section 5.2, at the expense of Atracking, a controller using deadzones is introduced which does not invoke an internal model and works for a much larger class of reference signals. Well posedness and robustness properties of the universal adaptive stabilizers of Chapter 4 and the asymptotic and )tracking controllers of Chapter 5 are investigated in Chapter 6. n Section 6.1, it is proved that the problern of universal adaptive stabilization is well posed with respecr to nonlinearities in the state equation of the nominal system. Robustness with respect to other nonlinear perturbations is proved. n section 6.2, rve show that rnanluniversal adaptive stabilizers of singleinput, singleoutput systems tolerate sector bouncled inputoutput nonlinearities, for multiinput, multioutput almost strictly positive real systems ever multivariable sector bouncled inputoutput nonlinea
18 rities are allowed. n Section 6.3, we prove t,hat the Ästabilization respectively )tracking controller is capable of toierating a nruch larger class of nonlinear perturbations in the input ancl state as well as sect,or bounded inputoutput nonlinearities, even input and output corruptecl noise is allou'ecl. 'fhe purpose of Section 7.1. is to illustrate the qualitative dynarnical behaviour of nrany universal adaptivc stabilizers and to introcluce modifications of the previous universal adaptive stabilizers and )tracking controllers which lead to an improvement of the transient behaviour. n Section 7.2, a universal adaptive stabilizer is designed whic.h, at the expense of derivative feedback, achieves (prespecified) arbitrarily srnall overshoot, of the outprut, and, rrloreover, guarantees that the output is less thern an zrrbitrarily small, prespecified constant in an arbitrarily small, prespecified period of time. 'he results on rootloci of singleinput, singleoutjrut nrininrum phase systems rlerived in Section 8.1 are used in Section 8.2 to show that that the piecewise constant stabilizer introduced in Section 4.5'almost always'(w.r.t. tlie sequence of thresholds) yields an exponentially stable terminal system. Each chapter is finalized with a section on the literature and related problenrs, in particular, extendecl results for infinitedinrensional systems are quoted.
19 8
20 Chapter 2 High Gain Stab ilizability n this chapter, we derive several properties of highgain stabilizable and/or minimum phase systems which are essential for getting a deeper insight into these system classes, and wtrich will be used throughout the remaining chapters. 2.L Minirnurn phase systems We shall show that all nontrivial systems which are stabilizable by highgain output feedback are necessarily minimum phase. Therefore, it is important to study the class of minimum phase systems. We will also give simple and convenient state space forms for relative degree or 2 systems and prove a crucial integral inequality relating past input and output data to the present output. Definition Let G(.) e m(s;rrlxln be a rational matrix with SmilhMcMillan form r.. (s) diag {( "r(s)'',ä3,0',0)  U(r)tC(")tz(")' (2.r) where U(.),V(.) e R["]x are unimodular, r,bp1")g(.) : r, e;(.),,lrro R[s] are monic and coprime and satisfy et1.)le;+r(), rlrr+t(.)lrlrr(.) for i ,...,r. Set + + e (s): ll e;(s), ü(") ' ll ü;(') i=l.s6 is a (transntzssion) zero of G(.), if e(so) : 0, and a pole of G(), if y'(.so) : 0. f G()  g( ) tr[s], then d"gy'(.)  dege( ) is called Lhe relatzue degree of s () i
21 10 CHAP']:T:R 2. HGHGÄ.N STABLZABL'Y {;() is ptoper resp. strtctly propet' if deg r/,( ) > dege(.) resp. d"g,/,(.) > dege(.). 'he system i(t) = Ar(t)*Ru(t), v(t)  cr(t)+du(t) with (A,B.,C,D) R"' x m,'"^ x fli. n'*' x l.*'', i" called a minimal realization of G() R(s)*, if (A, B) is controllable and (,4, C) is observable ancl G(s)  C(s^  A)rB + D. G() is said to be minimum phase, if e(s) 0 for all.s e O1. A state space system (A,B,C,D) R'x'r x TR'z'^ x R*"' x R',* is called minimum phase, if it is stabilizable and detectable and G(") ha^s no zeros in c+. A characterization of the minimum phase condition for state space system is given in the following proposition. Proposition 2..2 (A, B, C, D) R'x' det xil RN i' K TfT all s O1 if, a.d only if, the (f following,win. three f l conditio.s lol ns are af( :e satisfied (i) rklslna,bl :n. n for all s 6i e ( C1, i.e.(a,b) isstabilizablebystate feedback,.["t_ Al  (tt) rk : t for all s C+, i.e. (,4,C) is detectable, L C J (iii) G(") has no zeros in O=,.. r, l"i L s,. C a) A rh xr ffl. B D X J T. J R 0 ftx' fi7 fo)r satisfies Proof: We trse the notation of Definition Coppel (1974), 'fheorenr 10, has proved that, if (Ä, B,C) is detectable ancl stabilizable, then so O+ is a zero of r/,( ) (including multiplicity) if and only if it is a zero of det(.1,  A). Using this result together with Schur's forrnula, see e.g. Gantmacher (195g), the proposition follows from s[,,  ' A B ', _ t^t Al rr /1/^r,rr1n, ls1r. Ä D
22 2.1. M{TMUN{ PHASE S}'S?EMS 1l ''he following lenrrna provides a useful state space fortn into which every systenr u (l) v(t) Ar(t) * Bu(t), C r(t), r(0)ro R' (2 2) witlr (,4,8,C) R'"'x.lRrlx x R"'with det(cb) f 0 can be converted. 'f5r state space transformation is representing the direct sum of the range of B alcl t,he kernel of C. t makes possible the separation of the inputs and orrtputs fronr the rest of the system states. Leurrna 2L.3 (lorrsicler the system (2.2) with det(c13) a basis rnatrix of ker C. t follows that g, lc', N')t, where l/ : (V'V) state space transformation (y',,')'  (2.2) into 0 and let,/ JR'x('.l clenote.9 : lb(cb)t, Y] has t,he inverse t v' lt.  B(CB)1cr]. lerrce the S 1c  ((C *)t., (Nr)t)' converts v(t) t (t) Ary(t) * Azz(t) + CBU(t) Asy(t) + A4z(t) ( v(0) '(0) J n1 L) & t). (23) lere At R*^,A, Rx(nrn),At e 6(nzn)*^,,An R("'n)x(n"n), so that Av A2 A3 Aa  Sr AS. f (,.4,8,C) is minimum phase, then,4a in (2 3) is asymptotically stable. Proof: The proof of the transformation is straightforward ancl therefore onrittecl. Stability of Aa is a consequence of det(c B) + 0, the minirnum phase assumption, and of the following equation which holds for all s e C1 slna C B 0 slrn  A1 As rn 42 snrn  Aq 0 CB lc B l.l"1, rn  Aol * 0.! ior strictly proper, scalar, nrinimurn pliase systerrrs of relative dcgree 2, a slightly rnore complicated brrt still very useful stat,e space clescription is also avail:rblr:.
23 2 CHAP'ET 2. HGH.GÄN STAB,ZABLTY d('y,).\ 1 o1/ f: nlü(t)  1", #f a[ llüio l+l,e \ z(t)l Lo, 'öo ;")\",t>) L;"1 where dz R, 04, as R'', Au R('" 2)x(n2). lf (2.2) is minimum phase, then a(aa) C C. u(t,) (2.4) Proof: Choose V R'x('2) of full rank so thar k",l:")  V trt"2 t is easily verified, that the inverse of t si' : lcabv. V* : (V'V)tV', and hence e : cs1 and eäb LoAyields A t (SrSz)taSrSz Moreover, ö52  e, S;tb 6, and cazb wrth S:.9rS2. Using (2.4), we have,91 :: : c o ::  eä2b  [Ab, b,v](cab)1 ca _ n#" [r"  (ou [1,0,...,0], ä : 5, 1ö: J.:r., oj  cab. Applying elementrary row and o o si,,[t 1 t L: ;,:_,] L Lernrna 2.L.4 f the system (2.2) is singleinput, singleoutput, (A, B,C)  (A., b, c), and of relative degree 2,i.e. cb  0, cab f 0, then there exists a coordinate transforinto mation S e GL,(R), such that Srr : (y,ü,t')' converts (2.2) 4.. columm operation r o o * 1 * l 0 0 n_z J 1 0 a3 "[ bca(cab) s1.4s,  0 A e a3cab, l and is givcnby 'll S tt t, * 1 * + * + * * * 1 of the fornt hence (2 4) holds )1,, A b c 0 ) )os a[ 0 Ä,.*z  Ae cab 0 0 cab.l)/,z ,4ol
24 2. j. MNNUM PASE SYSTEMS 1.) Lr) ff (2.2) is nrinimum Phase, then arrd hetrce Ae is asymptotically it follorvs that länz  Aal + 0 for all ) stable. This completes the proof. O+, D Anot her itrrportant consequenceof strictly proper minimurn phase systerns rvitir linr,*.',, s(i(s) Gf'.(R) (for singleinput, singleoutput this simply means they are of relative degree 1) is, that a sirnple inputoutput description of the svsteln is Possible. Lernrna 2L5 f t,he syst,em (2.2) is mininrum phase r,r'ith det(cf)) f 0, then there exists a bounded and causal operator L : Lo(O, oo) * Lr(0, m), for all P [], rc], so that the inputoutput behaviour of (2.2) is described by y(t)  A1y(r) + L(a()) (t) * CBu(t) + u(t), y(0)  Cro (2 5) wittr,4r R", and (')'[0,)* R all exponentially decaying analytic function taking into account the initial condition of a part of the internal state. Figure 2.1: nputoutput Description Proof: Without lossof generality we nray in the form (2 3). Definethe causal opcrator assume that ttre systern (2.2) is L(a( ))tt)  Az.l o t ea,(t.') A*lG)dr.
25 T4 CAPTER 2. {GGÄ{ STABLZAB.TY Since Aq is asymptotically stable, there exist Mr, ) 0, so that ll"o"'ll 1 M1e't for all t > 0. This yields, see e.g. Vidyasagar (1978) pp , that lll(y)( )llr p(o,t) L 'fherefore, f : Lo(0, oo) * Lr(0, oo) is well defined and bounded. By applying Variations of Constants to the second equatiorr in (2.3), and inserting z(l) into the first equation, we obtain l " ü0 = As(t)*Azl"o^'z(0) + *CBu(t). J"on(t')ery1";a"l L U J Setting u(t)  AzeAn'r(0), the proof of the lemma is complete. n For strictly proper minimum phase systems (A, B, C) with det(c B) 0, it is possible to relate the present output to past output and input data via the following inequality, where no information of the state variables is required. This will be an another important tool for the stability proofs of universal adaptive stabilizers in Chapter 4. Lerrrrna 2.L.6 Suppose the system (2.2) is rninimurn ptraseand satisfies del(cb) t' 0. Let P() : R^ * R, v,* lfu)  (., ) ffic if a+0 l. o if v:0. Then for every positivedefinite matrix P  Pr R"'' (depending only on A, B,C and P) such tlrat there exists ' > A r ^ ' r i = tlvt,)llä 2""' "' ' J" J, or, more general, for arbitrary p > 1, it holds that, i i _llrtt)llp"< tvlllrsllp+,lr / ttots)llpds+ ltrt')llot'(p(v(")),p('btt(s))d P t r t, (2 T) for arbitrary initial condition r(0) R', for arbitrary piecervise continuous u(') : * [0,c.,') R'', where cr (0,.c], a1d for all [0,.)
26 2.1. MNTMUM PHASE SYSTEMS 15 Proof: (.), We first consider the case p:2 (2 5) yields, for all s [0,c.,'), r d,,,,.rr1. t,ß(llv(")llf')  (v("), PAty(s) + l'u,(s) + PL(y) (") + PCBu(s)) ö o for + (v("), PCBU(s)) (2 8) Mz:llPAtll + llpll Applying ölder's inequality and using (26) gives r / r \ r l r /', \'/', \' J ttrt")il ill(yt(s)llds s l,lv(")il'd"l l,tctü(s)il'. \l / \i ),rs 0 t llv(")ll'd' (2 e) and, since tr(s)  A2eAn'z(0), S e t. rl r llly(s)ll lltr(s)llds o ( (, t r \ 6 ; \ ' tlrt'lll'a" 6 / M3llz(0)ll llv(")ll2ds + u3ll,(o)ll' (2 10) for Ms: sup r>0 (t,azea",'r") 2 0 ntegration of (2.8) over [0,1] and [0,c,,,), inserting (2.9) and (2.10) yields, for all )no...lt', 1 2 llv(o)ll? +M.,  llz )t z + t + MrMSll:10)ll2 + (v("), P C Bu(s))ds.l 0.l 0 t lly(") ll'd". ) 7),i ''his proves the first inequalit,lrt itv. (b), 'he map ** lly(r)l lp isnot differentiable but, since V(.) is differentiable, it is absolutely continuous. Tl T] fherefore, the set,11 : {t' = f0, [0, ). t^t ) llv(t )llp is nol cliflr:renl,iable]
27 16 CAPTER 2. GH.GÄN SA'ABLZABLTY is of measure zero. LeL,, Jz : "(') Now a routine calculation gives, for all s Thus it follows frorn : ; *(ttv(")ttä) where An application,() Lp(0,t), {t e [0, c,.,) fttrt"ltto = f (v(") { llv (2.5) that, for all s llv(")llä' ( ri is not continuous at t ) R+ \ (/r g ir),. Pü(s)) / \ ffi,v(')*o 0,y(s)  0. R+ \ (/t g Jz), ), P A1y(s) M4: llpll"+ illp1'll + llplll of Hölder's inequality gives, for q  FPu(s) + PL(y) (") + PCBU(s)l [llv(")l lo + lll(v) (")llllv(")llo' +l ly(") lloi' PCBU(s)), f,,o li J ttrtrllr' llu(s)llas L'. J L"t J f, +lly(")llo' ll(") lll 1 r 1  ' q ' p 1 and every.f',0 11) Since Jru Jz is of measure zero, integration of *llv(")llpo over [0,r] \ (./r u yields, by using (2.11), for all t [0,r,r), r  r  i s + ;ltatt)llä ittvtolllä lla{")llp'(p(y(s)), PCBU(s))ds Jz) t f *Ms 0 llv(")llo + llv(")llo' illc(v)(")ll + ll(")lll d" jttrroltt'" t +.l 0 lly(") llr' U3(y(")), PC Bu(s))ds +,v/s llv( )ill," (o,r) + llv(')tl?lä,'t llc(v) ( )llro(0,r) +llv( )ll?lä,,rllollr"1o,,.l],
CONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
More informationExample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x
Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written
More informationVictims Compensation Claim Status of All Pending Claims and Claims Decided Within the Last Three Years
Claim#:021914174 Initials: J.T. Last4SSN: 6996 DOB: 5/3/1970 Crime Date: 4/30/2013 Status: Claim is currently under review. Decision expected within 7 days Claim#:041715334 Initials: M.S. Last4SSN: 2957
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationOPTIMAl PREMIUM CONTROl IN A NONliFE INSURANCE BUSINESS
ONDERZOEKSRAPPORT NR 8904 OPTIMAl PREMIUM CONTROl IN A NONliFE INSURANCE BUSINESS BY M. VANDEBROEK & J. DHAENE D/1989/2376/5 1 IN A OPTIMAl PREMIUM CONTROl NONliFE INSURANCE BUSINESS By Martina Vandebroek
More information1. L a m e j o r o p c ió n e s c l o na r e l d i s co ( s e e x p li c a r á d es p u é s ).
PROCEDIMIENTO DE RECUPERACION Y COPIAS DE SEGURIDAD DEL CORTAFUEGOS LINUX P ar a p od e r re c u p e ra r nu e s t r o c o rt a f u e go s an t e un d es a s t r e ( r ot u r a d e l di s c o o d e l a
More informationLecture 13 Linear quadratic Lyapunov theory
EE363 Winter 289 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discretetime
More informationG(s) = Y (s)/u(s) In this representation, the output is always the Transfer function times the input. Y (s) = G(s)U(s).
Transfer Functions The transfer function of a linear system is the ratio of the Laplace Transform of the output to the Laplace Transform of the input, i.e., Y (s)/u(s). Denoting this ratio by G(s), i.e.,
More informationFactorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
More informationFuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More informationB I N G O B I N G O. Hf Cd Na Nb Lr. I Fl Fr Mo Si. Ho Bi Ce Eu Ac. Md Co P Pa Tc. Uut Rh K N. Sb At Md H. Bh Cm H Bi Es. Mo Uus Lu P F.
Hf Cd Na Nb Lr Ho Bi Ce u Ac I Fl Fr Mo i Md Co P Pa Tc Uut Rh K N Dy Cl N Am b At Md H Y Bh Cm H Bi s Mo Uus Lu P F Cu Ar Ag Mg K Thomas Jefferson National Accelerator Facility  Office of cience ducation
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationTHREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationSCO TT G LEA SO N D EM O Z G EB R E
SCO TT G LEA SO N D EM O Z G EB R E EG Z IA B H ER e d it o r s N ) LICA TIO N S A N D M ETH O D S t DVD N CLUDED C o n t e n Ls Pr e fa c e x v G l o b a l N a v i g a t i o n Sa t e llit e S y s t e
More informationWeek 5: Binary Relations
1 Binary Relations Week 5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More informationChapter 12 Modal Decomposition of StateSpace Models 12.1 Introduction The solutions obtained in previous chapters, whether in time domain or transfor
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter
More informationForm: Parental Consent for Blood Donation
A R C Wt, C 20006 Ptl Ct f B i Ifi T f t y t ll f i y tl t q y t l A R C ly. Pl ll 1800RECROSS (18007332767) v. if y v q r t t i I iv t f yr,, t, y v t t: 1. Y y t t l i ly, 2. Y y t t t l i ( k
More informationBOUNDED, ASYMPTOTICALLY STABLE, AND L 1 SOLUTIONS OF CAPUTO FRACTIONAL DIFFERENTIAL EQUATIONS. Muhammad N. Islam
Opuscula Math. 35, no. 2 (215), 181 19 http://dx.doi.org/1.7494/opmath.215.35.2.181 Opuscula Mathematica BOUNDED, ASYMPTOTICALLY STABLE, AND L 1 SOLUTIONS OF CAPUTO FRACTIONAL DIFFERENTIAL EQUATIONS Muhammad
More informationDecisionmaking with the AHP: Why is the principal eigenvector necessary
European Journal of Operational Research 145 (2003) 85 91 Decision Aiding Decisionmaking with the AHP: Why is the principal eigenvector necessary Thomas L. Saaty * University of Pittsburgh, Pittsburgh,
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationLOOP TRANSFER RECOVERY FOR SAMPLEDDATA SYSTEMS 1
LOOP TRANSFER RECOVERY FOR SAMPLEDDATA SYSTEMS 1 Henrik Niemann Jakob Stoustrup Mike Lind Rank Bahram Shafai Dept. of Automation, Technical University of Denmark, Building 326, DK2800 Lyngby, Denmark
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationC o a t i a n P u b l i c D e b tm a n a g e m e n t a n d C h a l l e n g e s o f M a k e t D e v e l o p m e n t Z a g e bo 8 t h A p i l 2 0 1 1 h t t pdd w w wp i j fp h D p u b l i c2 d e b td S t
More informationOPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN. E.V. Grigorieva. E.N. Khailov
DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS Supplement Volume 2005 pp. 345 354 OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN E.V. Grigorieva Department of Mathematics
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationVilnius University. Faculty of Mathematics and Informatics. Gintautas Bareikis
Vilnius University Faculty of Mathematics and Informatics Gintautas Bareikis CONTENT Chapter 1. SIMPLE AND COMPOUND INTEREST 1.1 Simple interest......................................................................
More informationChem 115 POGIL Worksheet  Week 4 Moles & Stoichiometry
Chem 115 POGIL Worksheet  Week 4 Moles & Stoichiometry Why? Chemists are concerned with mass relationships in chemical reactions, usually run on a macroscopic scale (grams, kilograms, etc.). To deal with
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationH ig h L e v e l O v e r v iew. S te p h a n M a rt in. S e n io r S y s te m A rc h i te ct
H ig h L e v e l O v e r v iew S te p h a n M a rt in S e n io r S y s te m A rc h i te ct OPEN XCHANGE Architecture Overview A ge nda D es ig n G o als A rc h i te ct u re O ve rv i ew S c a l a b ili
More informationSome stability results of parameter identification in a jump diffusion model
Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationInner products on R n, and more
Inner products on R n, and more Peyam Ryan Tabrizian Friday, April 12th, 2013 1 Introduction You might be wondering: Are there inner products on R n that are not the usual dot product x y = x 1 y 1 + +
More informationDesign Methods for Control Systems
Design Methods for Control Systems Okko H. Bosgra Delft University of Technology Delft, The Netherlands Huibert Kwakernaak Emeritus Professor University of Twente Enschede, The Netherlands Gjerrit Meinsma
More informationGeneral Theory of Differential Equations Sections 2.8, 3.13.2, 4.1
A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics General Theory of Differential Equations Sections 2.8, 3.13.2, 4.1 Dr. John Ehrke Department of Mathematics Fall 2012 Questions
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationLinear Control Systems
Chapter 3 Linear Control Systems Topics : 1. Controllability 2. Observability 3. Linear Feedback 4. Realization Theory Copyright c Claudiu C. Remsing, 26. All rights reserved. 7 C.C. Remsing 71 Intuitively,
More informationSection 8.8. 1. The given line has equations. x = 3 + t(13 3) = 3 + 10t, y = 2 + t(3 + 2) = 2 + 5t, z = 7 + t( 8 7) = 7 15t.
. The given line has equations Section 8.8 x + t( ) + 0t, y + t( + ) + t, z 7 + t( 8 7) 7 t. The line meets the plane y 0 in the point (x, 0, z), where 0 + t, or t /. The corresponding values for x and
More informationOPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem")
OPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem") BY Y. S. CHOW, S. MORIGUTI, H. ROBBINS AND S. M. SAMUELS ABSTRACT n rankable persons appear sequentially in random order. At the ith
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationChapter 2: Binomial Methods and the BlackScholes Formula
Chapter 2: Binomial Methods and the BlackScholes Formula 2.1 Binomial Trees We consider a financial market consisting of a bond B t = B(t), a stock S t = S(t), and a calloption C t = C(t), where the
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationTransient Voltage Suppressor SMBJ5.0  SMBJ440CA
Features: Glass passivated junction Low incremental surge resistance, excellent clamping capability 600W peak pulse power capability with a 10/1,000μs waveform, repetition rate (duty cycle): 0.01% Very
More informationWHICH LINEARFRACTIONAL TRANSFORMATIONS INDUCE ROTATIONS OF THE SPHERE?
WHICH LINEARFRACTIONAL TRANSFORMATIONS INDUCE ROTATIONS OF THE SPHERE? JOEL H. SHAPIRO Abstract. These notes supplement the discussion of linear fractional mappings presented in a beginning graduate course
More informationChem 115 POGIL Worksheet  Week 4 Moles & Stoichiometry Answers
Key Questions & Exercises Chem 115 POGIL Worksheet  Week 4 Moles & Stoichiometry Answers 1. The atomic weight of carbon is 12.0107 u, so a mole of carbon has a mass of 12.0107 g. Why doesn t a mole of
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationARBITRAGEFREE OPTION PRICING MODELS. Denis Bell. University of North Florida
ARBITRAGEFREE OPTION PRICING MODELS Denis Bell University of North Florida Modelling Stock Prices Example American Express In mathematical finance, it is customary to model a stock price by an (Ito) stochatic
More information3 Signals and Systems: Part II
3 Signals and Systems: Part II Recommended Problems P3.1 Sketch each of the following signals. (a) x[n] = b[n] + 3[n  3] (b) x[n] = u[n]  u[n  5] (c) x[n] = 6[n] + 1n + (i)2 [n  2] + (i)ag[n  3] (d)
More informationEE 580 Linear Control Systems VI. State Transition Matrix
EE 580 Linear Control Systems VI. State Transition Matrix Department of Electrical Engineering Pennsylvania State University Fall 2010 6.1 Introduction Typical signal spaces are (infinitedimensional vector
More informationSolutions to old Exam 1 problems
Solutions to old Exam 1 problems Hi students! I am putting this old version of my review for the first midterm review, place and time to be announced. Check for updates on the web site as to which sections
More informationA Second Course in Elementary Differential Equations: Problems and Solutions. Marcel B. Finan Arkansas Tech University c All Rights Reserved
A Second Course in Elementary Differential Equations: Problems and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved Contents 8 Calculus of MatrixValued Functions of a Real Variable
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More information3 Orthogonal Vectors and Matrices
3 Orthogonal Vectors and Matrices The linear algebra portion of this course focuses on three matrix factorizations: QR factorization, singular valued decomposition (SVD), and LU factorization The first
More information7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
More information1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
More informationON THE KWINNERSTAKEALL NETWORK
634 ON THE KWINNERSTAKEALL NETWORK E. Majani Jet Propulsion Laboratory California Institute of Technology R. Erlanson, Y. AbuMostafa Department of Electrical Engineering California Institute of Technology
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More informationThe Matrix Elements of a 3 3 Orthogonal Matrix Revisited
Physics 116A Winter 2011 The Matrix Elements of a 3 3 Orthogonal Matrix Revisited 1. Introduction In a class handout entitled, ThreeDimensional Proper and Improper Rotation Matrices, I provided a derivation
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a nonnegative BMOfunction w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More informationVERTICES OF GIVEN DEGREE IN SERIESPARALLEL GRAPHS
VERTICES OF GIVEN DEGREE IN SERIESPARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of seriesparallel labelled
More informationSection 6.1  Inner Products and Norms
Section 6.1  Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationMAT188H1S Lec0101 Burbulla
Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 34 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 201112 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
More informationDifferential Inequalities with Initial Time Difference and Applications
J. oflnequal. & Appl., 1999, Vol. 3, pp. 233244 Reprints available directly from the publisher Photocopying permitted by license only (C) 1999 OPA (Overseas Publishers Association) N.V. Published by license
More informationCyclotomic Extensions
Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More informationResearch Article Stability Analysis for HigherOrder Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for HigherOrder Adjacent Derivative
More information19 LINEAR QUADRATIC REGULATOR
19 LINEAR QUADRATIC REGULATOR 19.1 Introduction The simple form of loopshaping in scalar systems does not extend directly to multivariable (MIMO) plants, which are characterized by transfer matrices instead
More informationChapter 11 Current Programmed Control
Chapter 11 Current Programmed Control Buck converter v g i s Q 1 D 1 L i L C v R The peak transistor current replaces the duty cycle as the converter control input. Measure switch current R f i s Clock
More informationLecture 5 Rational functions and partial fraction expansion
S. Boyd EE102 Lecture 5 Rational functions and partial fraction expansion (review of) polynomials rational functions polezero plots partial fraction expansion repeated poles nonproper rational functions
More information3.1 State Space Models
31 State Space Models In this section we study state space models of continuoustime linear systems The corresponding results for discretetime systems, obtained via duality with the continuoustime models,
More informationFinite dimensional C algebras
Finite dimensional C algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for selfadjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationThe Relation between Two Present Value Formulae
James Ciecka, Gary Skoog, and Gerald Martin. 009. The Relation between Two Present Value Formulae. Journal of Legal Economics 15(): pp. 6174. The Relation between Two Present Value Formulae James E. Ciecka,
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationLecture 1: Schur s Unitary Triangularization Theorem
Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More information2.1: MATRIX OPERATIONS
.: MATRIX OPERATIONS What are diagonal entries and the main diagonal of a matrix? What is a diagonal matrix? When are matrices equal? Scalar Multiplication 45 Matrix Addition Theorem (pg 0) Let A, B, and
More information