当前位置:高等教育资讯网  >  中国高校课件下载中心  >  大学文库  >  浏览文档

《非线性动力学》(英文版) Lecture 4 Analysis Based On Continuity

资源类别:文库,文档格式:PDF,文档页数:5,文件大小:103.71KB,团购合买
with x(0)=I exist and are unique on the time interval t E [ 0, 1] for allTER".Then discrete time system(4. 1)with f(5)=r(, i)describes the evolution of continuous time system(4.)at discrete time samples. In particular, if a is continuous then so is f Let us call a point in the closure of X locally attractive for system(4. 1)if there exists
点击下载完整版文档(PDF)

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j(Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 4: Analysis Based On Continuity I This lecture presents several techniques of qualitative systems analysis based on what is frequently called topological arguments, i.e. on the arguments relying on continuity of functions involved 4.1 Analysis using general topology arguments This section covers results which do not rely specifically on the shape of the state space and thus remain valid for very general classes of systems. We will start by proving gener alizations of theorems from the previous lecture to the case of discrete-time autonomous 4.1.1 Attractor of an asymptotically stable equilibrium Consider an autonomous time invariant discrete time system governed by equation r(t+1)=f(x(t),r(t)∈X,t=0.,1,2, (4.1) where X is a given subset of R",f: X H X is a given function. Remember that f is called continuous if f(xk)→f(x)ask→ o whenever k,x∈ X are such that k-Doo as k-oo). In particular, this means that every function defined on a finite set X is continuous One important source of discrete time models is discretization of differential equations Assume that function a: RhR is such that solutions of the ODe I Version of September 17, 2003

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 4: Analysis Based On Continuity 1 This lecture presents several techniques of qualitative systems analysis based on what is frequently called topological arguments, i.e. on the arguments relying on continuity of functions involved. 4.1 Analysis using general topology arguments This section covers results which do not rely specifically on the shape of the state space, and thus remain valid for very general classes of systems. We will start by proving gener￾alizations of theorems from the previous lecture to the case of discrete-time autonomous systems. 4.1.1 Attractor of an asymptotically stable equilibrium Consider an autonomous time invariant discrete time system governed by equation x(t + 1) = f(x(t)), x(t) ⊂ X, t = 0, 1, 2, . . . , (4.1) where X is a given subset of Rn, f : X ∞� X is a given function. Remember that f is called continuous if f(xk) � f(x�) as k � → whenever xk, x� ⊂ X are such that xk � x� as k � →). In particular, this means that every function defined on a finite set X is continuous. One important source of discrete time models is discretization of differential equations. Rn Assume that function a : ∞� Rn is such that solutions of the ODE x˙ (t) = a(x(t)), (4.2) 1Version of September 17, 2003

with x(0)=I exist and are unique on the time interval t E [ 0, 1] for allTER".Then discrete time system(4. 1)with f(5)=r(, i)describes the evolution of continuous time system(4.)at discrete time samples. In particular, if a is continuous then so is f Let us call a point in the closure of X locally attractive for system(4. 1)if there exists d>0 such that r(t)-io as t-o for every a= a(t) satisfying(4.1) with z(0)-iol 0 such that all E X satisfying lar-yl 0 there exist yEY and zE X/Y such that ly-a 100 converge to infinity as t-o0. Then, according to Theorem 4.1, the boundary of the attractor A= A(0) is a non-empty f-invariant set. By assumptions, 1 0 such that c(t)To as t=o0 for every a a (t) satisfying(4.)with z(0)-iol0 suck that x(t1)-T1(ti)l< d/2 whenever la(0)-i1l <8. Since this implies a(t1)-iol d

2 with x(0) = x¯ exist and are unique on the time interval t ⊂ [0, 1] for all x¯ ⊂ Rn. Then discrete time system (4.1) with f(¯) x x = x(1, ¯) describes the evolution of continuous time system (4.2) at discrete time samples. In particular, if a is continuous then so is f. Let us call a point in the closure of X locally attractive for system (4.1) if there exists d > 0 such that x(t) � x¯0 as t � → for every x = x(t) satisfying (4.1) with |x(0)−x¯0| 0 such that all x ⊂ X satisfying |x − y| 0 there exist y ⊂ Y and z ⊂ X/Y such that |y − x| 100 converge to infinity as t � →. Then, according to Theorem 4.1, the boundary of the attractor A = A(0) is a non-empty f-invariant set. By assumptions, 1 ∀ |x¯| ∀ 100 for all x¯ ⊂ A(0). Hence we can conclude that there exist solutions of (4.1) which satisfy the constraints 1 ∀ |x(t)| ∀ 100 for all t. Example 4.2 For system (4.1), defined on X = Rn by a continuous function f : Rn ∞� Rn, it is possible to have every trajectory to converge to one of two equilibria. However, it is not possible for both equilibria to be locally attractive. Otherwise, according to The￾orem 4.1, Rn would be represented as a union of two disjoint open sets, which contradicts the notion of connectedness of Rn. 4.1.2 Proof of Theorem 4.1 According to the definition of local attractiveness, there exists d > 0 such that x(t) � x¯0 as t � → for every x = x(t) satisfying (4.1) with |x(0) − x¯0| 0 such that |x(t1) − x1(t1)| < d/2 whenever |x(0) − x¯1| < �. Since this implies |x(t1) − x¯0| < d

we have i E A(o) for every T E X such that Ii-i1l 0 such that z E A for every z E X such that z-f(iI0 such that f(y)-∫()0 and a non- constant solution x:(-∞,+∞)→R2 such that p(t+r)=lp(t)for all t, and the set of limit points of a is the trajectory(the age)of

3 we have x¯ ⊂ A(¯x0) for every x¯ ⊂ X such that |x¯ − x¯1| 0 such that z ⊂ A for every z ⊂ X such that |z − f(¯) x | 0 such that |f(y) − f(¯x)| 0 and a non-constant solution xp : (−→, +→) ∞� R2 such that xp(t + T) = xp(t) for all t, and the set of limit points of x is the trajectory (the range) of xp;

(c) the limit set is a union of trajectories of maximal solutions a :(t1, t2)HR of (4.2), each of which has a limit(possibly in finite) as t-ti ort-t The proof of Theorem 4.3 is based on the more specific topological arguments, to be discussed in the next section 4.2 Map index in system analysis The notion of index of a continuous function is a remarkably powerful tool for proving existence of mathematical objects with certain properties, and, as such, is very useful in qualitative system analysis 4.2.1 Definition and fundamental properties of index 1.2...le ∈R+:|z|=1} denote the unit sphere in R"+. Note the use of n, not n 1, in the S-notation: it ndicates that locally the sphere in R"f looks like R". There exists a way to define the inder ind (F) of every continuous map F Sn in such a way that the following conditions will be satisfied (a)ifH:S"×0,1→ Sn is continuous then ind(H( O))=ind(H(, 1)) (such maps H is called a homotopy between H(, 0)and H(, 1)) (b)if the map F: R n+I defined by (2)=||F(2/12) is continuously differentiable in a neigborhood of sm then d(F) det(J(F))dm(a) where J_(F)is the Jacobian of F at r, and m(a) is the normalized Lebesque measure on Sn (i.e. m is invariant with respect to unitary coordinate transformations, and the total measure of Sm equals 1) Once it is proven that the integral in(b) is always an integer(uses standard vol ume/surface integration relations), it is easy to see that conditions(a), (b)define ind(F) correctly and uniquely. For n= 1, the index of a continuous map F: SHSturns out to be simply the winding number of F, i.e. the number of rotations around zero the trajectory of F makes 6. It is also easy to see that ind(F1)=1 for the identity map Fr(c)=a, and ind(Fc)=0 every constant map Fc(a)=ro=const

� 4 (c) the limit set is a union of trajectories of maximal solutions x : (t1, t2) ∞� R2 of (4.2), each of which has a limit (possibly infinite) as t � t1 or t � t2. The proof of Theorem 4.3 is based on the more specific topological arguments, to be discussed in the next section. 4.2 Map index in system analysis The notion of index of a continuous function is a remarkably powerful tool for proving existence of mathematical objects with certain properties, and, as such, is very useful in qualitative system analysis. 4.2.1 Definition and fundamental properties of index For n = 1, 2, . . . let Sn = {x ⊂ Rn+1 : |x| = 1} denote the unit sphere in Rn+1. Note the use of n, not n + 1, in the S-notation: it indicates that locally the sphere in Rn+1 looks like Rn. There exists a way to define the index ind(F) of every continuous map F : Sn ∞� Sn in such a way that the following conditions will be satisfied: (a) if H : Sn × [0, 1] ∞� Sn is continuous then ind(H(·, 0)) = ind(H(·, 1)) (such maps H is called a homotopy between H(·, 0) and H(·, 1)); (b) if the map Fˆ : Rn+1 ∞� Rn+1 defined by Fˆ(z) = |z|F(z/|z|) is continuously differentiable in a neigborhood of Sn then ind(F) = det(Jx(Fˆ))dm(x), x�Sn where Jx(Fˆ) is the Jacobian of Fˆ at x, and m(x) is the normalized Lebesque measure on Sn (i.e. m is invariant with respect to unitary coordinate transformations, and the total measure of Sn equals 1). Once it is proven that the integral in (b) is always an integer (uses standard vol￾ume/surface integration relations), it is easy to see that conditions (a),(b) define ind(F) correctly and uniquelly. For n = 1, the index of a continuous map F : S1 ∞� S1 turns out to be simply the winding number of F, i.e. the number of rotations around zero the trajectory of F makes. It is also easy to see that ind(FI ) = 1 for the identity map FI (x) = x,and ind(Fc) = 0 for every constant map Fc(x) = x0 = const

4.2.2 The Browers fixed point theorem One of the classical mathematical results that follow from the very existence of the index function is the famous Brower's fixed point theorem, which states that for every continuous function G: B ={x∈Rn+1:||≤1} The statement is obvious(though still very useful) when n= 1. Let us prove it for n> l, starting with assume the contrary. Then the map g: Bn bn which maps E bn to the point of Sm- which is the(unique) intersection of the open ray starting from G(a)and passing through z with Sn-. Then H: Sn-x0, 1]H Sm- defined by H(, t)=G(tr) is a homotopy between the identity map H(, 1)and the constant map H(, 0). Due to existence of the index function, such a homotopy does not exist, which proves the theorem 4.2.3 Existence of periodic solutions Let a: R"+R be locally Lipschitz and T-periodic with respect to the second a(a, t+T)=a(i,t)va,t where t>0 is a given number. Assume that solutions of the Ode i(t)=a(r(t), t) (4.3) with initial conditions r(O)E Bn remain in Bn for all times. Then(4. 3)has a T-periodic solution a=r(t)=r(t+T) for all tE R Indeed, the map I H.(T, 0, I)is a continuous function G: Bn+B". The solution

5 4.2.2 The Brower’s fixed point theorem One of the classical mathematical results that follow from the very existence of the index function is the famous Brower’s fixed point theorem, which states that for every continuous function G : Bn ∞� Bn, where Bn = {x ⊂ Rn+1 : |x| ∀ 1}, equation F(x) = x has at least one solution. The statement is obvious (though still very useful) when n = 1. Let us prove it for n > ˆ 1, starting with assume the contrary. Then the map G : Bn ∞� Bn which maps x ⊂ Bn to the point of Sn−1 which is the (unique) intersection of the open ray starting from G(x) and passing through x with Sn−1. Then H : Sn−1 × [0, 1] ∞� Sn−1 defined by H(x, t) = Gˆ(tx) is a homotopy between the identity map H(·, 1) and the constant map H(·, 0). Due to existence of the index function, such a homotopy does not exist, which proves the theorem. 4.2.3 Existence of periodic solutions Let a : Rn × R ∞� Rn be locally Lipschitz and T-periodic with respect to the second argument, i.e. a(¯x, t + T) = a(¯x, t) � x, t where T > 0 is a given number. Assume that solutions of the ODE x˙ (t) = a(x(t), t) (4.3) with initial conditions x(0) ⊂ Bn remain in Bn for all times. Then (4.3) has a T-periodic solution x = x(t) = x(t + T) for all t ⊂ R. Indeed, the map x¯ ∞� x(T, 0, x¯) is a continuous function G : Bn ∞� Bn. The solution of x¯ = G(¯x) defines the initial conditions for the periodic trajectory

点击下载完整版文档(PDF)VIP每日下载上限内不扣除下载券和下载次数;
按次数下载不扣除下载券;
24小时内重复下载只扣除一次;
顺序:VIP每日次数-->可用次数-->下载券;
已到末页,全文结束
相关文档

关于我们|帮助中心|下载说明|相关软件|意见反馈|联系我们

Copyright © 2008-现在 cucdc.com 高等教育资讯网 版权所有