CALIFORNIA INSTITUTE OF TECHNOLOGY. Control and Dynamical Systems CDS 270. Eugene Lavretsky Spring 2007
|
|
- Ilene Boone
- 6 years ago
- Views:
Transcription
1 CALIFORNIA INSTITUTE OF TECHNOLOGY Cotrol ad Dyamical Systems CDS 7 Eugee Lavretsky Sprig 7 Lecture 1 1. Itroductio Readig material: [1]: Chapter 1, Sectios 1.1, 1. [1]: Chapter 3, Sectio 3.1 []: Chapter 1, Sectios 1.1, 1..1 We cosider dyamical systems that are modeled by a fiite umber of coupled 1 st order ordiary differetial equatios (ODE-s): (,, ) = f t x u (1.1) I (1.1), t deotes time ad f is a vector field. We call (1.1) the state equatio, refer to x R as the system state, ad u of the state vector compoets is called the order of the system. Sometimes, aother equatio m R as the cotrol iput, (exteral sigal). The umber (,, ) y = h t x u (1.) p is also give, where y R deotes the system output. Equatios (1.1) ad (1.) together form the system state space model. A solutio x() t of (1.1) (if oe exists) correspods to a curve i state space, as t varies from ad iitial time to ifiity. This curve is ofte referred to as a state trajectory or a system trajectory. A special case of (1.1) (1.) is liear (affie i the cotrol iput) system
2 (, ) (, ) (, ) = f t x + g t x u y = h t x (1.3) Lettig x x1 x x T =, a special class of oliear cotiuous-time dyamics is give by systems i Bruovsky caoical form. 1 3 = x = x = f x + g x u y = h x (1.4) For liear time-variat (LTV) systems the state space model (1.1) (1.) is: () () = At x+ Btu y = C t x+ D t u (1.5) Fially, the class of liear time-ivariat (LTI) systems is writte i the familiar form: = Ax+ Bu y = Cx+ Du (1.6) If (1.1) does ot cotai a iput sigal u (, ) = f t x (1.7) the the resultig dyamics is called uforced. If i additio the fuctio f does ot deped explicitly o t, that is = f x (1.8) the the system dyamics is called autoomous or time-ivariat. Systems that do deped o time (explicitly) are called o-autoomous or time-variat. Defiitio 1.1 A poit x = x i the state space is a equilibrium poit of (1.8) if f ( x ) = (1.9)
3 I other words, wheever the state of the system starts at x, it will remai at x future times. for all The liear system = Ax has a isolated equilibrium poit at x = if det A, that is if A has o zero eigevalues. Otherwise, the system has a cotiuum of equilibrium poits. These are the oly possible equilibrium patters that a liear system may have. O the other had, a oliear system (1.8) ca have multiple isolated equilibrium poits. Lemma 1.1 Trajectories of a 1 st order autoomous ODE (assumig that they exist) are mootoic fuctios of time. Homework: Prove Lemma Existece ad Uiqueess Readig material: [1]: Chapter 1, Sectio 4.1 []: Chapter 3, Sectio 3.1 []: Appedix A []: Appedix C1 For the uforced system (1.7) to be a useful mathematical model of a physical system, it must be able to predict future states of the system give its curret state x at t. I other words, the Iitial Value Problem (IVP) = f ( t, x) = x x t (.1) must have a uique solutio. Homework Example.1 Prove that the IVP = + < x = 1 x, x 1 x, x has o solutios at all o the iterval t 1. Homework Example. Show that the IVP 3
4 3 = x x = has ifiitely may solutios, each of which is defied o R : 1 3 ( t a), t < a 7 x() t =, a t b 1 3 ( t b), t > b 7 where a < ad b > are arbitrary costats. If a = b= the there are solutios: 3 t x() t = ad x() t. 7 The existece ad uiqueess of IVP ca be esured by imposig appropriate costraits f txi, (.1). o the right had side fuctio We start by statig a sufficiet coditio for the IVP problem to admit a solutio which may ot be ecessarily uique. Theorem.1 (Cauchy / Peao Existece Theorem) f tx, is cotiuous i a closed regio If {(, ):, } B tx t t T x x R R R = (.) where T ad R are strictly positive costats, the there exists t < t 1 T such that the IVP has at least oe cotiuous i time solutio x( t ). I other words, cotiuity of f ( tx, ) i its argumets esures that there is at least oe solutio of the IVP i (.1). The above theorem does ot guaratee the uiqueess of the solutio. The key costrait f tx, satisfies the iequality that yields uiqueess is the Lipschitz coditio, whereby (, ) (, ) for all ( tx, ) ad ( t, y ) i some eighborhood of (, ) orm. For a vector x R f tx f ty Lx y (.3) t x. I (.3), i deotes a vector p, we cosider the class of p orms, defied by 4
5 1 p p x = xi, 1 p p < (.4) i= 1 ad x = max x (.5) 1 i i The ext theorem gives sufficiet coditios for the uique existece of a solutio. Theorem. (Local Existece ad Uiqueess) f tx, be piecewise cotiuous i t ad satisfy the Lipschitz coditio (.3) Let { } [ 1] x, y B= x R : x x r, t t, t (.6) The, there exists some δ > such that the state equatio = f ( t, x) with x( t ) has a uique solutio over [ t, t + δ ]. = x The key assumptio i the above theorem is the Lipschitz coditio (.3) which is t, x o the compact domai assumed to be valid locally, that is i a eighborhood of B i (.6). Oe may try to exted the iterval of existece ad uiqueess over a give time iterval [ t, t + δ ] by takig t t + δ as a ew iitial time ad x x( t + δ ) as a ew iitial t + δ, x t + δ the there exist state. If the coditios of the theorem are satisfied at ( ( )) δ > such that the IVP has a uique solutio over [ t δ, t δ δ] through the poit ( t δ, x( t δ )) existece of a uique solutio over the iterval [ t, t δ δ ] that passes + +. We piece together the solutios to establish the + +. This idea ca be repeated to keep extedig the solutio. However, i geeral the solutio caot be exteded idefiitely. I that case, there will be a maximum iterval [ t, T ), where the uique solutio exists. Homework: Read ad study the proof of Theorem 3.1, pp , []. Example.3 The IVP 5
6 = x x = 1 has a solutio () x t 1 = t 1 which is defied oly for t < 1 ad ca ot be exteded to R. Note that the fuctio f ( x) = x is locally Lipschitz for all x R, ad as t 1 the solutio has a fiite escape time, that is it leaves ay compact set withi a fiite time. The phrase fiite escape time is used to describe the pheomeo that a trajectory escapes to ifiity at a fiite time. Assumig that f ( x ) is globally Lipschitz, the ext theorem establishes the existece of a uique solutio over ay arbitrarily large iterval. Theorem.3 (Global existece ad Uiqueess) Suppose that f is piecewise cotiuous i t ad globally Lipschitz i x, that is the fuctio satisfies Lipschitz coditio (.3) [ ] x, y R, t t, t (.7) 1 The the IVP (.1) has a uique solutio over [, ] arbitrarily large. Homework: Read ad study the proof of Theorem 3., p. 93, []. t t 1, where the fial time 1 Sufficiet coditios i the above theorem are overly coservative. t may be Example.4 The IVP = x x 3 = x has a uique solutio x x t + 1 () = xt for ay iitial coditio x ad for all t. 6
7 Basically, if it is kow that IVP has a solutio that evolves o a compact domai the the solutio ca be exteded idefiitely. Theorem.4 (Global existece ad Uiqueess o a compact domai) Let f ( tx, ) be piecewise cotiuous i t, locally Lipschitz i x for all t ad all x i a domai D R. Let W D be a compact subset of D, x W, ad suppose it is kow that every solutio of the correspodig IVP lies etirely i W. The there is a uique solutio that is defied for all t. Homework: Read ad study the proof of Theorem 3.3, pp , []. Remark: There are extesios that deal with existece ad uiqueess of IVP-s whose system dyamics is discotiuous i x, (i.e., ot Lipschitz). Homework Example.5 The IVP 1 = x = x sg x + x x 1 = x does ot satisfy the sufficiet coditios for existece ad uiqueess of its solutio. Nevertheless, the IVP solutio does exist. Simulate the system startig from differet iitial coditios. Costruct phase portrait of the system ad argue that a) the maifold c( x) = x1+ x = is the system global attractor, b) all system trajectories reach maifold i fiite time, ad c) the solutio slides dow the maifold towards the origi. 3. Lyapuov Stability Readig material: [1]: Chapter 3, Sectios [1]: Chapter 3, Sectio 4.5 []: Chapter 4 Stability of equilibrium poits is usually characterized i the sese of Lyapuov. Alexader Michailovich Lyapuov, Russia mathematicia ad egieer who laid out the foudatio of the Stability Theory Results published i 189, Russia Traslated ito Frech, 197 Reprited by Priceto Uiversity, 1947 America Cotrol Egieerig Commuity Iterest, 196 s 7
8 Lyapuov stability theorems give sufficiet coditios for stability, asymptotic stability, ad so o. Statemets that establish ecessity of these coditios are called the coverse theorems. For example, it is kow that a equilibrium poit of a oliear system is expoetially stable if ad oly if the liearizatio of the system about that poit has a expoetially stable equilibrium at the origi. We will be mostly cocer with the d theorem of Lyapuov. We will use it to: a) derive stable adaptive laws for ucertai system, ad b) show boudedess of the system closedloop solutios eve whe the system has o equilibrium poits. Without a loss of geerality, we ll study stability of the origi for the autoomous system: where f ( x ) is locally Lipschitz i x ad = f x (3.1) f =. Defiitio 3.1 (local stability for autoomous systems) The equilibrium poit x = of (3.1) is stable if R >, r R >, x < r t, x t < R (3.) { } { () } ustable if it is ot stable (write formal defiitio similar to (3.)) r = r R ca be chose such that asymptotically stable if it is stable ad x r x( t) < lim = (3.3) t margially stable if it is stable but ot asymptotically stable, (write formal defiitio) expoetially stable if it is stable ad r, αλ, >, x < r t > : x t α x e λ t, (3.4) { } () 8
9 Figure 3.1: Stable System Figure 3.: Ustable System Basically, a equilibrium poit is stable if all solutios startig at earby poits stay earby; otherwise it is ustable. It is asymptotically stable if all solutios startig at earby poits ot oly stay earby, but also ted to the equilibrium poit as time approaches ifiity. Remark: Stabilizable systems are ot ecessarily stable. Note that by defiitio, expoetial stability implies asymptotic stability, which i tur implies stability. By defiitio, stability i the sese of Lyapuov defies local behavior of the system trajectories ear the equilibrium. I order to aalyze how the system behaves some distace away from the equilibrium, global cocepts of stability are required. Homework: Read Sectio 4.5 from []. Study Lyapuov stability for oautoomous systems. Defiitio 3. (global stability) If asymptotic (expoetial) stability holds for ay iitial states, the equilibrium poit is said to be globally asymptotically (expoetially) stable. Next, two mai theorems of Lyapuov are preseted. Theorem 3.1 (Lyapuov idirect method) Let x = be a equilibrium poit for the oliear system (3.1), where f : D R is cotiuously differetiable ad D is a eighborhood of the origi. Let The: f A= (3.5) ( x) x x = 9
10 the origi is asymptotically stable if Reλ i < for all eigevalues of A the origi is ustable if Reλ i > for at least oe of the eigevalues of A if at least oe of the eigevalues is o the jω axis, (i.e., the liearized system is margially stable), the othig ca be said about the origial oliear system behavior Before statig the d theorem of Lyapuov we eed to itroduce the cocept of positive defiite fuctios. Defiitio 3.3 Let D R be a eighborhood of the origi. A fuctio V ( x): D R is said to be (positive semidefiite) if locally positive defiite, if: V = ad V ( x) >, x D { } locally positive semidefiite, if: V = ad V ( x), x D { } locally egative defiite (semidefiite), if it is ot locally positive defiite (semidefiite) If i the above defiitio (semidefiite). D = R the the fuctio is globally positive (egative) defiite Theorem 3. (Lyapuov direct method) Let x = be a equilibrium poit for (3.1) ad let D R be a domai cotaiig the origi. If there is a cotiuously differetiable positive defiite fuctio V ( x): D R, whose time derivative alog the system trajectories is egative semidefiite i D V V V V ( x) = x = fi( x) = f ( x) x x x (3.6) i i= 1 i i= 1 the the equilibrium is stable. Moreover, if V ( x ) < i D { } asymptotically stable. i, the the equilibrium is Homework: Read ad study the proof of Lyapuov s Theorem, [, Theorem 4.1, pp ]. Defiitio 3.4 A cotiuously differetiable positive defiite fuctio V ( x ) satisfyig (3.6) is called a Lyapuov fuctio. Homework Example 3.1 Cosider the 1 st order ODE = c x 1
11 where c( x ) is locally Lipschitz o ( a, a) ad satisfies { c = } { c( x) x>, x : x ( a a) } Show that both V ( x) = c( y) dy ad V ( x) x x = are the Lyapuov fuctios ad cosequetly the origi is a asymptotically stable equilibrium (locally) of the system. Whe the origi x = is a asymptotically stable equilibrium of the system, we are ofte iterested i determiig its regio of attractio, (also called regio of asymptotic stability, domai of attractio, or basi). We wat to be able to aswer the questio: Uder what coditio will the regio of attractio be the whole space R? Defiitio 3.5 If the regio of attractio of a asymptotically stable equilibrium poit at the origi is the whole space R, the equilibrium is said to be globally asymptotically stable. Defiitio 3.6 A fuctio V : R R such that lim V ( x) = is called radially ubouded. x Theorem 3.3 (Barbashi-Krasovskii theorem) Let x = be a equilibrium poit for (3.1). Let V : R R be a radially ubouded Lyapuov fuctio of the system. The the equilibrium is globally asymptotically stable. Lecture 4. LaSalle s Ivariace Priciple Readig material: [1]: Chapter 3, Sectios []: Chapter 4, Sectio 4. We begi with a motivatig example. Example 4.1 (oliear pedulum dyamics with frictio) 11
12 Figure 4.1: Pedulum Dyamics of a pedulum with frictio ca be writte as: or, equivaletly i state space form: (4.1) MR θ + kθ + MgRsi θ = = x 1 = asi x bx 1 (4.) where x1 = θ, x = g k θ, a =, ad b =. We study stability of the origi x e =. R M R Note that the latter is equivalet to studyig stability of all the equilibrium poits i the T form: xe = ( π l ), l =, ± 1, ±, Cosider the total eergy of the pedulum as a Lyapuov fuctio cadidate. x1 x x V x = asi ydy+ = a 1 cos x + Potetial 1 Kietic (4.3) It is clear that V ( x ) is a positive defiite fuctio, (locally, aroud the origi). Its time derivative alog the system trajectories is: V x = asi x + x = bx (4.4) 1 1 The time derivative is egative semidefiite. It is ot egative defiite because V ( x ) = for x = irrespective of the value of 1 x. Therefore, we ca coclude that the origi is a stable equilibrium. 1
13 However, usig the phase portrait of the pedulum equatio (or just commo sese), we expect the origi to be a asymptotically stable equilibrium. Cosequetly, the Lyapuov eergy fuctio argumet fails to show this fact. O the other had, we otice that for the system to maitai V ( x ) = coditio, the trajectory must be cofied to the lie x =. Usig the system dyamics (4.) yields: x six x 1 1 Hece o the segmet π < x1 < π of the lie x = the system ca maitai the coditio oly at the origi V x t must decrease to V ( x ) = x =. Therefore, ( ) toward ad, cosequetly, x() t as t, which is cosistet with the fact that, due to frictio, eergy caot remai costat while the system is i motio. The forgoig argumet shows that if i a domai about the origi we ca fid a Lyapuov fuctio whose derivative alog the system trajectories is egative semidefiite, ad we ca establish that o trajectory ca stay idetically at poits where V ( x ) =, except at the origi, the the origi is asymptotically stable. This argumet follows from the LaSalle s Ivariace Priciple. Defiitio 4.1 A set M R is said to be a ivariat set with respect to (3.1) if: a positively ivariat set with respect to if: x M x t M, t R x M x t M, t Theorem 4.1 (LaSalle s theorem) Let Ω D R be a compact positively ivariat set with respect to the system dyamics (3.1). Let V : D R be a cotiuously differetiable fuctio such that V ( x() t ) i Ω. Let E Ω be the set of all poits i Ω where V ( x ) =. Let M E be the largest ivariat set i E. The every solutio startig i Ω approaches M as t, that is lim if x() t z = t z M dist ( xt (), M) Notice that the iclusio of the sets i the LaSalle s theorem is: M E Ω D R 13
14 I fact, the formal proof of the theorem (see [], Theorem 4.4, p. 18) reveals that all trajectories x() t are bouded ad approach a positive limit set L + M as t. The latter may cotai asymptotically stable equilibriums ad stable limit cycles. Remark 4.1 Ulike Lyapuov theorems, LaSalle s theorem does ot require the fuctio V ( x ) to be positive defiite. Most ofte, our iterest will be to show that x( t) as t. For that we will eed to establish that the largest ivariat set i E is the origi, that is: M = { }. This is doe by showig that o solutio ca stay idetically i E other tha the trivial solutio x() t. Theorem 4.1 (Barbashi-Krasovskii theorem) Let x = be a equilibrium poit for (3.1). Let V : D R be a cotiuously differetiable positive defiite fuctio o a domai D R cotaiig the origi, such that V x() t S = x D: V x = ad suppose that o other solutio i D. Let { } ca stay i S, other tha the trivial solutio x( t). The the origi is locally asymptotically stable. If, i additio, V ( x ) is radially ubouded the the origi is globally asymptotically stable. Note that if V ( x) is egative defiite the { } S = ad the above theorem coicides with the Lyapuov d theorem. Also ote that the LaSalle s ivariat set theorems are applicable to autoomous system oly. Example 4. Cosider the 1 st order system together with its adaptive cotrol law The dyamics of the adaptive gai ˆk ( t ) is = ax+ u ˆ u = k t x ˆk = γ x where γ > is called the adaptatio rate. The the closed-loop system becomes: 14
15 ( ˆ() ) = k t a x ˆ k = γ x The lie x = represets the system equilibrium set. We wat to show that the trajectories approach this equilibrium set, as t, which meas that the adaptive cotroller regulates x() t to zero i the presece of costat ucertaity i a. Cosider the Lyapuov fuctio cadidate where b (, ˆ) = ( ˆ ) V x k x k b γ > a. The time derivative of V alog the trajectories of the system is give by ( ˆ 1 ) ( ˆ ) ˆ ˆ ˆ V x, k = x + k b k = x k a + k b x = x b a γ Sice (, ˆ) V (, ˆ x k) is semi-egative, the set (, ˆ) : (, ˆ) V x k is positive defiite ad radially ubouded fuctio, whose derivative { } Ω c = x k R V x k c is compact, positively ivariat set. Thus takig Ω =Ω, all the coditios of LaSalle s Theorem are satisfied. The set E is give by ( ˆ) c {, : c } E = x k Ω x=. Because ay poit o the lie x = is a equilibrium poit, E is a ivariat set. Therefore, i this example M = E. From LaSalle s Theorem we coclude that every trajectory startig i Ω approaches E, as t, that is () xt as t. Moreover, sice (, ˆ) (, ˆ ) Ω c ca be chose large eough that ( ˆ) c V x k is radially ubouded, the coclusio is global, that is it holds for all iitial coditios costat c i the defiitio of Homework: simulate the closed-loop system from Example 4.. x, k ˆ test differet iitial coditios x k because the x, k Ω c. ru simulatios of the system while icreasig the rate of adaptatio γ > util high frequecy oscillatios ad / or system departure occurs. Try to quatify maximum allowable γ max as a fuctio of the iitial coditios. ru simulatios of the system while icreasig the cotrol time delay τ, that is usig cotrol i the form u( t) = kˆ ( t τ ) x( t τ ). Try to quatify maximum allowable time delay τ max, (as a fuctio of the iitial coditios ad rate of adaptatio), before the system starts to oscillate or departs. 15
16 5. Boudedess ad Ultimate Boudedess Readig material: []: Sectio 4.8 Cosider the oautoomous system where :, [ ) [, ) D, ad f D R (, ) = f t x (5.1) is piecewise cotiuous i t, locally Lipschitz i x o D R is a domai that cotais the origi x =. Note that if the origi is a equilibrium poit for (5.1) the by defiitio: f ( t,) =, t. O the other had, eve if there is o equilibrium at the origi, Lyapuov aalysis ca still be used to show boudedess of the system trajectories. We begi with a motivatig example. Example 5.1 Cosider the IVP with oautoomous scalar dyamics = x+ δ si t x t = a> δ > (5.) The system has o equilibrium poits. The IVP explicit solutio ca be easily foud ad show to be bouded for all t t, uiformly i t, that is with a boud b idepedet of t. I this case, the solutio is said to be uiformly ultimately bouded (UUB), ad b is called the ultimate boud, (prove it). Turs out, the UUB property of (5.) ca be established via Lyapuov aalysis ad x without usig the explicit solutio of the state equatio. I fact, startig with V ( x ) =, we calculate the time derivative of V alog the system trajectories. = = ( + δ si ) = + δ si + δ = ( δ) V x x x x t x x t x x x x It immediately follows that, V x < x > δ 16
17 =, or I other words, the time derivative of V is egative outside the set Bδ { x δ} equivaletly, all solutios that start outside of B δ will eter the iterval withi a fiite time, ad will remai withi the iterval bouds afterward. Formally, it ca be stated as follows. Choose δ c >. The all solutios startig i the set { } = Bc V x c B δ x c will remai therei for all future time sice V is egative o the boudary. Hece the solutios are uiformly bouded. Moreover, a ultimate boud of the solutios ca also be foud. Choose ε such that δ < ε < The V is egative i the aulus set { V ( x) c} V ( x() t ) will decrease mootoically i time util the solutio eters the set { V( x) ε} c ε, which implies that i this set. From that time o, caot leave the set because agai V is egative o its boudary x V ( x) = ε. Sice V ( x ) =, we ca coclude that the solutio is UUB with the ultimate boud x ε. Defiitio 5.1 The solutios of (5.1) are uiformly bouded if there exists a positive costat c, idepedet of t, ad for every a (, c), there is β = β( a) >, idepedet of t, such that x t a x t β, t t (5.3) globally uiformly bouded if (5.3) holds for arbitrarily large a uiformly ultimately bouded with ultimate boud b if there exist positive costats b ad c, idepedet of a, c, there is (, ) T = T a b, idepedet of t, such that t, ad for every x t a x t b, t t + T (5.4) 17
18 globally uiformly ultimately bouded if (5.4) holds for arbitrarily large a. Figure 5.1: UUB Cocept I the defiitio above, the term uiform idicates that the boud b does ot deped o t. The term ultimate idicates that boudedess holds after the lapse of a certai time T. The costat c defies a eighborhood of the origi, idepedet of t, such that all trajectories startig i the eighborhood will remai bouded i time. If c ca be chose arbitrarily large the the UUB otio becomes global. Basically, UUB ca be cosidered as a milder form of stability i the sese of Lyapuov (SISL). A compariso betwee SISL ad UUB cocepts is give below. SISL is defied with respect to a equilibrium, while UUB is ot. Asymptotic SISL is a strog property that is very difficult to achieve i practical dyamical systems. SISL requires the ability to keep the state arbitrarily close to the system equilibrium by startig sufficietly close to it. This is still too strog a requiremet for practical systems operatig i the presece of ukow disturbaces. The mai differece betwee UUB ad SISL is that the UUB boud b caot be made arbitrarily small by startig closer to the equilibrium or the origi. I practical systems, the boud b depeds o disturbaces ad system ucertaities. To demostrate how Lyapuov aalysis ca be used to study UUB, cosider a cotiuously differetiable positive defiite fuctio V ( x ). Choose < ε < c. Suppose that the sets Ω ε = V ( x) ε ad Ω c = V ( x) c are compact. Let { } { } { ε } c Λ= V x c =Ω Ω ε 18
19 ad suppose that it is kow that the time derivative of ( ) V x t alog the trajectories of the oautoomous dyamical system (5.1) is egative defiite iside Λ, that is ( ()) ( ) <, Λ, V x t W x t x t t where W x() t is a cotiuous positive defiite fuctio. Sice V is egative i Λ, a trajectory startig i Λ must move i the directio of decreasig V ( x() t ). I fact, it ca be show that i the set Λ the trajectory behaves as if the origi was uiformly asymptotically stable, (which it does ot have to be i this case). Cosequetly, the fuctio V ( x() t ) will cotiue decreasig util the trajectory eters the set Ω ε i fiite time ad stays there for all future time. Hece, the solutios of (5.1) are UUB with the ultimate boud b= max x. A sketch of the sets Λ, Ω c, Ω ε is show i Figure 5.. x Ω ε Figure 5.: UUB by Lyapuov Aalysis is derived ad show to be valid o a domai, which is specified i terms of x. I such cases, UUB aalysis ivolves fidig I may problems, the relatio V ( t, x) W( x) the correspodig domais of attractio ad a ultimate boud. This aalysis will be performed ext. Refereces 1. J.J. Slotie, W. Li, Applied Noliear Cotrol, Pretice Hall, H.K. Khalil, Noliear Systems, 3 rd Editio, Pretice Hall, New Jersey,. 19
Adaptive Control: CDS 270 I
Lecture Adative Cotrol: CDS 7 I CALIFORNIA INSTITUTE OF TECHNOLOGY Eugee Lavretsky Srig Robust ad Adative Cotrol Worksho Adative Cotrol: Itroductio, Overview, ad Alicatios E. Lavretsky Motivatig Eamle:
More informationΩ ). Then the following inequality takes place:
Lecture 8 Lemma 5. Let f : R R be a cotiuously differetiable covex fuctio. Choose a costat δ > ad cosider the subset Ωδ = { R f δ } R. Let Ωδ ad assume that f < δ, i.e., is ot o the boudary of f = δ, i.e.,
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More information( ) 1 Comparison Functions. α is strictly increasing since ( r) ( r ) α = for any positive real number c. = 0. It is said to belong to
Compaiso Fuctios I this lesso, we study stability popeties of the oautoomous system = f t, x The difficulty is that ay solutio of this system statig at x( t ) depeds o both t ad t = x Thee ae thee special
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationLyapunov Stability Analysis for Feedback Control Design
Copyright F.L. Lewis 008 All rights reserved Updated: uesday, November, 008 Lyapuov Stability Aalysis for Feedbac Cotrol Desig Lyapuov heorems Lyapuov Aalysis allows oe to aalyze the stability of cotiuous-time
More informationb i u x i U a i j u x i u x j
M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here
More informationIntroduction to Signals and Systems, Part V: Lecture Summary
EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics ad Egieerig Lecture otes Sergei V. Shabaov Departmet of Mathematics, Uiversity of Florida, Gaiesville, FL 326 USA CHAPTER The theory of covergece. Numerical sequeces..
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationMA131 - Analysis 1. Workbook 2 Sequences I
MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................
More informationAnalytic Continuation
Aalytic Cotiuatio The stadard example of this is give by Example Let h (z) = 1 + z + z 2 + z 3 +... kow to coverge oly for z < 1. I fact h (z) = 1/ (1 z) for such z. Yet H (z) = 1/ (1 z) is defied for
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More informationMath Solutions to homework 6
Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there
More informationlim za n n = z lim a n n.
Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget
More informationENGI Series Page 6-01
ENGI 3425 6 Series Page 6-01 6. Series Cotets: 6.01 Sequeces; geeral term, limits, covergece 6.02 Series; summatio otatio, covergece, divergece test 6.03 Stadard Series; telescopig series, geometric series,
More informationPRELIM PROBLEM SOLUTIONS
PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems
More information( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.
Joh Riley 8 Jue 03 ANSWERS TO EXERCISES IN APPENDIX B Sectio B VECTORS AND SETS Exercise B-: Covex sets (a) Let 0 x, x X, X, hece 0 x, x X ad 0 x, x X Sice X ad X are covex, x X ad x X The x X X, which
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationAdvanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology
Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More information6a Time change b Quadratic variation c Planar Brownian motion d Conformal local martingales e Hints to exercises...
Tel Aviv Uiversity, 28 Browia motio 59 6 Time chage 6a Time chage..................... 59 6b Quadratic variatio................. 61 6c Plaar Browia motio.............. 64 6d Coformal local martigales............
More information1. Linearization of a nonlinear system given in the form of a system of ordinary differential equations
. Liearizatio of a oliear system give i the form of a system of ordiary differetial equatios We ow show how to determie a liear model which approximates the behavior of a time-ivariat oliear system i a
More informationProperties of Fuzzy Length on Fuzzy Set
Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,
More informationMath 312 Lecture Notes One Dimensional Maps
Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,
More informationPRACTICE FINAL/STUDY GUIDE SOLUTIONS
Last edited December 9, 03 at 4:33pm) Feel free to sed me ay feedback, icludig commets, typos, ad mathematical errors Problem Give the precise meaig of the followig statemets i) a f) L ii) a + f) L iii)
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationSingular Continuous Measures by Michael Pejic 5/14/10
Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable
More informationA NOTE ON BOUNDARY BLOW-UP PROBLEM OF u = u p
A NOTE ON BOUNDARY BLOW-UP PROBLEM OF u = u p SEICK KIM Abstract. Assume that Ω is a bouded domai i R with 2. We study positive solutios to the problem, u = u p i Ω, u(x) as x Ω, where p > 1. Such solutios
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More information1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.
.3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(
More informationMcGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected problems
McGill Uiversity Math 354: Hoors Aalysis 3 Fall 212 Assigmet 3 Solutios to selected problems Problem 1. Lipschitz fuctios. Let Lip K be the set of all fuctios cotiuous fuctios o [, 1] satisfyig a Lipschitz
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationMath 113, Calculus II Winter 2007 Final Exam Solutions
Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this
More informationMetric Space Properties
Metric Space Properties Math 40 Fial Project Preseted by: Michael Brow, Alex Cordova, ad Alyssa Sachez We have already poited out ad will recogize throughout this book the importace of compact sets. All
More informationENGI Series Page 5-01
ENGI 344 5 Series Page 5-01 5. Series Cotets: 5.01 Sequeces; geeral term, limits, covergece 5.0 Series; summatio otatio, covergece, divergece test 5.03 Series; telescopig series, geometric series, p-series
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationMAS111 Convergence and Continuity
MAS Covergece ad Cotiuity Key Objectives At the ed of the course, studets should kow the followig topics ad be able to apply the basic priciples ad theorems therei to solvig various problems cocerig covergece
More informationMath 508 Exam 2 Jerry L. Kazdan December 9, :00 10:20
Math 58 Eam 2 Jerry L. Kazda December 9, 24 9: :2 Directios This eam has three parts. Part A has 8 True/False questio (2 poits each so total 6 poits), Part B has 5 shorter problems (6 poits each, so 3
More informationAn Analysis of a Certain Linear First Order. Partial Differential Equation + f ( x, by Means of Topology
Iteratioal Mathematical Forum 2 2007 o. 66 3241-3267 A Aalysis of a Certai Liear First Order Partial Differetial Equatio + f ( x y) = 0 z x by Meas of Topology z y T. Oepomo Sciece Egieerig ad Mathematics
More informationA PROOF OF THE TWIN PRIME CONJECTURE AND OTHER POSSIBLE APPLICATIONS
A PROOF OF THE TWI PRIME COJECTURE AD OTHER POSSIBLE APPLICATIOS by PAUL S. BRUCKMA 38 Frot Street, #3 aaimo, BC V9R B8 (Caada) e-mail : pbruckma@hotmail.com ABSTRACT : A elemetary proof of the Twi Prime
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 12
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig
More informationTHE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.
THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationAN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS
http://www.paper.edu.c Iteratioal Joural of Bifurcatio ad Chaos, Vol. 1, No. 5 () 119 15 c World Scietific Publishig Compay AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC
More informationDifferentiable Convex Functions
Differetiable Covex Fuctios The followig picture motivates Theorem 11. f ( x) f ( x) f '( x)( x x) ˆx x 1 Theorem 11 : Let f : R R be differetiable. The, f is covex o the covex set C R if, ad oly if for
More informationVector Quantization: a Limiting Case of EM
. Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z
More informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More information1 Introduction. 1.1 Notation and Terminology
1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationREAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS
REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai
More informationTrue Nature of Potential Energy of a Hydrogen Atom
True Nature of Potetial Eergy of a Hydroge Atom Koshu Suto Key words: Bohr Radius, Potetial Eergy, Rest Mass Eergy, Classical Electro Radius PACS codes: 365Sq, 365-w, 33+p Abstract I cosiderig the potetial
More informationEmpirical Processes: Glivenko Cantelli Theorems
Empirical Processes: Gliveko Catelli Theorems Mouliath Baerjee Jue 6, 200 Gliveko Catelli classes of fuctios The reader is referred to Chapter.6 of Weller s Torgo otes, Chapter??? of VDVW ad Chapter 8.3
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationSTAT Homework 1 - Solutions
STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better
More informationNotes 27 : Brownian motion: path properties
Notes 27 : Browia motio: path properties Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces:[Dur10, Sectio 8.1], [MP10, Sectio 1.1, 1.2, 1.3]. Recall: DEF 27.1 (Covariace) Let X = (X
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationIntroduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT
Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory
More informationMost text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t
Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationMath 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions
Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationSolutions to home assignments (sketches)
Matematiska Istitutioe Peter Kumli 26th May 2004 TMA401 Fuctioal Aalysis MAN670 Applied Fuctioal Aalysis 4th quarter 2003/2004 All documet cocerig the course ca be foud o the course home page: http://www.math.chalmers.se/math/grudutb/cth/tma401/
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More informationBrief Review of Functions of Several Variables
Brief Review of Fuctios of Several Variables Differetiatio Differetiatio Recall, a fuctio f : R R is differetiable at x R if ( ) ( ) lim f x f x 0 exists df ( x) Whe this limit exists we call it or f(
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationChapter 8. Uniform Convergence and Differentiation.
Chapter 8 Uiform Covergece ad Differetiatio This chapter cotiues the study of the cosequece of uiform covergece of a series of fuctio I Chapter 7 we have observed that the uiform limit of a sequece of
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationSolution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1
Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity
More informationChapter 7 Isoperimetric problem
Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated
More informationNotes 19 : Martingale CLT
Notes 9 : Martigale CLT Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: [Bil95, Chapter 35], [Roc, Chapter 3]. Sice we have ot ecoutered weak covergece i some time, we first recall
More informationMA131 - Analysis 1. Workbook 10 Series IV
MA131 - Aalysis 1 Workbook 10 Series IV Autum 2004 Cotets 4.19 Rearragemets of Series...................... 1 4.19 Rearragemets of Series If you take ay fiite set of umbers ad rearrage their order, their
More informationRecitation 4: Lagrange Multipliers and Integration
Math 1c TA: Padraic Bartlett Recitatio 4: Lagrage Multipliers ad Itegratio Week 4 Caltech 211 1 Radom Questio Hey! So, this radom questio is pretty tightly tied to today s lecture ad the cocept of cotet
More information