Bohl exponent for time-varying linear differential-algebraic equations

Size: px
Start display at page:

Download "Bohl exponent for time-varying linear differential-algebraic equations"

Transcription

1 Bohl exponent for time-varying linear differential-algebraic equations Thomas Berger Institute of Mathematics, Ilmenau University of Technology, Weimarer Straße 25, Ilmenau, Germany, International Journal of Control 1 st subm.: Jan. 17, 212; rev. version: April 19, 212 Abstract We study stability of linear time-varying differential-algebraic equations (DAEs). The Bohl exponent is introduced and finiteness of the Bohl exponent is characterized, the equivalence of exponential stability and a negative Bohl exponent is shown and shift properties are derived. We also show that the Bohl exponent is invariant under the set of Bohl transformations. For the class of DAEs which possess a transition matrix introduced in this paper, the Bohl exponent is exploited to characterize boundedness of solutions of a Cauchy problem and robustness of exponential stability. Keywords: Time-varying linear differential-algebraic equations, transition matrix, Bohl exponent, Bohl transformation, exponential stability, robustness 1 Introduction Differential-algebraic equations (DAEs) are a combination of differential equations along with (implicitly hidden) algebraic constraints. They have been discovered to be the perfect tool for modeling a vast variety of problems e.g. in mechanical engineering [3, 26, 45], multibody dynamics [24, 49], electrical networks [23, 43, 47] and chemical engineering [17, 2, 44], which often cannot be modeled by standard ordinary differential equations (ODEs). A nice example can also be found in [33]: A mobile manipulator is modeled as a linear time-varying differential-algebraic control problem. These problems indeed have in common that the dynamics are algebraically constrained, for instance by tracks, Kirchhoff laws or conservation laws. In particular the power in application is responsible for DAEs being nowadays an established field in applied mathematics and subject of various monographs and textbooks [1, 12, 13, 18, 27, 34]. In this work we study questions related to the stability theory of linear time-varying DAEs: The concepts of exponential stability, Bohl exponent and robustness. Due to the algebraic constraints in DAEs most of the classical concepts of the qualitative theory have to be modified and the analysis gets more involved. As stated in [38] there is a close relationship between the theory of the Bohl exponent (or the spectral theory in general, resp.) and the theory of adjoint equations, which has been studied in the context of control problems, see e.g. [5, 14, 36]. This work was supported by DFG grant Il25/9. 1

2 We consider time-varying linear differential-algebraic equations of the form E(t)ẋ = A(t)x, (1.1) where (E, A) C(R + ; R n n ) 2, n N. For brevity, we identify the tuple (E, A) with the DAE (1.1). For robustness analysis we also consider implicit differential equations F (t, x, ẋ) =, (1.2) where F C(R + R n R n ; R n ). The functions E, A and F are supposed to be continuous for technical reasons only: the results are also valid if the functions are piecewise continuous, L loc, or distributional. Rather than the systems entries, the solution space is crucial, and here we allow for right global solutions, see Definition 2.1. The stability theory of general time-varying DAEs (1.2) and even linear systems (E, A) is an active research topic. However, most of the stability results for DAEs are obtained for index-1 systems, see e.g. [2, 11, 16, 21, 22, 25, 28, 37, 4, 46, 5]. When higher index DAEs are considered, additional assumptions have to be made [29, 41, 42, 5]. It is also possible to reformulate the DAE by applying some index reduction method in order to obtain a lower-index DAE with the same solution set, see e.g. [34, 35, 38]. The main focus of stability theory, and therefore of the articles mentioned above, is the asymptotic behaviour of the solutions of the given system. There are two fundamental concepts in the theory of ordinary differential equations to investigate asymptotic behaviour of solutions: the Lyapunov and the Bohl exponent. While the Lyapunov exponent, introduced by Aleksandr M. Lyapunov [39], gives a bound for the exponential growth of the solutions of the system, the Bohl exponent, introduced by Piers Bohl [9], describes the uniform exponential growth of the solutions. It is well-known from ODEs that the Bohl exponent compared to the Lyapunov exponent is the appropriate concept when it comes to time-varying, instead of time-invariant, ODEs. The Bohl exponent has been successfully used to characterize exponential stability and to derive robustness results, see e.g. [19, 3]. For an excellent summary of the history of the development of the Lyapunov and Bohl exponent see [19, pp ]. When it comes to DAEs, the Bohl exponent approach has, to the author s best knowledge, only been carried out in two contributions [16, 38]. Though [16] generalize several ODE results concerning the Bohl exponent to DAEs, they treat only linear DAEs of index 1. [38] investigate Bohl spectral intervals and the Bohl exponent of particular solutions and fundamental solution matrices, however the Bohl exponent of the system does not lie in their focus. Both [16] and [38] avoid the problem of a proper definition of the Bohl exponent for general implicit differential equations (1.2). The aim of the present article is to develop a theory of the Bohl exponent for DAEs (E, A). To this end, the obstacle which arises from the algebraic constraints in DAEs has to be overcome. It is therefore necessary to modify the classical definition known from ODEs. Hence, we consider the set of right global solutions of (E, A) introduced in [6] to obtain a proper definition of the Bohl exponent for DAE systems. The notions of (right global) solutions and exponential stability are introduced in Section 2. In Section 3 we define the Bohl exponent for a solution x and the system (1.2) and derive properties of it. Furthermore, finiteness of the Bohl exponent is characterized, the equivalence of exponential stability and a negative Bohl exponent is shown and shift properties are derived. Lyapunov and Bohl transformation are introduced and it is shown that the Bohl exponent is invariant under Bohl transformation. In Section 4, we focus on the class of DAEs which possess a transition matrix: It is shown that solutions of certain structured perturbations of DAEs can be represented in terms of an integral equation. For this class of systems we derive the main theorems in Section 5: Theorem 5.5 shows that the Bohl exponent is negative if, and only if, the Cauchy problem (5.6) has a bounded solution 2

3 whenever the inhomogeneity is in class (5.7). Theorem 5.7 characterizes the robustness of exponential stability, more precisely, the behaviour of the Bohl exponent under perturbations is characterized. As it is well-known for ODEs, Theorem 5.7 states that the Bohl exponent does only change little if the perturbation of the system is sufficiently small. The first approach to robustness of exponential stability of time-varying DAEs has been carried out in [16] - also using the Bohl exponent - however, only for index-1 systems. In the present paper, to the author s best knowledge, the first robustness results for general DAE systems, for which an index does not even need to exist, are derived. The results of the present paper are the generalizations of ODE results in [19, 3, 31, 32] to DAEs. While stability is of course an important issue in control theory, and therefore the results concerning the Bohl exponent are essential, the obtained robustness results are important in order to deal with problems in adaptive control [4] and robust control [51]. Nomenclature N, N the set of natural numbers, N = N {} R + := (, ) im A Gl n (R) the image of the matrix A R m n the general linear group of degree n, i.e.,the set of all invertible n n matrices over R x := x x, the Euclidean norm of x R n B δ (x ) := { x R n x x < δ }, the open ball of radius δ > around x R n A := sup { Ax x = 1 }, induced matrix norm of A R n m C(I; S) C k (I; S) dom f the set of continuous functions f : I S from an open set I R to a vector space S the set of k-times continuously differentiable functions f : I S from an open set I R to a vector space S the domain of the function f f := sup { f(t) t dom f } the infinity norm of the function f f M the restriction of the function f on a set M dom f f(+) := lim t f(t) if this limit exists 2 Stability of solutions The concept of a solution and its extendability is introduced similarly to ODEs, see for example [1, Sec. 5]. Note that we consider the concept of classical, i.e., continuously differentiable, solutions. Definition 2.1 (Solutions). A function x : (α, ω) R n, α < ω, is called solution of (1.2) if, and only if, x C 1 ((α, ω); R n ) and x satisfies (1.2) for all t (α, ω). A solution x : (α, ω) R n of (1.2) is called a x is called (right) extension of x if, and only if, ω ω and x = x (α,ω). 3

4 right maximal if, and only if, ω = ω for every extension x : (α, ω) R n of x, right global if, and only if, ω =, global if, and only if, (α, ω) = R +. Consider the linear system (E, A). Let (t, x ) R + R n ; then the set of all right maximal solutions of the initial value problem (E, A), x(t ) = x is denoted by { S E,A (t, x ) := x : J R n J open interval, t J, x(t ) = x },, x( ) is a right maximal solution of (E, A) and the set of all right global solutions of (E, A), x(t ) = x by G E,A (t, x ) := { x( ) S E,A (t, x ) x( ) is right global solution of (E, A) }. For DAEs it is essential to consider the appropriate set of solutions and the corresponding initial values for which these solutions exist. The set G E,A (t, x ) has proved to be a fundamental solution space of time-varying DAEs (E, A), see [6]. The set of all pairs of consistent initial values of (E, A) C(R + ; R n n ) 2 and the linear subspace of initial values which are consistent at time t R + is denoted by V E,A := { (t, x ) R + R n there exists a (local) solution x( ) of (E, A) with t dom x and x(t ) = x V E,A (t ) := { x R n (t, x ) V E,A }, resp. Note that if x : J R n is a solution of (E, A), then x(t) V E,A (t) for all t J. Possible singular behaviour of right maximal solutions x : (α, ω) R n of (E, A) with ω < is discussed in [6, Sec. 2]: it is shown that DAEs behave very differently compared to ODEs. Next we define exponential stability of a linear DAE (E, A). Note that usually stability is a property of a particular solution: other existing solutions in a neighborhood of it stay close to it for all time. For linear systems it is sufficient to consider this property only for the trivial solution. However, for DAEs it is at first sight not clear whether this is still true. To this end, it is shown in [6, Thm. 4.3] that also for DAEs (E, A) it suffices to consider the stability properties of the trivial solution. Therefore, we introduce exponential stability of (E, A) as in [6, Defs. 4.1 & 4.4]. Definition 2.2 (Exponential stability). A linear DAE (E, A) C(R + ; R n n ) 2 is called exponentially stable if, and only if, there exist µ, M > such that for all initial times t R + there exists δ > so that for all initial values x B δ () and all solutions x( ) S E,A (t, x ) of the corresponding initial value problem we have [t, ) dom x and, for all t t, x(t) Me µ(t t) x. Note that the initial value x B δ () in Definition 2.2 is not explicitly required to be consistent. However, if x V E,A (t ), then clearly S E,A (t, x ) = and thus the statement is also true in this case. Furthermore, the local Definition 2.2 (i.e., δ > and x B δ ()) seems to be artificial and superfluous for linear DAEs. However, we consider general time-varying linear DAEs, where it is not clear whether a condition which holds locally does also hold globally. In Section 5 it is shown that the latter is indeed the case for linear DAEs which possess a transition matrix (cf. Definition 4.1). Finalizing this section, note that our notion of exponential stability is sometimes referred to as uniformly exponential stability, see e.g. [48, Def. 6.5], [31, p. 257] for ODEs. This is due to the fact that M in Definition 2.2 does not depend on the initial time t. 4 },

