INPUT-TO-STATE STABILITY FOR DISCRETE-TIME NONLINEAR SYSTEMS
|
|
|
- Victor Townsend
- 10 years ago
- Views:
Transcription
1 INPUT-TO-STATE STABILITY FOR DISCRETE-TIME NONLINEAR SYSTEMS Zhong-Ping Jiang Eduardo Sontag,1 Yuan Wang,2 Department of Electrical Engineering, Polytechnic University, Six Metrotech Center, Brooklyn, NY Department of Mathematics, Rutgers University, New Brunswick, NJ Department of Mathematical Sciences Florida Atlantic University Boca Raton, FL Abstract: In this paper the input-to-state stability (iss) property is studied for discrete-time nonlinear systems. We show that many iss results for continuoustime nonlinear systems in earlier papers (Sontag, 1989; Sontag, 1990; Sontag and Wang, 1996; Jiang et al., 1994; Coron et al., 1995) can be extended to the discretetime case. More precisely, we provide a Lyapunov-like sufficient condition for iss, and we show the equivalence between the iss property and various other properties. Utilizing the notion of iss, we present a small gain theorem for nonlinear discrete time systems. ISS stabilizability is discussed and connections with the continuoustime case are made. As in the continuous time case, where the notion iss found wide applications, we expect that this notion will provide a useful tool in areas related to stability for nonlinear discrete time systems as well. Keywords: discrete-time nonlinear systems, input-to-state stability, Lyapunov methods. 1. INTRODUCTION The notion of input-to-state stability (for short, iss) for nonlinear control systems was proposed by one of the authors (Sontag, 1989; Sontag, 1990) and has been used in the stability analysis and control synthesis of nonlinear systems by several authors see, e.g., (Sontag, 1989; Sontag, 1990; Sontag and Wang, 1996; Tsinias, 1993; Kazakos and Tsinias, 1994; Praly and Jiang, 1993; Jiang et al., 1994; Coron et al., 1995; Krstić et al., 1995). Basically, iss gives a quantitative bound of the 1 Supported in part by US Air Force Grant F Corresponding author. Supported in part by NSF Grant DMS state trajectories in terms of the magnitude of the control input and their initial conditions. The purpose of this paper is to study the iss property for discrete-time nonlinear systems. We show that many iss results for continuous-time nonlinear systems in earlier papers (Sontag, 1989; Sontag, 1990; Sontag and Wang, 1996; Jiang et al., 1994; Coron et al., 1995) can be extended to the discrete-time case. Among these extensions, we prove that various equivalent characterizations of the iss condition proposed in (Sontag and Wang, 1996) also hold for discrete-time nonlinear systems. It is also shown that iss small gain theorems in (Jiang et al., 1994; Coronet al., 1995) are extendable to the discrete-time setting. However, new phenomena arise in the extension from continuous-time to discrete-time. For continuous-
2 time affine systems, continuous stabilization implies iss stabilization by means of state-feedback change u = K(x) +v. For discrete-time affine or nonaffine systems, a more complex feedback transformation of the form u = K 1 (x)+k 2 (x)v is in general required. The construction of the feedback terms K 1 and K 2 turns out to be nontrivial; nevertheless, we show that they can be explicitly obtained, for a class of feedback linearizable systems. Section 2 starts with basic definitions and states some preliminary results for iss systems. Section 3 gives some equivalent definitions of iss, and closes with the statement of the main theorem. Section 4 proposes a nonlinear small gain theorem for discrete-time interconnected systems. Section 5 proves the important fact that continuous stabilization implies iss stabilization. An illustration is given via a class of feedback linearizable systems. 2. BASIC DEFINITIONS AND RESULTS We consider general nonlinear systems: x(k +1)=f(x(k), u(k)), (1) where states x(k) areinr n, and control values u(k) in R m, for some n and m, for each time instant k J +, the set of all nonnegative integers. We assume that f : R n R m R n is continuous and satisfies f(0, 0) = 0. Controls or inputs are functions u : J + R m. The set of all such functions with the supremum norm u =sup{ u(k) : k J + } < is denoted by l,where m denotes the usual Euclidean norm. For a given system, we often consider the same system but with controls restricted to take values in some subset Ω R m ;weusem Ω for the set of all such controls. We use Id to denote the identity function. For each ξ R n and each input u, wedenoteby x(,ξ,u) the trajectory of system (1) with initial state x(0) = ξ and the input u. Clearly such a trajectory is defined uniquely on J +,andfor each u and each k J +, x(k, ξ, u) depends on ξ continuously. Recall that a function γ : R 0 R 0 is a K- function if it is continuous, strictly increasing and γ(0) = 0; it is a K -function if it is a K-function and also γ(s) as s ; and it is a positive definite function if γ(s) > 0 for all s > 0, and γ(0) = 0. A function β : R 0 R 0 R 0 is a KL-function if, for each fixed t 0, the function β(, t)isak-function, and for each fixed s 0, the function β(s, ) is decreasing and β(s, t) 0 as t. Definition 2.1. System (1) is (globally) input-tostate stable (iss) if there exist a KL-function β : R 0 R 0 R and a K-function γ such that, for each input u l m and each ξ R n,it holds that x(k, ξ, u) β( ξ,k)+γ( u ) (2) for each k J +. 2 Note that, by causality, the same definition would result if one would replace (2) by x(k, ξ, u) β( ξ,k)+γ( u [k 1] ) (3) where k 1 and, for each l 0, u [l] denotes the truncation of u at l; i.e., u [l] (j) =u(j) ifj l, and u [l] (j) =0ifj>l. Definition 2.2. A continuous function V on R n is called an iss-lyapunov function for system (1) if α 1 ( ξ ) V (ξ) α 2 ( ξ ) (4) holds for some α 1,α 2 K,and V (f(ξ, µ)) V (ξ) α 3 ( ξ )+σ( µ ), (5) for some α 3 K, σ K. Asmoothiss-Lyapunov function is one which is smooth. 2 Observe that if V is an iss-lyapunov function for (1), then V is a Lyapunov function for the 0-input system x(k + 1)= f(x(k), 0). Proposition 2.3. If system (1) admits an iss- Lyapunov function, then it is iss. The converse of this result, as well as a converse Lyapunov theorem regarding uniform global asymptotic stability for systems with disturbances taking values in compacts, are also true, and will be proved in a forthcoming paper. Sketch of the proof of Proposition p-liss-iss. Assume that system (1) admits an iss-lyapnov function V.Letα i (i =1, 2, 3) and σ be as in (4) and (5). First observe that (5) can be rewritten as V (f(ξ, µ)) V (ξ) α 4 (V (ξ)) + σ( µ ), for all ξ and µ, whereα 4 = α 3 α 1 2.Toprovethe lemma, one needs the following: Lemma 2.4. For any K -function α, thereisa K -function α satisfying the following: α(s) α(s) for all s 0; and
3 Id α K. 2 We now return to the proof of Lemma 2.3. For the K -function α 4,let α 4 be a function picked as in Lemma 2.4. We then have V (f(ξ, µ)) V (ξ) α 4 (V (ξ)) + σ( µ ).(6) Fix a point ξ R n and pick an input u. Let x(k) denote the corresponding trajectory x(k, ξ, u)of(1).letc be any number in (0, 1), and consider the set defined by D = {ξ : V (ξ) b}, where b = α 1 4 ( σ( u ) c ). Claim: If there is some k 0 J + such that x(k 0 ) D, thenx(k) D for all k k 0. Proof. Assume that x(k 0 ) D. ThenV (x(k 0 )) b, thatis,c α 4 (V (x(k 0 ))) σ( u ). By (6), V (x(k 0 +1)) (1 c) α 4 (V (x(k 0 ))) + α 4 (V (x(k 0 ))) + σ( u ) where α 4 = Id c α 4. Observe that α 4 K because Id α 4 K. Combining this fact with the assumption that V (x(k 0 )) b, one can show that V (x(k 0 +1)) (1 c) α 4 (V (x(k 0 ))+b b.using induction, one can show that V (x(k 0 + j)) b for all j J +,thatis,v (x(k)) D for all k k 0. 2 We now let j 0 =min{k J + : x(k) D}. Then it follows from the above conclusion that V (x(k)) γ( u ) for all k j 0, where γ(r) = α 1 4 (σ(r)/c). For k < j 0, it holds that c α 4 (V (x k )) >σ( u ), and hence, V (x(k +1)) V (x(k)) (1 c) α 4 (V (x(k))). We let β(s, k) be the solution of the scalar difference equation z(k +1)=z(k) (1 c) α 4 (z(k)) with initial condition z(0) = s. Observe that, for any s > 0, the sequence z(t) decreases to zero (it never crosses zero, because Id α 4 0); thus, β is a KL-function. It follows, by induction on k, that V (x(k)) β(v (x(0)),k) for all 0 k j Thus, V (x(k)) max{ β(v (ξ),k), γ( u )}. From this one gets (2) with β(s, r) = α 1 1 ( β(α 2 ( ξ ), r)) and γ(s) = α 1 1 γ(s). 2 Remark 2.5. From the proof of Lemma 2.3, one sees that if the iss-lyapunov function satisfies the inequality V (x(k+1)) V (x(k)) α(v (x(k)))+ σ( u ), with the property that Id α K,thenfor any 0 <c<1, the function (α 1 1 α 1 )(σ(s)/c) can be taken as a gain function of the system. That is, for any 0 < c < 1, there is a KLfunction β such that x(k, ξ, u) β( ξ,k)+ (α 1 1 α 1 )(σ( u )/c)k for all ξ and all u EQUIVALENT NOTIONS OF ISS In this section we show that, as in the continuous time case, there are various notions that are equivalent to iss. 3.1 Asymptotic Gains Consider system (1). We say that the system has K-asymptotic gain if there exists some γ Ksuch that lim k x(k, ξ, u) lim γ( u(k) ) (7) k for all ξ R n. We say that system (1) is uniformly bounded-input bounded-state (ubibs) stable if bounded initial states and controls produce uniformly bounded trajectories, i.e., there exist two K-functions σ 1,σ 2 such that sup x(k, ξ, u) max{σ 1 ( ξ ), σ 2 ( u )} (8) k Again, by the causality property of the system, the above is equivalent to σ 1 (s) s and x(k, ξ, u) max {σ 1( ξ ), σ 2 ( u(j) )} (9) 0 j k 1 It is not hard to see that if a system is iss, then it is ubibs and it admits a K-asymptotic gain. The converse is also true. It will be proved after we introduce another related notion in the next section. 3.2 Robust Stability Margins As in the case of continuous time systems, there turns out to be also an interesting connection between the iss and the robust stability. By a (possibly time-varying) feedback law for a system (1) we will mean any function w : J + R n R n such that for each fixed k, w(k, ) isa continuous function. Let ρ be any K function. For any d M Ω with Ω as the closed unit ball in R m, we view the system x(k +1)=f(x(k),d(k)ρ( x(k) )) (10) as a system x(k + 1):= g(x(k),d(k)) with timevarying parameters d M Ω.Weusex ρ (k, ξ, d)to denote the solution to (10) corresponding to the initial state ξ and the disturbance signal d. We will say that the system (1) is robustly stable if there exists a K function ρ (called a stability margin) such that system (10) is globally asymptotically stable uniformly in d. To be more precise,
4 this means that there exists β KLsuch that the following holds for all trajectories of (10): x ρ (k, ξ, d) β( ξ,k) for all k 0, all d M Ω. Note that for a nonlinear gas system, in general only small perturbations can be tolerated while preserving stability. The requirement ρ K is thus nontrivial. Following the same steps as in Section V of (Sontag and Wang, 1996), one may show the next result: Lemma 3.1. System (1) is iss if and only if it is robustly stable. 2 (As a matter of fact, the proof turns out to be far simpler, because a key technical point, that asymptotic stability of systems with disturbances is equivalent to uniform asymptotic stability, is much easier in discrete-time.) The following lemma provides a key link in our main results. Its proof is analogous to the proof of the corresponding continuous time result in (Sontag and Wang, 1996, Section V)). Lemma 3.2. If system (1) is ubibs and if it admits K-asymptotic gain, then it is robustly stable. 2 To close this section, we summarize our results in this section: Theorem 1. Consider system (1). The following are equivalent: (1) It is iss. (2) It is ubibs and it admits K-asymptotic gain. (3) It is robustly stable. Proof. We have: [1 2] (clear by Definitions), [2 3] (see Lemma 3.2), [3 1] (see Lemma 3.1) NONLINEAR SMALL GAIN THEOREMS In this section, we will discuss the iss property for interconnected systems of the following type: x 1 (k +1) = f 1 (x 1 (k),x 2 (k),u 1 (k)), x 2 (k +1) = f 2 (x 1 (k),x 2 (k),u 2 (k)), (11) where for i =1, 2andforeachk J +, x i (k) R ni,u i (k) R mi,andf i : R n1 R n2 R mi R ni is continuous. It turns out that, in the continuous time case, iss small gain theorems are very powerful in treating stability problems for such interconnected systems. The first such results were obtained in (Jiang et al., 1994). Later the proofs of the main results were considerably simplified, using asymptotic gains, in (Coron et al., 1995); in conjunction with the results in (Sontag and Wang, 1996) this gives iss results. In (Jiang et al., 1996), a small gain theorem was presented in terms of Lyapunov functions. By following the continuous-time approach used in (Coron et al., 1995, Sec. 4), one can get the following small theorem. For the interconnected system (11), we assume that both of the subsystems are iss. To be more precise, we assume that, for the following systems, x 1 (k +1)=f 1 (x 1 (k),v 1 (k),u 1 (k)), (12) x 2 (k +1)=f 2 (x 2 (k),v 2 (k),u 2 (k)), (13) the trajectories satisfy { } x 1 (k) max β 1 ( ξ 1,k), γ1 x ( v 1 ), γ1 u ( u 1 ) { } x 2 (k) max β 2 ( ξ 2,k), γ2 x ( v 2 ), γ1 u ( u 2 ) Theorem 2. Assume that systems (12) and (13) are iss, withγ1 x(γx 2 (s)) <s(or, γx 2 (γx 1 (s)) <s)for all s>0. Then, the interconnected system (11) is iss with (u 1,u 2 ) as input. 2 The above small gain theorem can also be stated in terms of iss-lyapunov functions. Assume that both subsystems in (11) admit iss-lyapunov functions. Let V 1 (respectively, V 2 )beaniss-lyapunov function of (12) (respectively, (13)). That is, there exist class K -functions α ij, σ i, ρ x i and ρ u i (1 i, j 2) such that α i1 ( ξ ) V i (ξ) α i2 ( ξ ), and V 1 (f 1 (ξ 1,ξ 2,µ 1 )) V 1 (ξ 1 ) σ 1 (V 1 (ξ 1 )) +ρ x 1 (V 2 (ξ 2 )) + ρ u 1 ( µ 1 ), (14) V 2 (f 2 (ξ 2,ξ 1,µ 2 )) V 2 (ξ 2 ) σ 2 (V 2 (ξ 2 )) +ρ x 2 (V 1(ξ 1 )) + ρ u 2 ( µ 2 ). (15) In view of Lemma 2.4, we may assume that Id σ i Kfor i =1, 2. Theorem 3. Assume that systems (12) and (13) admit iss-lyapunov functions V 1 and V 2 respectively that satisfy (14)-(15), with Id σ i Kfor i =1, 2. If there exists a K -function ρ such that σ1 1 (Id + ρ) ρ x 1 σ2 1 (Id + ρ) ρ x 2 < Id, then the interconnected system (11) is iss with (u 1,u 2 ) as input. 5. ISS-STABILIZABILITY Consider system (1). We say that the system is continuously stabilizable if there is a continuous
5 function w : R n R m with w(0) = 0 such that under the feedback u = w(x), the closed-loop system x(k +1)=f(x(k),w(x(k))) is globally asymptotically stable (gas), i.e., there exists some KL-function β(, ) such that the following holds for all trajectories of the system: x(k, ξ) β( ξ,k) for all k 0. We say that system (1) is continuously iss stabilizable if there exist a continuous map w : R n R m with w(0) = 0 and an n n matrix Γ of continuous functions, invertible for each x, such that under the control law u = w(x)+γ(x)v the closed-loop system x(k +1)=f(x(k),w(x(k)) +Γ(x(k))v(k)) (16) is iss (with v as new input). Clearly, if a system is iss-stabilizable, then it is stabilizable. By following the approach used in the continuous case (see (Sontag, 1990)), one can prove the following: Theorem 4. System (1) is continuously stabilizable if and only if it is iss-stabilizable. 2 Remark 5.1. In contrast to the continuous case, the construction of an issstabilizing control law is far from explicit even for affine systems. Nevertheless, it is shown in the next section that an alternative and simple design of iss controllers is possible for a class of feedback linearizable systems Feedback Linearizable Systems The main purpose of this section is to illustrate our main results in the preceding section via feedback linearizable systems. As done in (Sontag, 1989) for continuous-time, we derive explicit formulas for the special case of such systems. Both continuous- and discrete-time linearizable systems have been fairly studied in the recent control literature, see, e.g., (Isidori, 1995; Nijmeijer and van der Schaft, 1990; Sontag, 1998) and references therein. It is worthing noting that a large body of research papers on nonlinear adaptive control have been based on globally feedback linearizable systems, see the recent texts (Krstić et al., 1995; Marino and Tomei, 1995) and the references cited therein. We restrict ourselves to systems (1) which are affine in u, thatis, x(k +1) = a(x(k)) + b(x(k))u (17) A system (17) is said to be globally feedback linearizable if there exist a state-coordinate change, that is, an isomorphism φ : R n R n which vanishes at zero, z = φ(x) (18) and a regular state-feedback transformation u = ϑ 1 (x) +ϑ 2 (x)v (19) with ϑ 2 (x) a globally invertible matrix, such that system (17) is brought to a linear controllable system z(k +1) = Az(k) + Bv (20) Take any constant matrix K 0 so that A + BK 0 is asymptotically stable. The linear feedback v(k) = K 0 z(k) globally asymptotically stabilizes the linear system (20) and therefore its original nonlinear system (17). In addition, the feedback v(k) = K 0 z(k)+w(k) makes the closed-loop system z(k +1)=(A + BK 0 )z(k)+bw(k) iss (with respect to w). This can be seen through the following: z(k) λ max (A + BK 0 ) k z(0) B + w (21) 1 λ max (A + BK 0 ) where λ max (A+BK 0 ) denotes the spectral radius of A + BK 0. Since φ is a global isomorphism and vanishes at zero, there exist two class K -functions φ 1 and φ 2 such that φ 1 ( x ) φ(x) φ 2 ( x ) (22) This together with (21) and (18) implies that ( ) x(k) φ 1 1 2λ max (A + BK 0 ) k φ2 ( x(0) ) ( ) + φ B 1 λ max (A + BK 0 ) w (23) Therefore, system (17) is made iss with a feedback law u = ϑ 1 (x(k)) + ϑ 2 (x(k))k 0 φ(x(k)) + ϑ 2 (x(k))w(k). By analogy with the case of continuous-time systems (Sontag, 1989), we would ask whether or not
6 it is possible to render system (17) iss using a nonlinear feedback of the form u = K(x) +w (24) where K : R n R m is continuous with K(0) = 0. First of all, we point out that, similar as in the continuous time case, a linear feedback does not necessarily produce a system which is iss with respect to additive disturbances occuring at the level of real control input u. More precisely, when taking K as the linearizing feedback, i.e. K(x(k)) = ϑ 1 (x(k)) + ϑ 2 (x(k))k 0 φ(x(k)), the corresponding closed-loop system x(k + 1)= a(x(k)) + b(x(k))(k(x(k)) + w) mayfailtobeiss with respect to the signal w. As an illustration of this important point, we consider a discrete-time scalar system x(k +1) = x(k) 3 +( x(k) +1)u (25) which is globally rendered linear by a nonlinear feedback of the form K(x) = x3 x v. (26) x +1 A further choice of v(k) = 1 x(k) gives a feedback 2 law that globally asymptotically stabilizes system (25). However, this linear feedback controller does not make the closed-loop system iss with respect to additive disturbances w at the true control input u: x(k +1) = 1 x(k) +( x(k) +1)w. (27) 2 Indeed, letting w = 1 in (27) yields that the solutions x(k) withx(0) = 0 of (27) diverge to + as k +. To compare with the continuous time case, a natural question to ask is if there is any feedback that make the closed-loop system iss? Unfortunately, in contrast to the continuous time situation, there does generally not exist a feedback of the form (24) that produces an iss system. As a counterexample, we still consider system (25). The system (25) in closed-loop with (24) is as the following x(k +1) = G(x(k)) + ( x(k) +1)w(k) with G(x(k)) = x(k) 3 +( x(k) +1)K(x(k)). Now consider the signal w(k) givenby: { 1ifG(x(k)) 0, w(k) = 1 ifg(x(k)) < 0. The above argument shows that the system fails to be iss no matter what G is. Observe that this is still true even if G is dead-beat stable, i.e., G is such a function that every trajectory of x(k + 1) = G(x(k)) can reach the origin in finite time (e.g., G(x) 0). 6. REFERENCES Coron, J.-M., L. Praly and A. Teel (1995). Feedback stabilization of nonlinear systems: sufficient conditions and Lyapunov and inputoutput techniques. In: Trends in Control (A. Isidori, Ed.). Springer-Verlag. London. Isidori, A. (1995). Nonlinear Control Systems: An Introduction. 3rd ed., Springer-Verlag. New York. Jiang, Z.-P., A. Teel and L. Praly (1994). Smallgain theorem for ISS systems and applications. Mathematics of Control, Signals, and Systems 7, Jiang, Z.-P., I. M. Y. Mareels and Y. Wang (1996). A Lyapunov formulation of the nonlinear small gain theorem for interconnected ISS systems. Automatica 32, Kazakos, D. and J. Tsinias (1994). The input to state stability conditions and global stabilization of discrete-time systems. IEEE Trans. Automat. Control 39, Krstić, M., I. Kanellakopoulos and P. V. Kokotović (1995). Nonlinear and Adaptive Control Design. John Wiley & Sons. New York. Marino, R. and P. Tomei (1995). Nonlinear Control Design: Geometric, Adaptive and Robust. Prentice Hall Europe. London. Nijmeijer, H. and A. van der Schaft (1990). Nonlinear Dynamical Control Systems. Springer- Verlag. New York. Praly, L. and Z. P. Jiang (1993). Stabilization by output feedback for systems with ISS inverse dynamics. Systems Control Letters 21, Sontag, E. D. (1989). Smooth stabilization implies coprime factorization. IEEE Trans. Automat. Control 34, Sontag, E. D. (1990). Further facts about input to state stabilization. IEEE Trans. Automat. Control 35, Sontag, E. D. (1998). Mathematical Control Theory, 2nd ed.. Springer. New York. Sontag, E. D. and Y. Wang (1996). New characterizations of the input to state stability property. IEEE Trans. Automat. Control 41, Tsinias, J. (1993). Versions of Sontag s input to state stability condition and the global stabilization problem. SIAM J. Control and Optimization 31, It can be seen that with such a choice of w, x(k +1) x(k) + 1, and hence, x(k +1).
1 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)
LOOP TRANSFER RECOVERY FOR SAMPLED-DATA SYSTEMS 1
LOOP TRANSFER RECOVERY FOR SAMPLED-DATA SYSTEMS 1 Henrik Niemann Jakob Stoustrup Mike Lind Rank Bahram Shafai Dept. of Automation, Technical University of Denmark, Building 326, DK-2800 Lyngby, Denmark
How To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
Research Article Stability Analysis for Higher-Order 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 Higher-Order Adjacent Derivative
Example 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
Lecture 13 Linear quadratic Lyapunov theory
EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time
A Passivity Measure Of Systems In Cascade Based On Passivity Indices
49th IEEE Conference on Decision and Control December 5-7, Hilton Atlanta Hotel, Atlanta, GA, USA A Passivity Measure Of Systems In Cascade Based On Passivity Indices Han Yu and Panos J Antsaklis Abstract
ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction
ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that
MA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
IRREDUCIBLE 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
4 Lyapunov Stability Theory
4 Lyapunov Stability Theory In this section we review the tools of Lyapunov stability theory. These tools will be used in the next section to analyze the stability properties of a robot controller. We
Continued 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
CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí
Opuscula Math. 34 no. 4 2014 683 690 http://dx.doi.org/10.7494/opmath.2014.34.4.683 Opuscula Mathematica CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian Pasquale
Chapter 3 Nonlinear Model Predictive Control
Chapter 3 Nonlinear Model Predictive Control In this chapter, we introduce the nonlinear model predictive control algorithm in a rigorous way. We start by defining a basic NMPC algorithm for constant reference
Fuzzy 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
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
Lecture 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
Adaptive 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
Metric 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
Date: April 12, 2001. Contents
2 Lagrange Multipliers Date: April 12, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 12 2.3. Informative Lagrange Multipliers...........
Metric 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
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
Numerical 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
Separation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
Ideal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four
U.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
BANACH 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
Inner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 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,
Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
Duality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
Reference: Introduction to Partial Differential Equations by G. Folland, 1995, Chap. 3.
5 Potential Theory Reference: Introduction to Partial Differential Equations by G. Folland, 995, Chap. 3. 5. Problems of Interest. In what follows, we consider Ω an open, bounded subset of R n with C 2
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
NOTES 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
Properties 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 non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
15 Limit sets. Lyapunov functions
15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior
11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
Continuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
THE 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
Finite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
MATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS XAVIER CABRÉ, MANEL SANCHÓN, AND JOEL SPRUCK In memory of Rou-Huai Wang 1. Introduction In this note we consider semistable
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
This material is posted here with permission of the IEEE Such permission of the IEEE does not in any way imply IEEE endorsement of any of Helsinki University of Technology's products or services Internal
Real-Time Systems Versus Cyber-Physical Systems: Where is the Difference?
Real-Time Systems Versus Cyber-Physical Systems: Where is the Difference? Samarjit Chakraborty www.rcs.ei.tum.de TU Munich, Germany Joint work with Dip Goswami*, Reinhard Schneider #, Alejandro Masrur
it is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
Notes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
TD(0) Leads to Better Policies than Approximate Value Iteration
TD(0) Leads to Better Policies than Approximate Value Iteration Benjamin Van Roy Management Science and Engineering and Electrical Engineering Stanford University Stanford, CA 94305 [email protected] Abstract
Chapter 5. Banach Spaces
9 Chapter 5 Banach Spaces Many linear equations may be formulated in terms of a suitable linear operator acting on a Banach space. In this chapter, we study Banach spaces and linear operators acting on
Note on some explicit formulae for twin prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:
2.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
1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
PID Controller Design for Nonlinear Systems Using Discrete-Time Local Model Networks
PID Controller Design for Nonlinear Systems Using Discrete-Time Local Model Networks 4. Workshop für Modellbasierte Kalibriermethoden Nikolaus Euler-Rolle, Christoph Hametner, Stefan Jakubek Christian
Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski.
Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski. Fabienne Comte, Celine Duval, Valentine Genon-Catalot To cite this version: Fabienne
A simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
Research Article End-Effector Trajectory Tracking Control of Space Robot with L 2 Gain Performance
Mathematical Problems in Engineering Volume 5, Article ID 7534, 9 pages http://dx.doi.org/.55/5/7534 Research Article End-Effector Trajectory Tracking Control of Space Robot with L Gain Performance Haibo
PUTNAM 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
Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces
Communications in Mathematical Physics Manuscript-Nr. (will be inserted by hand later) Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Stefan Bechtluft-Sachs, Marco Hien Naturwissenschaftliche
Linear-Quadratic Optimal Controller 10.3 Optimal Linear Control Systems
Linear-Quadratic Optimal Controller 10.3 Optimal Linear Control Systems In Chapters 8 and 9 of this book we have designed dynamic controllers such that the closed-loop systems display the desired transient
= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
Hybrid dynamics in large-scale logistics networks
Hybrid dynamics in large-scale logistics networks von Mykhaylo Kosmykov Dissertation Zur Erlangung des Grades eines Doktors der Naturwissenschaften Dr. rer. nat. Vorgelegt im Fachbereich 3 (Mathematik
UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE 101 - Fall 2009 Linear Systems Fundamentals
UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE 101 - Fall 2009 Linear Systems Fundamentals MIDTERM EXAM You are allowed one 2-sided sheet of notes. No books, no other
0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup
456 BRUCE K. DRIVER 24. Hölder Spaces Notation 24.1. Let Ω be an open subset of R d,bc(ω) and BC( Ω) be the bounded continuous functions on Ω and Ω respectively. By identifying f BC( Ω) with f Ω BC(Ω),
F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
Analysis of Load Frequency Control Performance Assessment Criteria
520 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 16, NO. 3, AUGUST 2001 Analysis of Load Frequency Control Performance Assessment Criteria George Gross, Fellow, IEEE and Jeong Woo Lee Abstract This paper presents
n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let
Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as
Random graphs with a given degree sequence
Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.
Cross product and determinants (Sect. 12.4) Two main ways to introduce the cross product
Cross product and determinants (Sect. 12.4) Two main ways to introduce the cross product Geometrical definition Properties Expression in components. Definition in components Properties Geometrical expression.
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
Stationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
The 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
Predictive Control Algorithms for Nonlinear Systems
Predictive Control Algorithms for Nonlinear Systems DOCTORAL THESIS for receiving the doctoral degree from the Gh. Asachi Technical University of Iaşi, România The Defense will take place on 15 September
LECTURE 15: AMERICAN OPTIONS
LECTURE 15: AMERICAN OPTIONS 1. Introduction All of the options that we have considered thus far have been of the European variety: exercise is permitted only at the termination of the contract. These
Convex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
Stochastic Inventory Control
Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the
THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING
THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The Black-Scholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages
Iterative Methods for Solving Linear Systems
Chapter 5 Iterative Methods for Solving Linear Systems 5.1 Convergence of Sequences of Vectors and Matrices In Chapter 2 we have discussed some of the main methods for solving systems of linear equations.
Factorization 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
OPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTS
Probability in the Engineering and Informational Sciences, 22, 2008, 107 131. Printed in the U.S.A. DOI: 10.1017/S0269964808000077 OPTIMAL CONTROL OF FLEXILE SERVERS IN TWO TANDEM QUEUES WITH OPERATING
The Banach-Tarski Paradox
University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible
The Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:
Extremal equilibria for reaction diffusion equations in bounded domains and applications.
Extremal equilibria for reaction diffusion equations in bounded domains and applications. Aníbal Rodríguez-Bernal Alejandro Vidal-López Departamento de Matemática Aplicada Universidad Complutense de Madrid,
OPTIMAL 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
Stability Analysis of Nonlinear Systems with Linear Programming
Stability Analysis of Nonlinear Systems with Linear Programming A Lyapunov Functions Based Approach Von der Fakultät für Naturwissenschaften - Institut für Mathematik der Gerhard-Mercator-Universität Duisburg
Inner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
1 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
The cover SU(2) SO(3) and related topics
The cover SU(2) SO(3) and related topics Iordan Ganev December 2011 Abstract The subgroup U of unit quaternions is isomorphic to SU(2) and is a double cover of SO(3). This allows a simple computation of
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it