5 3 Bohl exponent and Bohl transformation - general results We introduce the concept of Bohl exponent for right global solutions of (1.2) and for the system (1.2) itself. Then we concentrate on linear DAEs (E, A) and derive basic properties of the Bohl exponent. The main results of this section are Theorem 3.9, which states conditions equivalent to a negative Bohl exponent, and Proposition 3.17, which states that the Bohl exponent is preserved under Bohl transformation. We stress that in order to generalize ODE results to DAEs it is crucial to consider the correct (function) spaces and to bear in mind that, in general, there is no transition matrix and associated semi group property. The notation B(ν, N), introduced next for the general nonlinear DAE (1.2) and ν R, N R +, was first used by P. Bohl [9] for linear ODEs. We say that (1.2) has property B(ν, N) if, and only if, for all right global solutions x : (α, ) R n of (1.2) we have that, for all t s > α, x(t) Ne ν(t s) x(s). For more information about the applications of this property in (mathematical) history see [19, pp ]. We continue with the definition of the Bohl exponent for right global solutions of (1.2). This is a straightforward generalization of the corresponding concept for ODEs (see e.g. [19]); [38] generalize this to the class of linear time-varying DAEs (E, A) which have a well-defined differentiation index. Definition 3.1 (Bohl exponent for solutions). The Bohl exponent of a right global solution x : (α, ) R n of (1.2) is defined as { } k B (x) := inf ρ R N ρ > such that for all t s > α : x(t) N ρ e ρ(t s) x(s). Note that we use the usual convention inf = +. It is clear that if x(t) = for all t > α, then k B (x) =. However, if x vanishes only at isolated points, then the Bohl exponent might become +. While the latter is usually undesirable, a Bohl exponent of is not critical and all the properties which hold for solutions with Bohl exponent k B (x) R hold for solutions with Bohl exponent k B (x) = as well. Therefore, we make the convention to say that the Bohl exponent k B (x) is finite if k B (x) R { }. The above mentioned issues and the possible calculation of the Bohl exponent are addressed in the following remark. Remark 3.2 (Calculation of Bohl exponent). On page 169 in [38] it is shown that, as a generalization of the formula in [19, p. 118], the Bohl exponent (as considered in [38]) admits the representation k B (x) = lim sup s,t s ln x(t) ln x(s). (3.1) t s However, formula (3.1) does, in general, not hold true for solutions of systems (1.2), or even linear DAEs (E, A) C(R + ; R n n ) 2. Consider the scalar system (t 2)ẋ = 2x, t R +. (3.2) { (t 2) Then x : R + R, t 2, < t 2 is a non-trivial global solution of (3.2) and k, t > 2 B (x) = <. But obviously, a calculation of k B (x) via formula (3.1) is impossible. Here x [2, ) =, which 5

6 is possible because of the finiteness of the Bohl exponent of x. If the Bohl exponent is not finite, solutions may vanish only at isolated points. Consider the DAE sin t ẋ = cos t x, t R +. (3.3) The function x : R + R, t sin t, is a non-trivial global solution of (3.3) with k B (x) =. Since x(kπ) = for all k N a calculation of k B (x) via formula (3.1) is impossible. Nevertheless the following is easily verified: If x : (α, ) R n is any right global solution of (1.2) and x(t) for all t > α, then k B (x) may be calculated via formula (3.1). Example 3.3. Consider the system (t 1)ẋ = (2 t)x, t R +. (3.4) Any local solution of (3.4) extends uniquely to a global solution and the set of global solutions of (3.4) is given by { R + t c(t 1)e (t 1) } c R. Since any global solution of (3.4) is zero at t = 1, the Bohl exponent of any non-trivial global solution equals +, even though all global solutions tend exponentially to zero. This shows that an exponential decay rate of a solution of a time-varying DAE is not sufficient to deduce a negative or even finite Bohl exponent, as in the case of ODEs. This is due to the possible non-uniqueness of solutions, cf. also Proposition 3.8. Now, following [19, Ch. VII] and using the concept of right global solutions, it is straightforward to define the Bohl exponent for a system (1.2). In order to define the Bohl exponent for nonlinear systems (1.2) the additional assumption F (t,, ) =, t R +, (3.5) has to be imposed. This is due to the fact that the Bohl exponent describes the uniform asymptotic behaviour of the solutions with respect to the trivial solution. It is also possible to define the Bohl exponent with respect to any other solution of the system, but via a shift by this solution we may reduce it to the above situation. This Bohl exponent is therefore also called Bohl exponent at zero of (1.2) [19, Ch. VII]. For brevity we just call it Bohl exponent in this paper. Definition 3.4 (Bohl exponent for DAEs). The Bohl exponent of a system (1.2) which satisfies (3.5) is defined as { k B (1.2) := inf ρ R N ρ > such that for all right global sln. x : (α, ) R n } of (1.2) we have that, for all t s > α: x(t) N ρ e ρ(t s). x(s) In the case of a linear DAE (E, A) C(R + ; R n n ) 2 we write k B (E, A) instead of k B (1.1). Similar to Bohl exponents of particular solutions, it may happen that every right global solution of (1.2) is identical zero, thus the Bohl exponent is k B (1.2) =. Therefore, due to the same reasons as before, we make the convention to say that the Bohl exponent k B (1.2) is finite if k B (1.2) R { }. We illustrate Definition 3.4 by an example. Example 3.5. Consider the semi-explicit index-1 DAE [ ] ) [ 1 (ẋ1 cos = 2 ] ( ) t sin t x1. (3.6) sin t 1 ẋ 2 x 2 6

7 Simple calculations show that ẋ 1 = x 1 and x 2 = (sin t)x 1 and therefore any right global solution (x 1, x 2 ) : (α, ) R 2, α, of (3.6) has the representation: Hence, for all t, s > α, x 1 (t) = e (t s) x 1 (s), x 2 (t) = x 1 (t) sin t for t, s > α. (3.7) (x 1 (t), x 2 (t)) = e (t s) (1 + sin 2 t)x 1 (s) 2 2e (t s) (1 + sin 2 s)x 1 (s) 2 = 2e (t s) (x 1 (s), x 2 (s)), by which it is straightforward to see that system (3.6) has Bohl exponent k B (3.6) = 1. Remark 3.6. It is obvious that the Bohl exponent k B (x) of right global solutions x of (1.2) and the Bohl exponent k B (1.2) of (1.2) are related in the following way: right global sln. x( ) of (1.2) : k B (x) k B (1.2). (3.8) However, equality does not hold: System (3.2) has Bohl exponent k B (3.2) = since R + t (t 2) 2 is a global solution of (3.2). However, as shown in Remark 3.2, there are nontrivial global solutions with finite Bohl exponent. The Bohl exponent for the nonlinear DAE (1.2) will be used for robustness analysis of linear DAEs at the end of Section 5. In the remainder of this section we will consider linear DAEs (E, A) C(R + ; R n n ) 2. The next proposition characterizes finiteness of the Bohl exponent. Proposition 3.7 (Finiteness of the Bohl exponent). Let (E, A) C(R + ; R n n ) 2. Then k B (E, A) < if, and only if, { } x(t) sup x (t, x ) R + R n, x( ) G E,A (t, x ), t [t, t + 1] <. (3.9) Here we use the usual conventions α allowed. := for α > and := ; so x = in (3.9) is specifically Proof: The proof is straightforward using arguments as in [31, Prop ]. It only has to be paid attention to the case x = and (for necessity) the fact that, in contrast to ODEs, no transition matrix and its semi group properties are available. Then necessity can be deduced from the observation that, if t t and k N is such that t + (k 1) t < t + k and x as well as x(t j) for all j {1,..., k 1}, then x(t) x = x(t) x(t 1) x(t 1) x(t 2) x(t (k 1)) x. For the solutions of a DAE (E, A) with finite Bohl exponent k B (E, A) we have the following uniqueness property, the proof of which is straightforward. Proposition 3.8 (Bohl exponent and unique solutions). Let (E, A) C(R + ; R n n ) 2 such that k B (E, A) <. If x 1 : (α 1, ) R n and x 2 : (α 2, ) R n both solve the initial value problem (E, A), x(t ) = x for (t, x ) R + R n, then x 1 [t, ) = x 2 [t, ). 7

8 For linear ODEs it is well-known [31, Thm ] that exponential stability is equivalent to a negative Bohl exponent and to the fact that the transition matrix is bounded in the L p -norm. This is useful for studying robustness of exponential stability, since the Bohl exponent turns out to be the appropriate tool for robustness analysis, see e.g. [19, 3]. For DAEs we proceed in a similar manner by first stating a DAE-version of [31, Thm ] and then deriving robustness results in Section 5. The next theorem shows that the Bohl exponent of (E, A) is negative (or ) if, and only if, the trivial solution of (E, A) is essentially exponentially stable. Essentially in the sense that we cannot guarantee that every existing right maximal solution in a neighborhood of the trivial solution is right global, cf. Definition 2.2. But we can guarantee that all right global solutions decay exponentially to zero. In this sense it is a DAE-version of the ODE result [31, Thm ]. Theorem 3.9 (Exponential stability via Bohl exponent). Let (E, A) C(R + ; R n n ) 2 such that k B (E, A) <. Then the following statements are equivalent. (i) k B (E, A) <. (ii) There exist µ, M > such that for all (t, x ) R + R n, x( ) G E,A (t, x ) and t t it holds x(t) M e µ(t t) x. (iii) For all p R + there exists c > such that for all (t, x ) R + R n and x( ) G E,A (t, x ) it holds t x(t) p dt c x p. Proof: The proof follows from a straightforward extension of the arguments used in [31, Thm ]. Remark 3.1 (Lyapunov function). As a consequence of [6, Thm. 5.2], the existence of a Lyapunov function for (E, A) (see [6, Def. 5.1]) is sufficient for the Bohl exponent k B (E, A) to be negative (or ). The following proposition states a shift property of the Bohl exponent, i.e., that, roughly speaking, adding a scalar multiple of E to A does shift the Bohl exponent k B (E, A) by exactly this scalar. It is a generalization of [32, Lem ], see also [3, Lem. 2.4]; it has been proved for DAEs of index 1 in [16, Rem. 4.9]. Proposition 3.11 (Shift property). For (E, A) C(R + ; R n n ) 2 and (1, a) C(R + ; R) 2 the following statements hold true: { (i) k B (1, a) = inf ω R M ω > t s > : e } t s a(τ) dτ M ω e ω(t s). s a(τ) dτ (ii) If k B (1, a) <, then k B (1, a) = lim sup t s. s,t s (iii) If k B (1, a) = then s a(τ) dτ lim s,t s t s < (note that we require the lim here instead of the lim sup), (a) k B (1, a) = k B (1, a) and (b) k B (E, A + ae) = k B (E, A) + k B (1, a). Proof: (i), (ii) and (iii)(a) are simple statements concerning ODEs, the proofs of which can be found in [32, Sec. 4.3]. The proof of (iii)(b) is straightforward - it is only necessary to pay attention to the case k B (E, A) =. 8

9 Remark 3.12 (Shift and exponential stability). Proposition 3.11 yields that any (E, A) C(R + ; R n n ) 2 satisfies: α R : k B (E, A + αe) = k B (E, A) + α. If k B (E, A) <, then one may obtain, via a shift α < k B (E, A), that k B (E, A + αe) < and therefore, due to Theorem 3.9, system (E, A + αe) is essentially exponentially stable in the sense of Theorem 3.9(ii). With this in mind one can say that the DAE has been stabilized. Now we consider a time-varying coordinate transformation z(t) = T (t) 1 x(t), where T C 1 (R + ; Gl n (R)). To this end we recall the definition of equivalence of two linear DAEs (E 1, A 1 ) and (E 2, A 2 ); see [34, Def. 3.3]. Definition 3.13 (Equivalence of DAEs). The DAEs (E 1, A 1 ), (E 2, A 2 ) C((τ, ); R n n ) 2 are called equivalent if, and only if, there exists (S, T ) C((τ, ); Gl n (R)) C 1 ((τ, ); Gl n (R)) such that E 2 = SE 1 T, A 2 = SA 1 T SE 1 T ; we write (E 1, A 1 ) S,T (E 2, A 2 ). (3.1) We introduce Lyapunov transformation (see for example [48, Def. 6.14] for ODEs) and Bohl transformation (see for example [31, Def ] for ODEs) on the set of all initial values (t, x) for which (E, A) has a right global solution: G(E, A) := { (t, x) R + R n G E,A (t, x) }. We stress that we consider Lyapunov and Bohl transformations on G(E, A), not on R + R n. The reason is that the set G(E, A)(t) := { x R n (t, x) G(E, A) }, t >, is a linear subspace of R n and if x : (α, ) R n is a right global solution of (E, A), then x(t) G(E, A)(t) for all t > α. Roughly speaking, the (hidden) algebraic constraints in the DAE cause the dynamics of the system to take place on G(E, A). As seen in [6], the sets G(E, A) and G(E, A)(t) are fundamental for the investigation of stability properties of DAEs (E, A). For ODEs (I, A), clearly G(I, A)(t) = R n for all t R +. Definition 3.14 (Lyapunov and Bohl transformation). Let (E, A) C(R + ; R n n ) 2. Then T C 1 (R + ; Gl n (R)) is called a Lyapunov transformation on G(E, A) if, and only if, l 1, l 2 > (t, x) G(E, A) : l 1 x T (t) 1 x l 2 x. (3.11) T C 1 (R + ; Gl n (R)) is called a Bohl transformation on G(E, A) if, and only if, { inf ε > M ε > t, s R + x G(E, A)(s) z T (t) 1 G(E, A)(t) : T (s) 1 x T (t)z M ε e ε t s x z } =. (3.12) Remark 3.15 (Criterion for Bohl transformation). Note that the definition of Bohl transformation on G(E, A), (E, A) C(R + ; R n n ) 2, differs from the definition of a Bohl transformation in the ODE case, see [31, Def ]. The difference is that in condition (3.12) we take the infimum over all ε > in contrast to that for ODEs (see [31, Def ]) the infimum is taken over all ε R. So, an alternative to condition (3.12) could be { inf ε R M ε > t, s R + x G(E, A)(s) z T (t) 1 } G(E, A)(t) : T (s) 1 x T (t)z M ε e ε t s =. (3.13) x z 9

10 If (E, A) is an ODE, then G(E, A) = R + R n and it is easily seen that conditions (3.12) and (3.13) are equivalent. But for DAEs it may be that the infimum in (3.13) is, due to the restriction to the set G(E, A). For instance, consider (E, A) = (, I). Then G(, I)(t) = {} for all t R + and any state space transformation T C 1 (R + ; Gl n (R)) would transform the system = x into = z and hence preserve all properties (in particular the Bohl exponent), but T does not satisfy condition (3.13) since the infimum equals ; in fact T satisfies (3.12). Remark 3.16 (Lyapunov and Bohl transformation). Let (E, A) C(R + ; R n n ) 2. (i) If (E, A) is an ODE, then G(E, A) = R + R n and T C 1 (R + ; Gl n (R)) is a Lyapunov transformation on G(E, A) if, and only if, T and T 1 are bounded. (ii) Neither the Lyapunov nor the Bohl transformation on G(E, A) form a group with respect to pointwise multiplication, since, for instance, the product of two Lyapunov transformations on G(E, A) is not necessarily a Lyapunov transformation on G(E, A). This is due to the restriction to the set G(E, A). However, the following holds true: If (E, A) S,T (Ẽ, Ã) for some S C(R + ; Gl n (R)), T C 1 (R + ; Gl n (R)), T is a Lyapunov (Bohl) transformation on G(E, A), and T C 1 (R + ; Gl n (R)) is a Lyapunov (Bohl) transformation on G(Ẽ, Ã), then T T is a Lyapunov (Bohl) transformation on G(E, A). Concerning Lyapunov transformation this is easily verified. For Bohl transformation this needs a proof: Let ε >. Then there exist M, N > such that t, s R + x G(E, A)(s) z T (t) 1 G(E, A)(t) : T (s) 1 x T (t)z Me ε 2 t s x z, (3.14) t, s R + x G(Ẽ, Ã)(s) z T 1 (t) G(Ẽ, Ã)(t) : T (s) 1 x T (t)z Ne ε 2 t s x z. (3.15) Invoking that G(Ẽ, Ã)(t) = T (t) 1 G(E, A)(t) for all t R +, we have, for all t, s R + and for all x G(E, A)(s), z (T (t) T (t)) 1 G(E, A)(t): T (s) 1 T (s) 1 x T (t) T (t)z T (t)z T (s) 1 x (3.14),(3.15) MNe ε t s T (s) 1 x z x T (t)z. If T (s) 1 x =, then T (s) 1 T (s) 1 x = and if T (t)z =, then T (t) T (t)z =. If both are unequal to zero we may divide by their norms. In each case we obtain that T (s) 1 T (s) 1 x T (t) T (t)z MNe ε t s x z, whence T T is a Bohl transformation on G(E, A). (iii) Any Lyapunov transformation on G(E, A) is a Bohl transformation on G(E, A). This is easily seen by invoking that (3.11) is equivalent to l 1, l 2 > t R + z T (t) 1 G(E, A)(t) : l 1 2 and, for all ε >, t, s R +, x G(E, A)(s) and z T (t) 1 G(E, A)(t), T (s) 1 x T (t)z (3.11),(3.16) z T (t)z l 1 z, (3.16) l 2 l 1 x z l 2 l 1 e ε t s x z. 1 1

11 (iv) There exist Bohl transformations on G(E, A) which are not Lyapunov transformations on G(E, A). Consider for example, for any ODE (I, A) and n = 1, the state space transformation T : R + R +, t t + 1. Then, for any ε > and t, s R +, t + 1 s + 1 = t s { t s + 1 ε (ε t s + ε) 1 ε (ε t s + 1) 1 ε eε t s, < ε 1 s + 1 e t s e ε t s, ε > 1 and hence T is a Bohl transformation on G(I, A) = R + R, but obviously not a Lyapunov transformation. If (E, A) is transferable into standard canonical form [7, 15], then in [6, Prop. 4.1] it is shown that Lyapunov transformations on G(E, A) preserve the properties of stability, attractivity and asymptotic stability of a DAE. The next proposition shows that the Bohl exponent, and therefore the property of essential exponential stability, is preserved under the larger set of Bohl transformation on G(E, A). Proposition 3.17 (Bohl exponent is preserved under Bohl transformation). C(R + ; R n n ) 2. If Consider (E, A) (E, A) S,T (Ẽ, Ã) for some S C(R + ; Gl n (R)), T C 1 (R + ; Gl n (R)) and T is a Bohl transformation on G(E, A), then k B (E, A) = k B (Ẽ, Ã). Proof: First observe that G(Ẽ, Ã)(t) = T (t) 1 G(E, A)(t) for all t R +. Hence T 1 is a Bohl transformation on G(Ẽ, Ã) and therefore it is sufficient to show that k B(E, A) k B (Ẽ, Ã). Case 1 : k B (Ẽ, Ã) =. Then clearly k B(E, A) k B (Ẽ, Ã). Case 2 : k B (Ẽ, Ã) <. Let ρ > kb(ẽ, Ã) and ε >. Then there exists N ρ > such that right global sln. z : (α, ) R n of (Ẽ, Ã) and t s > α : z(t) N ρe ρ(t s) z(s), (3.17) and there exists M ε > such that t, s R + x G(E, A)(s) z T (t) 1 G(E, A)(t) : T (s) 1 x T (t)z M ε e ε t s x z. (3.18) Let x : (α, ) R n be a right global solution of (E, A) and t s > α. Then z := T 1 x : (α, ) R n is a right global solution of (Ẽ, Ã) and x(t) z(s) = T (t)z(t) T (s) 1 x(s) (3.18) M ε e ε(t s) x(s) z(t) (3.17) M ε N ρ e (ε+ρ)(t s) x(s) z(s). (3.19) If z(s) = then, invoking (3.18), x(t) = x(s) = z(t) =. If z(s) we may divide both sides of the inequality (3.19) by z(s). We obtain, for t s > α, x(t) M ε N ρ e (ε+ρ)(t s) x(s). This gives k B (E, A) k B (Ẽ, Ã) and completes the proof. 11

12 4 DAEs which possess a transition matrix In this section we introduce a subclass of DAEs (E, A) which will be of special interest in due course, especially for robustness analysis. This is the set of all DAEs (E, A) for which, loosely speaking, any consistent initial value problem has a unique solution and there exists a transition matrix for the system. Definition 4.1 (DAEs which possess a transition matrix). We say that the DAE (E, A) C 2 (R + ; R n n ) possesses a transition matrix U : R + R + R n n if, and only if, uniqueness holds, i.e., (t, x ) V E,A sln. x 1, x 2 S E,A (t, x ) : x 1 dom x1 dom x 2 = x 2 dom x1 dom x 2, (4.1) and t R + : U(t, ), U(, t) C 1 (R + ; R n n ), t, s R +, t s : E(t) d dtu(t, s) = A(t)U(t, s), t, s, r R + : U(t, s)u(s, r) = U(s, r), t, s R + : im U(t, s) V E,A (t) and im U(t, t) = V E,A (t). (4.2) Example 4.2. We revisit Example 3.5. From (3.7) we may easily observe that [ U : R + R + R 2 2 e, (t, s) (t s) ] e (t s) sin t is a good candidate for the transition matrix of system (3.6). Indeed, uniqueness (4.1) holds true and we have V E,A (t) = im [1, sin t]. Then it is easy to verify that the conditions of (4.2) hold, and hence we have proved that (3.6) possesses a transition matrix. There are several immediate consequences for the transition matrix from Definition 4.1. Corollary 4.3 (Properties of the transition matrix). Let (E, A) C(R + ; R n n ) 2 possess a transition matrix U(, ). Then the following holds true for all t R + : (i) U(t, t) 2 = U(t, t), (ii) x V E,A (t) : U(t, t)x = x, (iii) x V E,A (t) x( ) S E,A (t, x ) s dom x : x(s) = U(s, t)x. In particular, the large class of DAEs which are sufficiently smooth and satisfy [34, Hypothesis 3.48] is a subclass of DAEs which possess a transition matrix. Uniqueness of the solution of the consistent initial value problem is shown in [34, Thm. 3.52] and the existence of a transition matrix with the respective properties is shown in [35, Sec. 3.1]. Therefore, also any DAE which is analytically solvable, has a well-defined differentiation index or is transferable into standard canonical form satisfies Definition 4.1, see [34, 15, 7]. However, there are DAEs which are in none of these classes but still possess a transition matrix. To this end consider [7, Ex. 4.3] with I = R +. Then the homogeneous system (E, A) has only the trivial solution and hence Definition 4.1 is trivially satisfied. However, the system is not analytically solvable (and therefore does not satisfy [34, Hypothesis 3.48]) since e.g. for f(t) = t the inhomogeneous equation has no global solution (there is a pole at t = 1 as the solution formula clearly indicates). In particular, this shows that the existence of a transition matrix does not guarantee that variation of constants does work, since the solution formula in [7, Ex. 4.3] shows that only for a small class of 12

13 inhomogeneities there exists a global solution. Variation of constants is only known to work always in the case of systems transferable into standard canonical form [7, Thm. 3.9]. Although there is no variation of constants formula for DAEs which possess a transition matrix, there is a class of inhomogeneities for which the solutions can be represented via an integral equation. In a way one has to find the appropriate set of inhomogeneities to make variations of constants feasible. In fact the inhomogeneities in this case may also depend on x and ẋ. In subsequent sections this will be used for robustness analysis. We allow for inhomogeneities g as follows: Let Π C(R + ; R n n ) be such that im Π(t) = V E,A (t) for all t R +. For instance, t U(t, t) satisfies this condition. Then, for any g C(R + R n R n ; R n ), we consider the perturbed DAE E(t)ẋ = A(t)x + E(t)Π(t)g(t, x(t), ẋ(t)). (4.3) Of course, without any further assumption, the solutions of (4.3) may have a singular behavior as discussed in [6, Sec. 2], even if (E, A) has a regular behavior, such as existence and uniqueness of solutions. EΠg is a structured term and ensures that the algebraic part of the DAE (E, A) is not effected by the perturbation, which is important in due course. It is thus possible to obtain a representation of the solutions of (4.3) using the transition matrix of (E, A). The following lemma shows that x solves (4.3) if, and only if, it solves a certain integral equation involving the transition matrix of (E, A). Lemma 4.4 (Integral equation). Let (E, A) C(R + ; R n n ) 2 possess a transition matrix U(, ), choose Π C(R + ; R n n ) such that im Π(t) = V E,A (t) for all t R + and let g C(R + R n R n ; R n ). Then x : (α, ) R n, α, is a right global solution of (4.3) if, and only if, x( ) satisfies the integral equation x(t) = U(t, t )x(t ) + U(t, s)π(s)g(s, x(s), ẋ(s)) ds, t, t > α. t Proof: : Fix t > α and consider the functions Then, for all t > α, ϕ : (α, ) R n, t x(t) t U(t, s)π(s)g(s, x(s), ẋ(s)) ds, ψ : (α, ) R n, t U(t, t )x(t ). E(t) ϕ(t) = E(t)ẋ(t) E(t) d t dtu(t, s)π(s)g(s, x(s), ẋ(s)) ds E(t)U(t, t)π(t)g(t, x(t), ẋ(t)) Def. 4.1 = A(t)x(t)+E(t)Π(t)g(t, x(t), ẋ(t)) A(t) Cor. 4.3 t U(t, s)π(s)g(s, x(s), ẋ(s)) ds E(t)Π(t)g(t, x(t), ẋ(t)) = A(t)ϕ(t), thus ϕ and ψ are both right global solutions of (E, A). Therefore, x(t ) = ϕ(t ) V E,A (t ) and Corollary 4.3 gives ψ(t ) = U(t, t )x(t ) = x(t ) = ϕ(t ). Hence ϕ and ψ are both right global solutions of the initial value problem E(t)ż = A(t)z, z(t ) = x(t ) V E,A (t ), 13

14 whence (4.1) yields ϕ = ψ. : For fixed t > α differentiation immediately gives, for all t > α, E(t)ẋ(t) = E(t) d dt U(t, t )x(t ) + = A(t)U(t, t )x(t ) + A(t) E(t) d t dtu(t, s)π(s)g(s, x(s), ẋ(s)) ds + E(t)U(t, t)π(t)g(t, x(t), ẋ(t)) t U(t, s)π(s)g(s, x(s), ẋ(s)) ds + E(t)Π(t)g(t, x(t), ẋ(t)) = A(t)x(t) + E(t)Π(t)g(t, x(t), ẋ(t)). We show next that the time-varying subspace V E,A (t) of a DAE (E, A) which possesses a transition matrix does not have jumps in its dimension. Corollary 4.5 (V E,A (t) has constant dimension). Let (E, A) C(R + ; R n n ) 2 possess a transition matrix U(, ). Then there exists k {, 1,..., n} such that dim V E,A (t) = k for all t R +. Proof: Fix s R + and set k := dim V E,A (s). We distinguish two cases. Case 1 : k =. Then U(s, s) = and hence U(t, t) (4.2) = U(t, s)u(s, s)u(s, t) = which gives dim V E,A (t) = for all t R +. Case 2 : k 1. Let ϕ 1,..., ϕ k V E,A (s) be linearly independent. Then, for i {1,..., k}, t U(t, s)ϕ i solves (E, A) due to (4.2) and hence U(t, s)ϕ i V E,A (t) for all t R +. Now fix t R +. In order to show that U(t, s)ϕ 1,..., U(t, s)ϕ k are linearly independent let c 1 U(t, s)ϕ c k U(t, s)ϕ k = for some c 1,..., c k R. Therefore, U(t, s)y = for y := c 1 ϕ c k ϕ k V E,A (s) and hence y = U(s, s)y = U(s, t)u(t, s)y =, which gives, by linear independency of ϕ 1,..., ϕ k, that c 1 =... = c k =. This proves that dim V E,A (s) dim V E,A (t) and equality follows since s and t were fixed but arbitrary. It remains an open problem as to whether, for the class of DAEs which possess a transition matrix, (4.2) in Definition 4.1 does already imply uniqueness (4.1). Moreover, the integral equation developed in Lemma 4.4 should be further investigated, especially regarding existence and uniqueness of solutions. 5 Bohl exponent for DAEs which possess a transition matrix In this section we consider the Bohl exponent for the class of DAEs which possess a transition matrix as introduced in the previous section. We revisit some results of Section 3, especially concerning exponential stability, for this class in Subsection 5.1, state a relationship between solutions of a Cauchy problem and negative Bohl exponent in Subsection 5.2, and then derive a robustness result for the Bohl exponent in Subsection 5.3. In particular, we state our two main results in this section: Theorem 5.5, which shows that the Bohl exponent is negative if, and only if, the Cauchy problem (5.6) has a bounded solution whenever the inhomogeneity is in class (5.7), and Theorem 5.7, which characterizes the behaviour of the Bohl exponent under structured perturbations. 14

15 5.1 Exponential stability It is immediate from Definition 4.1 and Corollary 4.3, that the Bohl exponent of a DAE (E, A) C(R + ; R n n ) 2 which possesses a transition matrix U(, ) has the following representation: { } k B (E, A) = inf ρ R N ρ > t s > x V E,A (s) : U(t, s)x N ρ e ρ(t s) x. (5.1) Remark 5.1 (Time-invariant linear DAEs). We give a complete characterization of the Bohl exponent of time-invariant linear DAEs (E, A) (R n n ) 2. To this end we distinguish the cases that either (E, A) is regular, i.e., det(se A), or not. Case 1 : (E, A) is regular. In this case we can find invertible matrices S, T R n n which transform (E, A) into quasi-weierstraß form [8] ([ ] [ ]) I J (SET, SAT ) =,, N I where J is some matrix and N is nilpotent. Note that it is not sufficient to consider the Weierstraß canonical form as in [34, Thm. 2.7], since we require the matrices J, S, T to be real-valued. Now it follows [8] that (E, A) possesses a transition matrix (t, s) U(t, s) = T Then formula (5.1) and some simple calculations yield that [ ] e J(t s) T 1. k B (E, A) = max { Re λ λ σ(j) } = max { Re λ det(λe A) = }. This result was already mentioned in [16, Rem. 4.2], but without proof. Case 2 : (E, A) is not regular. In this case (E, A) does not possess a transition matrix since the uniqueness property (4.1) is violated, see [34, Thm. 2.14]. We have det(λe A) = for all λ C and therefore, given any λ R, we find x λ R n \ {} such that (λe A)x λ =. Hence, t e λt x λ solves the DAE (E, A) for all λ R, which shows that (E, A) cannot have a finite Bohl exponent, i.e., we obtain k B (E, A) =. In order to extend Theorem 3.9 to DAEs which possess a transition matrix in such a way that a negative Bohl exponent is equivalent to exponential stability we first need a characterization of exponential stability for this class of DAEs. An immediate characterization, due to Definition 4.1 and Corollary 4.3, is the following: A DAE (E, A) C(R + ; R n n ) 2 which possesses a transition matrix U(, ) is exponentially stable if, and only if, µ, M > (t, x ) V E,A t t : U(t, t )x M e µ(t t) x. (5.2) The proof of this equivalence uses arguments similar to the ones used in Proposition 5.2; we omit it. Note that in particular equations (5.1) and (5.2) show that a DAE (E, A) which possesses a transition matrix is exponentially stable if, and only if, k B (E, A) <. We may also obtain a characterization via replacing x in (5.2) by Π(t ), where Π is continuous and bounded and Π(t ) is a projector on V E,A (t ). 15

16 Proposition 5.2 (Exponential stability of DAEs which possess a transition matrix). Let (E, A) C(R + ; R n n ) 2 possess a transition matrix U(, ) and choose Π C(R + ; R n n ) such that im Π(t) = V E,A (t) and Π(t) 2 = Π(t) for all t R +. Furthermore, suppose Π is bounded. Then (E, A) is exponentially stable if, and only if, there exist µ, M > such that for all t t it holds U(t, t )Π(t ) Me µ(t t). Proof: : Let t R + and note that Corollary 4.3(iii) implies that any right maximal solution of (E, A) is right global. Thus by Definition 2.2 we have µ, M > δ = δ(t ) > x B δ () V E,A (t ) t t : U(t, t )x Me µ(t t) x. (5.3) Now let i {1,..., n}. If Π(t )e i, then we have U(t, t ) δπ(t )e i 2 Π(t )e i ) δπ(t )e i Me µ(t t 2 Π(t )e i for all t t and hence U(t, t )Π(t )e i Me µ(t t ) Π(t )e i Me µ(t t ) Π(t ), t t. If Π(t )e i = the latter inequality trivially holds, hence it is true for all i {1,..., n}. Using equivalence of norms and boundedness of Π the claim finally follows from some simple calculations. : Let t >. We show that (5.3) holds. Choose δ = 1 and let x B δ () V E,A (t ). Since Π(t ) is idempotent we find that Π(t )x = x, hence, for all t t, U(t, t )x = U(t, t )Π(t )x U(t, t )Π(t ) x Ass. Me µ(t t) x. This proves the assertion. It is clear that the assumption of boundedness of Π in Proposition 5.2 is crucial, since otherwise one may easily construct a counterexample. The assumption of Π being idempotent, i.e., Π(t) 2 = Π(t) for all t R +, however may possibly be relaxed. Whereas, having the transition matrix U(, ) of the DAE (E, A), one may define { U(t, t), U(t, t) 1 Π : R + R n n, t U(t,t) U(t,t),, U(t, t) > 1 which satisfies all assumptions. Therefore, if ever boundedness or idempotency of Π is required, this is no great restriction in the free choice of Π. We are now in the position to state a simplified version of Theorem 3.9 for DAEs which possess a transition matrix. To this end we use the bounded projector Π and therefore it is clear that the following corollary is a direct generalization of [31, Thm ] to DAEs which possess a transition matrix, since in the case E = I we would have Π = I and U(, ) would be the transition matrix of the ODE (I, A). Corollary 5.3 (Theorem 3.9 revisited). Let (E, A) C(R + ; R n n ) 2 possess a transition matrix U(, ) and choose Π C(R + ; R n n ) such that im Π(t) = V E,A (t) and Π(t) 2 = Π(t) for all t R +. Furthermore, suppose Π is bounded and k B (E, A) <. Then the following statements are equivalent. 16

17 (i) k B (E, A) <. (ii) (E, A) is exponentially stable. (iii) For all p R + there exists c > such that for all t R + it holds t U(t, t )Π(t ) p dt c. Proof: (i) (ii): Follows directly from equations (5.1) and (5.2). (i) (iii): By Theorem 3.9 and Corollary 4.3 it follows that k B (E, A) < if, and only if, for all p R + there exists c > such that for all (t, x ) V E,A it holds t U(t, t )x p dt c x p. Now using the same arguments as in the proof of Proposition 5.2 yields the assertion. Note that the matrix-valued function Π is not needed for the equivalence of (i) and (ii) in Corollary Cauchy problem In the following we consider Cauchy problems corresponding to the DAE (E, A). In particular, we derive the result that, loosely speaking, the Bohl exponent of (E, A) is negative if, and only if, the Cauchy problem for a special class of bounded inhomogeneities has a bounded solution. For ODEs this is well-known [19, Thm. 5.2] and the class of inhomogeneities is just the set of all bounded continuous functions. However, for DAEs the situation is more subtle, since solutions do not necessarily exist for arbitrary inhomogeneities and variation of constants is, as explained in Section 4, in general not feasible. So one has to find the correct class of inhomogeneities in order to generalize [19, Thm. 5.2] to DAEs. We call a continuously differentiable function x : (, ω) R n, ω >, a solution of the Cauchy problem E(t)ẋ = A(t)x + f(t), x(+) = x, (5.4) where f C(R + ; R n ), if, and only if, x satisfies E(t)ẋ(t) = A(t)x(t) + f(t) for all t (, ω) and x(+) = x. In Section 4 we have seen that inhomogeneities of the form EΠf, where Π C(R + ; R n n ) is such that im Π(t) = V E,A (t) for all t R +, are the correct concept when it comes to DAEs (E, A) which possess a transition matrix U(, ). In Theorem 5.5 we show that the Cauchy problem corresponding to the inhomogeneity EΠf has a bounded solution whenever Πf is bounded if, and only if, k B (E, A) <. This equivalence justifies the consideration of the special perturbations EΠg as in (4.3). In the following lemma we show that the Cauchy problem has a unique global solution for inhomogeneities f as described above. However, we require the additional technical assumption that the limits (Πf)(+) and U(t, +) exist for all t R +. Lemma 5.4 (Unique solution to the Cauchy problem). Let (E, A) C(R + ; R n n ) 2 possess a transition matrix U(, ) and choose Π C(R + ; R n n ) such that im Π(t) = V E,A (t) for all t R +. Then, for any t R + and f C(R + ; R n ), all right global solutions x( ) of the initial value problem E(t)ẋ = A(t)x + E(t)Π(t)f(t), x(t ) =, (5.5) 17

18 satisfy x(t) = t U(t, s)π(s)f(s) ds. for all t t. If additionally U(t, +) exists for all t R +, then, for any f C(R + ; R n ) such that (Πf)(+) exists, the Cauchy problem has the unique global solution E(t)ẋ = A(t)x + E(t)Π(t)f(t), x(+) =, (5.6) x : R + R n, t U(t, s)π(s)f(s) ds. Proof: Let t R + and f C(R + ; R n ). Since (E, A) possesses a transition matrix U(, ) we may apply Lemma 4.4 to conclude that any right global solution x : (α, ) R n of (5.5), α < t, has the representation x(t) = U(t, t )x(t ) + U(t, s)π(s)f(s) ds, t > α, t which, in view of x(t ) =, proves the first claim. Considering the Cauchy problem (5.6) we find that, due to Lemma 4.4, any right global solution x : (, ) R n of (5.6) has the representation x(t) = U(t, t )x(t ) + U(t, s)π(s)f(s) ds, t t, t >. Since lim t x(t ) = x(+) = and the limits U(t, +), (Πf)(+) exist for all t R +, we may take the limit for t and obtain x(t) = U(t, s)π(s)f(s) ds, t >. On the other hand, simple calculations show that this is indeed a solution of (5.6), hence the lemma is proved. In view of Lemma 5.4 we collect all functions f such that (5.6) has a unique global solution: F Π := { f C(R + ; R n ) Πf is bounded and (Πf)(+) = }. (5.7) Even for ODEs the result [19, Thm. 5.2] does not hold without further assumptions: the usual assumption is integral boundedness of A, see e.g. [19, (5.9)]. However, a careful inspection of the proof of [19, Thm. 5.2] yields that this assumption can be weakened; we formulate it for DAEs which possess a transition matrix U(, ): M > t R + t [t, t + 1] : U(t, t )Π(t ) M. (5.8) The following theorem is the generalization of [19, Thm. 5.2] to DAEs (E, A) which possess a transition matrix. Roughly speaking, it states that a negative Bohl exponent is equivalent to the fact that the solution of the Cauchy problem (5.6) is bounded for every f F Π. Although the main idea of the proof is as in [19] it is more subtle. 18

19 Theorem 5.5 (Cauchy problem). Let (E, A) C(R + ; R n n ) 2 possess a transition matrix U(, ) and choose Π C(R + ; R n n ) such that im Π(t) = V E,A (t) and Π(t) 2 = Π(t) for all t R +. Suppose that condition (5.8) holds and U(t, +) exists for all t R +. Then the unique global solution of the Cauchy problem (5.6) is bounded for every f F Π if, and only if, k B (E, A) <. Proof: : Let f F Π. Since (E, A) possesses a transition matrix U(, ) we may apply Lemma 5.4 to conclude that the unique global solution x : (, ) R n of the Cauchy problem (5.6) has the representation Taking norms gives x(t) = x(t) U(t, s)π(s)f(s) ds, t >. (5.9) U(t, s)π(s)f(s) ds, t >. (5.1) Since k B (E, A) < there exist ρ, N ρ > such that (E, A) has property B(ρ, N ρ ) and invoking Π(s)f(s) V E,A (s) gives that t U(t, s)π(s)f(s) solves (E, A) for all s R +. Therefore, U(t, s)π(s)f(s) N ρ e ρ(t s) Π(s)f(s) for all t, s R +. This inequality together with (5.1) implies x(t) : Step 1 : We show that N ρ e ρ(t s) Π(s)f(s) ds Πf N ρ ρ, t R +. V := { g C(R + ; R n ) g is bounded and there exists f C(R + ; R n ) such that g = Πf } is a Banach space. Clearly, V is a linear subspace of the Banach space (B, ), where B = { g C(R + ; R n ) g is bounded }. We show that V is a closed subspace of B. To see this consider the following: for any convergent sequence g k g in V there exist f k C(R + ; R n ), k N, such that g k = Πf k and since Πf k g we also have pointwise convergence, i.e.,π(t)f k (t) g(t) for all t R +. This clearly gives g(t) im Π(t) and hence g(t) = Π(t)g(t) since Π(t) is idempotent. But this means g V and therefore V is closed. Hence we have that (V, ) is a Banach space. Step 2 : We show that, for all t R +, is a bounded linear operator and satisfies K t : V R n, g U(t, s)g(s) ds K > g V t R + : K t (g) K g. (5.11) Fix t R +. K t is bounded since, for all g V, U(t, s)g(s) ds U(t, s) ds g }{{} =:M t and the continuity of s U(t, s) on the compact set [, t] implies M t <. Now, for any g V, there exists f C(R + ; R n ) such that g = Πf and since g is bounded, the Cauchy problem (5.6) corresponding 19

On perturbations in the leading coefficient matrix of time-varying index-1 DAEs

On perturbations in the leading coefficient matrix of time-varying index-1 DAEs On perturbations in the leading coefficient matrix of time-varying index-1 DAEs Institute of Mathematics, Ilmenau University of Technology Darmstadt, March 27, 2012 Institute of Mathematics, Ilmenau University

More information

LINEAR-QUADRATIC OPTIMAL CONTROL OF DIFFERENTIAL-ALGEBRAIC SYSTEMS: THE INFINITE TIME HORIZON PROBLEM WITH ZERO TERMINAL STATE

LINEAR-QUADRATIC OPTIMAL CONTROL OF DIFFERENTIAL-ALGEBRAIC SYSTEMS: THE INFINITE TIME HORIZON PROBLEM WITH ZERO TERMINAL STATE LINEAR-QUADRATIC OPTIMAL CONTROL OF DIFFERENTIAL-ALGEBRAIC SYSTEMS: THE INFINITE TIME HORIZON PROBLEM WITH ZERO TERMINAL STATE TIMO REIS AND MATTHIAS VOIGT, Abstract. In this work we revisit the linear-quadratic

More information

1 The Observability Canonical Form

1 The Observability Canonical Form NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)

More information

Chapter III. Stability of Linear Systems

Chapter III. Stability of Linear Systems 1 Chapter III Stability of Linear Systems 1. Stability and state transition matrix 2. Time-varying (non-autonomous) systems 3. Time-invariant systems 1 STABILITY AND STATE TRANSITION MATRIX 2 In this chapter,

More information

LMI Methods in Optimal and Robust Control

LMI Methods in Optimal and Robust Control LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear

More information

56 4 Integration against rough paths

56 4 Integration against rough paths 56 4 Integration against rough paths comes to the definition of a rough integral we typically take W = LV, W ; although other choices can be useful see e.g. remark 4.11. In the context of rough differential

More information

Stability analysis of differential algebraic systems

Stability analysis of differential algebraic systems Stability analysis of differential algebraic systems Volker Mehrmann TU Berlin, Institut für Mathematik with Vu Hoang Linh and Erik Van Vleck DFG Research Center MATHEON Mathematics for key technologies

More information

Exponential stability of families of linear delay systems

Exponential stability of families of linear delay systems Exponential stability of families of linear delay systems F. Wirth Zentrum für Technomathematik Universität Bremen 28334 Bremen, Germany fabian@math.uni-bremen.de Keywords: Abstract Stability, delay systems,

More information

NOTES ON LINEAR ODES

NOTES ON LINEAR ODES NOTES ON LINEAR ODES JONATHAN LUK We can now use all the discussions we had on linear algebra to study linear ODEs Most of this material appears in the textbook in 21, 22, 23, 26 As always, this is a preliminary

More information

1 Lyapunov theory of stability

1 Lyapunov theory of stability M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability

More information

An introduction to Mathematical Theory of Control

An introduction to Mathematical Theory of Control An introduction to Mathematical Theory of Control Vasile Staicu University of Aveiro UNICA, May 2018 Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May 2018

More information

8 Periodic Linear Di erential Equations - Floquet Theory

8 Periodic Linear Di erential Equations - Floquet Theory 8 Periodic Linear Di erential Equations - Floquet Theory The general theory of time varying linear di erential equations _x(t) = A(t)x(t) is still amazingly incomplete. Only for certain classes of functions

More information

TOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS

TOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS TOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS ALEX HUMMELS Abstract. This paper proves a theorem that gives conditions for the topological equivalence of linear ordinary differential

More information

16. Local theory of regular singular points and applications

16. Local theory of regular singular points and applications 16. Local theory of regular singular points and applications 265 16. Local theory of regular singular points and applications In this section we consider linear systems defined by the germs of meromorphic

More information

Convergence Rate of Nonlinear Switched Systems

Convergence Rate of Nonlinear Switched Systems Convergence Rate of Nonlinear Switched Systems Philippe JOUAN and Saïd NACIRI arxiv:1511.01737v1 [math.oc] 5 Nov 2015 January 23, 2018 Abstract This paper is concerned with the convergence rate of the

More information

Putzer s Algorithm. Norman Lebovitz. September 8, 2016

Putzer s Algorithm. Norman Lebovitz. September 8, 2016 Putzer s Algorithm Norman Lebovitz September 8, 2016 1 Putzer s algorithm The differential equation dx = Ax, (1) dt where A is an n n matrix of constants, possesses the fundamental matrix solution exp(at),

More information

Lecture 4. Chapter 4: Lyapunov Stability. Eugenio Schuster. Mechanical Engineering and Mechanics Lehigh University.

Lecture 4. Chapter 4: Lyapunov Stability. Eugenio Schuster. Mechanical Engineering and Mechanics Lehigh University. Lecture 4 Chapter 4: Lyapunov Stability Eugenio Schuster schuster@lehigh.edu Mechanical Engineering and Mechanics Lehigh University Lecture 4 p. 1/86 Autonomous Systems Consider the autonomous system ẋ

More information

Impulse free solutions for switched differential algebraic equations

Impulse free solutions for switched differential algebraic equations Impulse free solutions for switched differential algebraic equations Stephan Trenn Institute of Mathematics, Ilmenau University of Technology, Weimerarer Str. 25, 98693 Ilmenau, Germany Abstract Linear

More information

Stability theory is a fundamental topic in mathematics and engineering, that include every

Stability theory is a fundamental topic in mathematics and engineering, that include every Stability Theory Stability theory is a fundamental topic in mathematics and engineering, that include every branches of control theory. For a control system, the least requirement is that the system is

More information

Convexity of the Reachable Set of Nonlinear Systems under L 2 Bounded Controls

Convexity of the Reachable Set of Nonlinear Systems under L 2 Bounded Controls 1 1 Convexity of the Reachable Set of Nonlinear Systems under L 2 Bounded Controls B.T.Polyak Institute for Control Science, Moscow, Russia e-mail boris@ipu.rssi.ru Abstract Recently [1, 2] the new convexity

More information

Math Ordinary Differential Equations

Math Ordinary Differential Equations Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x

More information

Nonlinear Control Systems

Nonlinear Control Systems Nonlinear Control Systems António Pedro Aguiar pedro@isr.ist.utl.pt 3. Fundamental properties IST-DEEC PhD Course http://users.isr.ist.utl.pt/%7epedro/ncs2012/ 2012 1 Example Consider the system ẋ = f

More information

Introduction to Nonlinear Control Lecture # 3 Time-Varying and Perturbed Systems

Introduction to Nonlinear Control Lecture # 3 Time-Varying and Perturbed Systems p. 1/5 Introduction to Nonlinear Control Lecture # 3 Time-Varying and Perturbed Systems p. 2/5 Time-varying Systems ẋ = f(t, x) f(t, x) is piecewise continuous in t and locally Lipschitz in x for all t

More information

Empirical Processes: General Weak Convergence Theory

Empirical Processes: General Weak Convergence Theory Empirical Processes: General Weak Convergence Theory Moulinath Banerjee May 18, 2010 1 Extended Weak Convergence The lack of measurability of the empirical process with respect to the sigma-field generated

More information

NOTES ON CALCULUS OF VARIATIONS. September 13, 2012

NOTES ON CALCULUS OF VARIATIONS. September 13, 2012 NOTES ON CALCULUS OF VARIATIONS JON JOHNSEN September 13, 212 1. The basic problem In Calculus of Variations one is given a fixed C 2 -function F (t, x, u), where F is defined for t [, t 1 ] and x, u R,

More information

Nonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems. p. 1/1

Nonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems. p. 1/1 Nonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems p. 1/1 p. 2/1 Converse Lyapunov Theorem Exponential Stability Let x = 0 be an exponentially stable equilibrium

More information

Representations of moderate growth Paul Garrett 1. Constructing norms on groups

Representations of moderate growth Paul Garrett 1. Constructing norms on groups (December 31, 2004) Representations of moderate growth Paul Garrett Representations of reductive real Lie groups on Banach spaces, and on the smooth vectors in Banach space representations,

More information

Deterministic Dynamic Programming

Deterministic Dynamic Programming Deterministic Dynamic Programming 1 Value Function Consider the following optimal control problem in Mayer s form: V (t 0, x 0 ) = inf u U J(t 1, x(t 1 )) (1) subject to ẋ(t) = f(t, x(t), u(t)), x(t 0

More information

Part III. 10 Topological Space Basics. Topological Spaces

Part III. 10 Topological Space Basics. Topological Spaces Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.

More information

Observer design for a general class of triangular systems

Observer design for a general class of triangular systems 1st International Symposium on Mathematical Theory of Networks and Systems July 7-11, 014. Observer design for a general class of triangular systems Dimitris Boskos 1 John Tsinias Abstract The paper deals

More information

6 Linear Equation. 6.1 Equation with constant coefficients

6 Linear Equation. 6.1 Equation with constant coefficients 6 Linear Equation 6.1 Equation with constant coefficients Consider the equation ẋ = Ax, x R n. This equating has n independent solutions. If the eigenvalues are distinct then the solutions are c k e λ

More information

21 Linear State-Space Representations

21 Linear State-Space Representations ME 132, Spring 25, UC Berkeley, A Packard 187 21 Linear State-Space Representations First, let s describe the most general type of dynamic system that we will consider/encounter in this class Systems may

More information

(c) For each α R \ {0}, the mapping x αx is a homeomorphism of X.

(c) For each α R \ {0}, the mapping x αx is a homeomorphism of X. A short account of topological vector spaces Normed spaces, and especially Banach spaces, are basic ambient spaces in Infinite- Dimensional Analysis. However, there are situations in which it is necessary

More information

NECESSARY CONDITIONS FOR WEIGHTED POINTWISE HARDY INEQUALITIES

NECESSARY CONDITIONS FOR WEIGHTED POINTWISE HARDY INEQUALITIES NECESSARY CONDITIONS FOR WEIGHTED POINTWISE HARDY INEQUALITIES JUHA LEHRBÄCK Abstract. We establish necessary conditions for domains Ω R n which admit the pointwise (p, β)-hardy inequality u(x) Cd Ω(x)

More information

Balanced Truncation 1

Balanced Truncation 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Balanced Truncation This lecture introduces balanced truncation for LTI

More information

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces. Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,

More information

Banach Journal of Mathematical Analysis ISSN: (electronic)

Banach Journal of Mathematical Analysis ISSN: (electronic) Banach J. Math. Anal. 1 (2007), no. 1, 56 65 Banach Journal of Mathematical Analysis ISSN: 1735-8787 (electronic) http://www.math-analysis.org SOME REMARKS ON STABILITY AND SOLVABILITY OF LINEAR FUNCTIONAL

More information

1. The Transition Matrix (Hint: Recall that the solution to the linear equation ẋ = Ax + Bu is

1. The Transition Matrix (Hint: Recall that the solution to the linear equation ẋ = Ax + Bu is ECE 55, Fall 2007 Problem Set #4 Solution The Transition Matrix (Hint: Recall that the solution to the linear equation ẋ Ax + Bu is x(t) e A(t ) x( ) + e A(t τ) Bu(τ)dτ () This formula is extremely important

More information

7 Planar systems of linear ODE

7 Planar systems of linear ODE 7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution

More information

ANALYTIC SEMIGROUPS AND APPLICATIONS. 1. Introduction

ANALYTIC SEMIGROUPS AND APPLICATIONS. 1. Introduction ANALYTIC SEMIGROUPS AND APPLICATIONS KELLER VANDEBOGERT. Introduction Consider a Banach space X and let f : D X and u : G X, where D and G are real intervals. A is a bounded or unbounded linear operator

More information

Nonlinear Systems Theory

Nonlinear Systems Theory Nonlinear Systems Theory Matthew M. Peet Arizona State University Lecture 2: Nonlinear Systems Theory Overview Our next goal is to extend LMI s and optimization to nonlinear systems analysis. Today we

More information

Applied Math Qualifying Exam 11 October Instructions: Work 2 out of 3 problems in each of the 3 parts for a total of 6 problems.

Applied Math Qualifying Exam 11 October Instructions: Work 2 out of 3 problems in each of the 3 parts for a total of 6 problems. Printed Name: Signature: Applied Math Qualifying Exam 11 October 2014 Instructions: Work 2 out of 3 problems in each of the 3 parts for a total of 6 problems. 2 Part 1 (1) Let Ω be an open subset of R

More information

The goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T

The goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T 1 1 Linear Systems The goal of this chapter is to study linear systems of ordinary differential equations: ẋ = Ax, x(0) = x 0, (1) where x R n, A is an n n matrix and ẋ = dx ( dt = dx1 dt,..., dx ) T n.

More information

Existence and Uniqueness

Existence and Uniqueness Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect

More information

L2 gains and system approximation quality 1

L2 gains and system approximation quality 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 24: MODEL REDUCTION L2 gains and system approximation quality 1 This lecture discusses the utility

More information

Nonlinear Control Lecture 5: Stability Analysis II

Nonlinear Control Lecture 5: Stability Analysis II Nonlinear Control Lecture 5: Stability Analysis II Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2010 Farzaneh Abdollahi Nonlinear Control Lecture 5 1/41

More information

Solution via Laplace transform and matrix exponential

Solution via Laplace transform and matrix exponential EE263 Autumn 2015 S. Boyd and S. Lall Solution via Laplace transform and matrix exponential Laplace transform solving ẋ = Ax via Laplace transform state transition matrix matrix exponential qualitative

More information

Singularities and Laplacians in Boundary Value Problems for Nonlinear Ordinary Differential Equations

Singularities and Laplacians in Boundary Value Problems for Nonlinear Ordinary Differential Equations Singularities and Laplacians in Boundary Value Problems for Nonlinear Ordinary Differential Equations Irena Rachůnková, Svatoslav Staněk, Department of Mathematics, Palacký University, 779 OLOMOUC, Tomkova

More information

Lecture 4: Numerical solution of ordinary differential equations

Lecture 4: Numerical solution of ordinary differential equations Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor

More information

NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES

NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES JONATHAN LUK These notes discuss theorems on the existence, uniqueness and extension of solutions for ODEs. None of these results are original. The proofs

More information

Converse Lyapunov theorem and Input-to-State Stability

Converse Lyapunov theorem and Input-to-State Stability Converse Lyapunov theorem and Input-to-State Stability April 6, 2014 1 Converse Lyapunov theorem In the previous lecture, we have discussed few examples of nonlinear control systems and stability concepts

More information

Functional Analysis HW #3

Functional Analysis HW #3 Functional Analysis HW #3 Sangchul Lee October 26, 2015 1 Solutions Exercise 2.1. Let D = { f C([0, 1]) : f C([0, 1])} and define f d = f + f. Show that D is a Banach algebra and that the Gelfand transform

More information

Bare-bones outline of eigenvalue theory and the Jordan canonical form

Bare-bones outline of eigenvalue theory and the Jordan canonical form Bare-bones outline of eigenvalue theory and the Jordan canonical form April 3, 2007 N.B.: You should also consult the text/class notes for worked examples. Let F be a field, let V be a finite-dimensional

More information

Controllability of switched differential-algebraic equations

Controllability of switched differential-algebraic equations Controllability of switched differential-algebraic equations Ferdinand Küsters Markus G-M Ruppert Stephan Trenn Fachbereich Mathematik Technische Universität Kaiserslautern Postfach 349 67653 Kaiserslautern

More information

Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications

Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications L. Faybusovich T. Mouktonglang Department of Mathematics, University of Notre Dame, Notre Dame, IN

More information

Asymptotic Stability by Linearization

Asymptotic Stability by Linearization Dynamical Systems Prof. J. Rauch Asymptotic Stability by Linearization Summary. Sufficient and nearly sharp sufficient conditions for asymptotic stability of equiiibria of differential equations, fixed

More information

A brief introduction to ordinary differential equations

A brief introduction to ordinary differential equations Chapter 1 A brief introduction to ordinary differential equations 1.1 Introduction An ordinary differential equation (ode) is an equation that relates a function of one variable, y(t), with its derivative(s)

More information

An introduction to some aspects of functional analysis

An introduction to some aspects of functional analysis An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms

More information

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite

More information

Notions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy

Notions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

Problem List MATH 5143 Fall, 2013

Problem List MATH 5143 Fall, 2013 Problem List MATH 5143 Fall, 2013 On any problem you may use the result of any previous problem (even if you were not able to do it) and any information given in class up to the moment the problem was

More information

(Linear Programming program, Linear, Theorem on Alternative, Linear Programming duality)

(Linear Programming program, Linear, Theorem on Alternative, Linear Programming duality) Lecture 2 Theory of Linear Programming (Linear Programming program, Linear, Theorem on Alternative, Linear Programming duality) 2.1 Linear Programming: basic notions A Linear Programming (LP) program is

More information

NORMS ON SPACE OF MATRICES

NORMS ON SPACE OF MATRICES NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system

More information

Optimal control of nonstructured nonlinear descriptor systems

Optimal control of nonstructured nonlinear descriptor systems Optimal control of nonstructured nonlinear descriptor systems TU Berlin DFG Research Center Institut für Mathematik MATHEON Workshop Elgersburg 19.02.07 joint work with Peter Kunkel Overview Applications

More information

BIHARMONIC WAVE MAPS INTO SPHERES

BIHARMONIC WAVE MAPS INTO SPHERES BIHARMONIC WAVE MAPS INTO SPHERES SEBASTIAN HERR, TOBIAS LAMM, AND ROLAND SCHNAUBELT Abstract. A global weak solution of the biharmonic wave map equation in the energy space for spherical targets is constructed.

More information

The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications

The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications MAX PLANCK INSTITUTE Elgersburg Workshop Elgersburg February 11-14, 2013 The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications Timo Reis 1 Matthias Voigt 2 1 Department

More information

2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2

2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2 1 A Good Spectral Theorem c1996, Paul Garrett, garrett@math.umn.edu version February 12, 1996 1 Measurable Hilbert bundles Measurable Banach bundles Direct integrals of Hilbert spaces Trivializing Hilbert

More information

I. The space C(K) Let K be a compact metric space, with metric d K. Let B(K) be the space of real valued bounded functions on K with the sup-norm

I. The space C(K) Let K be a compact metric space, with metric d K. Let B(K) be the space of real valued bounded functions on K with the sup-norm I. The space C(K) Let K be a compact metric space, with metric d K. Let B(K) be the space of real valued bounded functions on K with the sup-norm Proposition : B(K) is complete. f = sup f(x) x K Proof.

More information

Numerical Treatment of Unstructured. Differential-Algebraic Equations. with Arbitrary Index

Numerical Treatment of Unstructured. Differential-Algebraic Equations. with Arbitrary Index Numerical Treatment of Unstructured Differential-Algebraic Equations with Arbitrary Index Peter Kunkel (Leipzig) SDS2003, Bari-Monopoli, 22. 25.06.2003 Outline Numerical Treatment of Unstructured Differential-Algebraic

More information

Some Background Material

Some Background Material Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important

More information

Superconvergence Results for the Iterated Discrete Legendre Galerkin Method for Hammerstein Integral Equations

Superconvergence Results for the Iterated Discrete Legendre Galerkin Method for Hammerstein Integral Equations Journal of Computer Science & Computational athematics, Volume 5, Issue, December 05 DOI: 0.0967/jcscm.05.0.003 Superconvergence Results for the Iterated Discrete Legendre Galerkin ethod for Hammerstein

More information

Passivity-based Stabilization of Non-Compact Sets

Passivity-based Stabilization of Non-Compact Sets Passivity-based Stabilization of Non-Compact Sets Mohamed I. El-Hawwary and Manfredi Maggiore Abstract We investigate the stabilization of closed sets for passive nonlinear systems which are contained

More information

SYNCHRONIZATION OF NONAUTONOMOUS DYNAMICAL SYSTEMS

SYNCHRONIZATION OF NONAUTONOMOUS DYNAMICAL SYSTEMS Electronic Journal of Differential Equations, Vol. 003003, No. 39, pp. 1 10. ISSN: 107-6691. URL: http://ejde.math.swt.edu or http://ejde.math.unt.edu ftp ejde.math.swt.edu login: ftp SYNCHRONIZATION OF

More information

A Concise Course on Stochastic Partial Differential Equations

A Concise Course on Stochastic Partial Differential Equations A Concise Course on Stochastic Partial Differential Equations Michael Röckner Reference: C. Prevot, M. Röckner: Springer LN in Math. 1905, Berlin (2007) And see the references therein for the original

More information

The first order quasi-linear PDEs

The first order quasi-linear PDEs Chapter 2 The first order quasi-linear PDEs The first order quasi-linear PDEs have the following general form: F (x, u, Du) = 0, (2.1) where x = (x 1, x 2,, x 3 ) R n, u = u(x), Du is the gradient of u.

More information

Ordinary Differential Equation Theory

Ordinary Differential Equation Theory Part I Ordinary Differential Equation Theory 1 Introductory Theory An n th order ODE for y = y(t) has the form Usually it can be written F (t, y, y,.., y (n) ) = y (n) = f(t, y, y,.., y (n 1) ) (Implicit

More information

Examples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling

Examples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling 1 Introduction Many natural processes can be viewed as dynamical systems, where the system is represented by a set of state variables and its evolution governed by a set of differential equations. Examples

More information

Equivalence groupoids of classes of linear ordinary differential equations and their group classification

Equivalence groupoids of classes of linear ordinary differential equations and their group classification Journal of Physics: Conference Series PAPER OPEN ACCESS Equivalence groupoids of classes of linear ordinary differential equations and their group classification To cite this article: Vyacheslav M Boyko

More information

Analysis in weighted spaces : preliminary version

Analysis in weighted spaces : preliminary version Analysis in weighted spaces : preliminary version Frank Pacard To cite this version: Frank Pacard. Analysis in weighted spaces : preliminary version. 3rd cycle. Téhéran (Iran, 2006, pp.75.

More information

LECTURE 15: COMPLETENESS AND CONVEXITY

LECTURE 15: COMPLETENESS AND CONVEXITY LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other

More information

On the Ψ - Exponential Asymptotic Stability of Nonlinear Lyapunov Matrix Differential Equations

On the Ψ - Exponential Asymptotic Stability of Nonlinear Lyapunov Matrix Differential Equations DOI: 1.2478/awutm-213-12 Analele Universităţii de Vest, Timişoara Seria Matematică Informatică LI, 2, (213), 7 28 On the Ψ - Exponential Asymptotic Stability of Nonlinear Lyapunov Matrix Differential Equations

More information

Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games

Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,

More information

Newtonian Mechanics. Chapter Classical space-time

Newtonian Mechanics. Chapter Classical space-time Chapter 1 Newtonian Mechanics In these notes classical mechanics will be viewed as a mathematical model for the description of physical systems consisting of a certain (generally finite) number of particles

More information

z x = f x (x, y, a, b), z y = f y (x, y, a, b). F(x, y, z, z x, z y ) = 0. This is a PDE for the unknown function of two independent variables.

z x = f x (x, y, a, b), z y = f y (x, y, a, b). F(x, y, z, z x, z y ) = 0. This is a PDE for the unknown function of two independent variables. Chapter 2 First order PDE 2.1 How and Why First order PDE appear? 2.1.1 Physical origins Conservation laws form one of the two fundamental parts of any mathematical model of Continuum Mechanics. These

More information

Introduction and Preliminaries

Introduction and Preliminaries Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis

More information

(x k ) sequence in F, lim x k = x x F. If F : R n R is a function, level sets and sublevel sets of F are any sets of the form (respectively);

(x k ) sequence in F, lim x k = x x F. If F : R n R is a function, level sets and sublevel sets of F are any sets of the form (respectively); STABILITY OF EQUILIBRIA AND LIAPUNOV FUNCTIONS. By topological properties in general we mean qualitative geometric properties (of subsets of R n or of functions in R n ), that is, those that don t depend

More information

Exercise Solutions to Functional Analysis

Exercise Solutions to Functional Analysis Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n

More information

ON THE HYPERBOLIC RELAXATION OF THE CAHN-HILLIARD EQUATION IN 3-D: APPROXIMATION AND LONG TIME BEHAVIOUR

ON THE HYPERBOLIC RELAXATION OF THE CAHN-HILLIARD EQUATION IN 3-D: APPROXIMATION AND LONG TIME BEHAVIOUR ON THE HYPERBOLIC RELAXATION OF THE CAHN-HILLIARD EQUATION IN 3-D: APPROXIMATION AND LONG TIME BEHAVIOUR ANTONIO SEGATTI Abstract. In this paper we consider the hyperbolic relaxation of the Cahn-Hilliard

More information

ON WEAKLY NONLINEAR BACKWARD PARABOLIC PROBLEM

ON WEAKLY NONLINEAR BACKWARD PARABOLIC PROBLEM ON WEAKLY NONLINEAR BACKWARD PARABOLIC PROBLEM OLEG ZUBELEVICH DEPARTMENT OF MATHEMATICS THE BUDGET AND TREASURY ACADEMY OF THE MINISTRY OF FINANCE OF THE RUSSIAN FEDERATION 7, ZLATOUSTINSKY MALIY PER.,

More information

NONTRIVIAL SOLUTIONS FOR SUPERQUADRATIC NONAUTONOMOUS PERIODIC SYSTEMS. Shouchuan Hu Nikolas S. Papageorgiou. 1. Introduction

NONTRIVIAL SOLUTIONS FOR SUPERQUADRATIC NONAUTONOMOUS PERIODIC SYSTEMS. Shouchuan Hu Nikolas S. Papageorgiou. 1. Introduction Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 34, 29, 327 338 NONTRIVIAL SOLUTIONS FOR SUPERQUADRATIC NONAUTONOMOUS PERIODIC SYSTEMS Shouchuan Hu Nikolas S. Papageorgiou

More information

Where is matrix multiplication locally open?

Where is matrix multiplication locally open? Linear Algebra and its Applications 517 (2017) 167 176 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Where is matrix multiplication locally open?

More information

Combinatorics in Banach space theory Lecture 12

Combinatorics in Banach space theory Lecture 12 Combinatorics in Banach space theory Lecture The next lemma considerably strengthens the assertion of Lemma.6(b). Lemma.9. For every Banach space X and any n N, either all the numbers n b n (X), c n (X)

More information

5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.

5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing. 5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint

More information

Overview of normed linear spaces

Overview of normed linear spaces 20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural

More information

2 Statement of the problem and assumptions

2 Statement of the problem and assumptions Mathematical Notes, 25, vol. 78, no. 4, pp. 466 48. Existence Theorem for Optimal Control Problems on an Infinite Time Interval A.V. Dmitruk and N.V. Kuz kina We consider an optimal control problem on

More information

NOTES ON FRAMES. Damir Bakić University of Zagreb. June 6, 2017

NOTES ON FRAMES. Damir Bakić University of Zagreb. June 6, 2017 NOTES ON FRAMES Damir Bakić University of Zagreb June 6, 017 Contents 1 Unconditional convergence, Riesz bases, and Bessel sequences 1 1.1 Unconditional convergence of series in Banach spaces...............

More information

AN EFFECTIVE METRIC ON C(H, K) WITH NORMAL STRUCTURE. Mona Nabiei (Received 23 June, 2015)

AN EFFECTIVE METRIC ON C(H, K) WITH NORMAL STRUCTURE. Mona Nabiei (Received 23 June, 2015) NEW ZEALAND JOURNAL OF MATHEMATICS Volume 46 (2016), 53-64 AN EFFECTIVE METRIC ON C(H, K) WITH NORMAL STRUCTURE Mona Nabiei (Received 23 June, 2015) Abstract. This study first defines a new metric with

More information

The Dirichlet s P rinciple. In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation:

The Dirichlet s P rinciple. In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation: Oct. 1 The Dirichlet s P rinciple In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation: 1. Dirichlet s Principle. u = in, u = g on. ( 1 ) If we multiply

More information

On Controllability of Linear Systems 1

On Controllability of Linear Systems 1 On Controllability of Linear Systems 1 M.T.Nair Department of Mathematics, IIT Madras Abstract In this article we discuss some issues related to the observability and controllability of linear systems.

More information