R. Marz with coecient functions A(x t) L(R n R m ) d(x t) R n and b(x t) R m x D R m t I R, that are continuous in their arguments, and which have the
|
|
- Britney Jackson
- 5 years ago
- Views:
Transcription
1 Nonlinear dierential-algebraic equations with properly formulated leading term R. Marz 1 Introduction In [BaMa], a uniform theory for investigating linear dierential-algebraic equations (DAEs) and their adjoint equations was proposed. By means of an additional coef- cient matrix it is exactly xed which derivatives of the solutions searched for are actually involved in the equation. Such a DAE is of the form A(t)(D(t)x(t)) 0 + B(t)x(t) q(t) ti (1.1) where the coecients A(t) and D(t) match well. As a nonlinear version, A(x(t) t)(d(t)x(t)) 0 + b(x(t) t)0 (1.) can be taken into account rst (e.g. [HiMa]). However, with somewhat more consistency, we obtain equations of the form A(x(t) t)(d(x(t) t)) 0 + b(x(t) t)0 (1.3) which we want to investigate in this paper. Note that it is just this sort of equations that result in the simulation of electric circuits, which is the origin of DAEs (e.g. [EsTi]). In this case, a transition to A(x(t) t)d x (x(t) t)x 0 (t)+b(x(t) t)+a(x(t) t)d t (x(t) t)0 is problematical. In the next section (x) we will determine what we mean by a properly formulated leading term. In x3 DAEs with index, f1 g will be characterized by algebraic criteria. x4 is devoted to linearization and perturbation theorems. A special structure, which is important for electric circuits for instance, will be analyzed in x5. Finally, constraint sets will be investigated in x6. Properly formulated leading terms and an equivalence theorem We investigate the equation A(x(t) t)(d(x(t) t)) 0 + b(x(t) t)0 (.1) 1
2 R. Marz with coecient functions A(x t) L(R n R m ) d(x t) R n and b(x t) R m x D R m t I R, that are continuous in their arguments, and which have the continuous partial derivatives A x d x b x. Denote D(x t) d x (x t). Denition.1 The leading term in (:1) is said to be properly formulated if ker A(x t) im D(x t) R n xd ti (.) and if there exists a projector function R C 1 (I L(R n )) such that R(t) R(t), ker A(x t) ker R(t) im D(x t) im R(t), and d(x t) R(t)d(x t) holds for x D ti. Consequently, the matrices A(x t) and D(x t) have constant rank for properly formulated leading terms. The subspaces A(x t) and im D(x t) are independent of x and have bases from the class C 1. It holds that A AR D RD. If A(x t) and D(x t) full the condition (.), but only ker A(x t) is independent of x and smooth, then we have, with a projector P A C 1 (I L(R n )), the relation A(x t) A(x t)p A (t) and, hence A(x(t) t)(d(x(t) t)) 0 A(x(t) t)(p A (t)d(x(t) t)) 0 ; A(x(t) t)p 0 A(t)d(x(t) t): Then, with A(x ~ t) : A(x t) d(x ~ t) : PA (t)d(x t) ~ b(x t) : b(x t); ;A(x t)p 0 A (t)d(x t), the equation ~A(x(t) t)( ~ d(x(t) t)) 0 + ~ b(x(t) t)0 (.3) has a proper leading term because of im ~ D(x t) im PA (t). We can proceed analogously if only im D(x t) is independent of x, or if the last condition of Denition.1 in not fullled. Hence, a proper formulation can be obtained if (.) holds and if one of the characteristic subspaces is independent of x and comes from C 1. I, is said to be a solution of Denition. A function x C(I x R m ) I x equation (.1) if x(t) D t I x and d(x(:) :) C 1 (I x R n ), and if equation (:1) is fullled pointwisely. Unfortunately, regularity conditions do not dene a linear function space here in general. In case d(x t) D(t)x is linear itself (cf. (1.)), a linear solution space is available by C 1 D : fx C : Dx C 1 g. Fortunately, it is relatively simple to transform equation (.1) into a (1.) form. This allows the application of standard-notions and -methods (dierentiability, linearization etc.) that are based on linear funtion spaces. We form the natural extension for equation (.1) with proper leading term A(x(t) t)(r(t)y(t)) 0 + b(x(t) t) 0 (.4) y(t) ; d(x(t) t) 0: (.5)
3 Nonlinear dierential-algebraic equations with properly formulated leading term 3 With x ; ; x y A A ; 0 d(x t)r(t)y D(x t)d(t)(0 R(t)) b(x t) b(x t) y;d(x t) we can write (.4), (.5) as A(x(t) t)(d(t)x(t)) 0 + b(x(t) t)0: (.6) Due to ker A(x t) ker A(x t), im D(t) im R(t) im D(x t) also (.6) has a properly formulated leading part with R(t) R(t) as the corresponding projector. Now the linear function space x C x 1 D y C : Dx Ry C 1 (.7) oers itself as solution space for (.6). For (.6) we seek functions x C 1 D whose function values lie in the domain of denition D of the coecients and full equation (.6) pointwisely. If x (:) is a solution of the original equation (.1), then the pair x (:) y (:) with y (t) : d(x (t) t) is obviously a solution of the class C 1 for (.6). If, reversely, a D pair x (:) y (:) from C 1 D forms a solution of (.6), then d(x (:) :) Rd(x (:) :) Ry C 1 also holds because of Ry C 1, and x (:) is a solution of equation (.1). Theorem.3 Let the leading term of (:1) be properly formulated. (i) The the leading term of the extension (:6) is properly formulated, too. (ii) The equations (:1) and (:6) are equivalent via the relation y(:) d(x(:) :): The sets and x M 0 (t) : fx y M 0 (t) :fx D: b(x t) im A(x t)g DR n : b(x t) im A(x t) y d(x t)g fx DR n : x M 0 (t) y d(x t)g: are the geometrical location of the solutions of (.1) and (.6), respectively, It always holds that x(t) M 0 (t) x(t) M 0 (t): The problem in how far these sets are lled with solutions leads to notions of indices and corresponding solvability statements. 3 Subspaces, matrix chain and index In this section we dene characteristic subspaces and matrix chains for (.1) and (.6). Further, let B(y x t) : (A(x t)y) x + b x (x t) for y R n x D t I and
4 4 R. Marz B(y x t) :(A(x t)y) 0 x + b x (x t) for y R n x DR n ti. More precisely, we have A(x t)y B(y x t) 0 x + bx (x t) 0 ;D(x t) I B(y x t) 0 ;D(x t) I For the original equation (.1) we form for x D ti y R n : G 0 (x t) A(x t)d(x t) N 0 (x t) ker G 0 (x t) S 0 (y x t) fz R m : B(y x t)z im G 0 (x t)g G 1 (y x t) G 0 (x t)+b(y x t)q 0 (x t) with a projector Q 0 (x t) L(R m ) onto N 0 (x t), P 0 (x t) I ; Q 0 (x t) N 1 (y x t) ker G 1 (y x t) S 1 (y x t) fz R m : B(y x t)p 0 (x t)z im G 1 (y x t)g: For (.6) this yields G 0 (x t) A(x t)d(x t) etc. for x DR n t I y R n. N 0 (t) R m ker R(t) depending on t only and being smooth is a special feature of (.6). Now, the relations among the subspaces of (.1) and (.6) are important, because the index will be dened via these subspaces later on. Lemma 3.1 Let equation (:1) have a proper leading term, then and N 0 (t) \ S 0 (y x t) (N 0 (x t) \ S 0 (y x t)) 0 (3.1) N 1 (y x t) \ S 1 (y x t) n ; Rm R n : Q 0 (x t) R(t) o : D(x t) ; + N 1 (y x t) \ S 1 (y x t) (3.) P roo f. We determine G 0 (x t) A(x t)d(x t) N 0 (t) 0 A(x t) 0 0 R m R n : A(x t) 0 R m ker R(t) S 0 (y x t) : B(y x t) im A(x t) ;D(x t) + 0 : S 0 (y x t) d(x t)
5 Nonlinear dierential-algebraic equations with properly formulated leading term 5 N 0 (t) \ S 0 (y x t) : R(t) 0 D(x t) S 0 (y x t) : N 0 (x t) \ S 0 (y x t) 0 : I Furthermore, by Q 0 (t) P 0 I ; R(t) 0 (t) we also have 0 R(t) 0 0 B(y x t) A(x t) B(y x t)p 0 (t) G 0 R(t) 1 (y x t) : ;D(x t) I ; R(t) which implies S 1 (y x t) N 1 (y x t) Finally, we obtain 8 >< >:; : ; 0 R(t) im 6 4 B(y x t) A(x t) ;D(x t) I ; R(t) n ; : R(t) ;D(x t) +(I ; R(t)) 39 > 7 5 > with R m R n B(y x t) + A(x t) 0 n ; n ; n ; o : R(t) ;D(x t) with S0 (y x t) o : B(y x t) + A(x t) 0 D(x t) 0 R(t) : N0 (x t) R(t) 0 (A(x t)d(x t)+ o +B(y x t)q 0 (x t))(d(x t) ; + ) n ; o : Q0 (x t) R(t) D(x t) ; + N 1 (y x t) : Q 0 (x t) R(t) ;D(x t) S 0 (y x t) D(x t) ; + N 1 (y x t) for ; N 1 (y x t) \ S 1 (y x t). Thus, B(y x t)p 0 (x t)(d(x t) ; + ) B(y x t)p 0 (x t)d(x t) ; because of B(y x t) G 0 (x t)w, i.e., ;B(y x t)p 0 (x t) im G 1 (y x t) B(y x t)p 0 (x t) (G 0 (x t)+b(y x t)q 0 (x t))(p 0 (x t)w ; Q 0 (x t)): Conclusion 3. For (:1) and (:6) it holds that and dim(n 0 (t) \ S 0 (y x t)) dim(n 0 (x t) \ S 0 (y x t)) dim(n 1 (y x t) \ S 1 (y x t)) dim(n 1 (y x t) \ S 1 (y x t)): o
6 6 R. Marz Denition 3.3 An equation (:1) with properly formulated leading term is called a DAE of index 1 if or a DAE of index if N 0 (x t) \ S 0 (y x t) 0 for x D ti y R n dim(n 0 (x t) \ S 0 (y x t)) const N 1 (y x t) \ S 1 (y x t) 0 for x D ti y R n : Theorem 3.4 The original equation (:1) with proper leading term and its natural extension (:6) have the index f1 g simultaneously. Now we continue the above matrix chain with and G (y x t) :G 1 (y x t)+b(y x t)p 0 (x t)q 1 (y x t) G (y x t) :G 1 (y x t)+b(y x t)p 0 (t)q 1 (y x t) where Q 1 (y x t) L(R m ), Q 1 (y x t) L(R m+n ) are projectors onto N 1 (y x t) and N 1 (y x t), respectively. f1 g here, hence, We will investigate only problems (.1) with index N 1 (y x t) S 1 (y x t) R m (3.3) holds on principle, in fact for 1with N 1 (y x t) 0,S 1 (y x t) R m trivially, and for due to [GrMa], Theorem A.13. Hence, we may assume that Q 1 (y x t) projects onto N 1 (y x t) along S 1 (y x t). Analogously, let Q 1 (y x t) be the projector onto N 1 (y x t) along S 1 (y x t). Simple computation now yield Lemma 3.5 For f1 g it holds that 0 Q0 Q Q 1 1 D ; 0 DQ 1 D ; D P 1 D ; DP 1 D ; D Q 1 D ; DQ 1 D ; and D Q 1 G ;1 (DQ 1 G ;1 DQ 1 D ; ). 4 Linearization and perturbation theorems First, we consider the equation A(x(t) t)(d(t)x(t)) 0 + b(x(t) t)0 (4.1) i.e., the case that D(x t) D(t)x x D t I. Later on, we apply the obtained results via (.6) to the general form (.1). We x x C 1 D(I R m ) with x (t) D t I. Let I I be compact. For all
7 Nonlinear dierential-algebraic equations with properly formulated leading term 7 x from a suciently small neighbourhood U(x ) of x in C 1 D(I R m ) we can dene the map F : U(x ) CD(I 1 R m )! C(I R m ) F(x) : A(x(:) :)(Dx) 0 (:)+b(x(:) :) xu(x ) (4.) and we can write equation (4.1) as F(x) 0 where F is Frechet-dierentiable. The derivative is given by F x (x) L b (C 1 D(I R m ) C(I R m )) F x (x)4x A(x(:) :)(D4x) 0 (:)+B((Dx) 0 (:) x(:) :)4x(:) for 4x C 1 D(I R m ) (4.3) where we assume natural norms on C 1 D(I R m ) and C(I R m ). For applying the implicit function theorem (e.g.[kaak]), the property of the image im F x (x ) is of crucial importance. With A (t) A(x (t) t) B (t) B((D(t)x (t)) 0 x (t) t) ti, the linear DAE is nothing else but the equation A (t)(d(t)4x(t)) 0 + B (t)4x(t) q(t) ti (4.4) F x (x )4x q: Let S 0 (t) N 0 (t) G 1 (t) etc. denote the chain of subspaces and matrices generated for (4.4). Lemma 4.1 Let the DAE (4:1) have a properly formulatd leading term. DP 1 D ; DQ 1 D ; C 1 (I L(R n )). Let (i) The index--property, f1 g, transforms itself from (4:1) onto the linearization (4:4). (ii) For 1, F x (x ) is surjective. (iii) For it holds that im F x (x )C 1 DQ 1 (I G ;1 R m ). P r o o f. The assumption (i) immediately results from the construction of the subspaces and the matrices in x3. The assumptions (ii) and (iii) are concluded from the existence theorems for linear DAEs in [BaMa]. Conclusion 4. In the index- case, im F x (x ) is a non-closed proper subset in C(I R m ).
8 8 R. Marz If the DAE (4.1) has a dynamic degree of freedom, it has to be completed by initial or boundary conditions. Since A and D are singular, we cannot expect a degree of freedom m as in the case of regular DAEs, but a lower one. An IVP with the initial condition x(t 0 )x 0 R m is not solvable in general. Hence, x 0 has to be consistent to an extend. Basing on our experience with linear DAEs ([BaMa]), we impose an initial condition for (4.1) with t 0 I in the form D(t 0 )(x(t 0 ) ; x 0 )0 with x 0 R m (4.5) where L(R m ) will still have to be xed. By means of the mapping F IV P : U(x ) C 1 D(I R m )! C(I R m ) L IC L IC : im D(t 0 ) F IV P (x) : (Fx D(t 0 )x(t 0 )) x U(x ) (4.6) we can describe the IVP (4.1), (4.5) in a compact way by Now, the equation corresponds to the perturbed IVP F IV P (x) (0 D(t 0 )x 0 ): F IV P (x) (q D(t 0 )x 0 ) A(x(t) t)(d(t)x(t)) 0 + b(x(t) t)q(t) t I (4.7) D(t 0 )(x(t 0 ) ; x 0 )0: (4.8) Theorem 4.3 Let (4:1) be a DAE with proper leading term and index f1 g, and let x C 1 D(I R m ) be a solution of (4:1) and Further, for x U(x ), let DP 1 D ; DQ 1 D ; C 1 (I L(R n )) : P 1 (t 0 ): D(t)Q 1 (t)g (t) ;1 b(x(t) t) be continuously dierentiable w.r.t. t: (4.9) (i) If 1, then the IVP (4:7) (4:8) is uniquely solvable on I for arbitrary x 0 R m with jd(t 0 )(x 0 ; x (t 0 ))j, and q C(I R m ) with k q k 1, > 0 suciently small. For the solutions x C 1 D(I R m ) it holds that k x ; x k C 1 D const (jd(t 0)(x 0 ; x (t 0 ))j+ k q k 1 ): (ii) If, then the IVP (4:7) (4:8) is uniquely solvable on I for arbitrary x 0 R m with jd(t 0 )(x 0 ; x (t 0 ))j and q C ;1 DQ 1 G (I R m ) k q k 1 + k (DQ 1 G ;1 q)0 k 1 > 0 suciently small. For the solutions x CD(I 1 R m ) it holds that k x ; x k C 1 D const (jd(t 0)(x 0 ; x (t 0 ))j+ k q k 1 + k (DQ 1 G ;1 q)0 k 1 ):
9 Nonlinear dierential-algebraic equations with properly formulated leading term 9 (iii) The solution x of the IVP (4:1) (4:8) is continuously dierentiable w.r.t. x 0. The sensitivity matrix x x 0(t) :X(t) L(R m ) satises the IVP A(x(t) t)(d(t)x(t)) 0 + B((D(t)x(t)) 0 x(t) t)x(t) 0 t I D(t 0 )(X(t 0 ) ; I) 0: Remark: If we take into account that P 1 (t) I, Q 1 (t) 0 for 1, then the smoothness assumptions of Theorem 4.3. are always trivially given in this case. For the regularity condition (4.9) implies restrictions of the admissible structure of (4.1). The following condition is sucient for (4.9): D ; C 1 (I L(R n R m )) (x t) :D(t)Q 1 (t)g (t) ;1 b(x t) is continuously dierentiable and b 0 x(p 0 (t)x + sq 0 (t)x t)q 0 (t)x im G 1 (t) s [0 1] xd ti : (4.10) Namely, then (x t) (P 0 (t)x t) is true and for x(:) U(x ) it holds that d dt (x(t) t) d dt (P 0(t)x t) d dt (D(t); D(t)x(t) t) x (D(t) ; D(t)x(t) t) fd(t) ;0 D(t)x(t) +D(t) ; (D(t)x(t)) 0 g + t (D(t) ; D(t)x(t) t). The condition (4.10) is equivalent to W 0 (t)b 0 x(p 0 (t)x + sq 0 (t)x t)q 0 (t)x im W 0 (t)b 0 (t)q 0 (t): (4.11) If the derivative free part of (4.1) is linear in x or if (4.1) is a DAE in Hessenberg form, then (4.11) is given. P r oof of Theorem 4.3: F IV P x (x ) is a bijection from C 1 D(I R m ) onto C(I R m ) L IC for 1. For, F IV P x (x ) is injective but not surjective. According to Lemma 4.1, im F IV P x (x ) L IC C 1 DQ 1 G ;1 (I R m ) L IC : X. Equipped with a natural norm, X is a Banach space. We summarize the two cases that 1 by using Q 1 0 P 1 I for 1. For the mapping H(x d q) :F IV P (x) ; (q d) x U(x ) (q d) X it holds, due to the condition (4.9), that With d : D(t 0 )x (t 0 ) we obtain H(x d q) X: H(x d 0) 0 H x (x d 0) F IV P x (x ): H x (x d 0) is a homeomorphism for 1 as well as for. Due to the implicit function theorem there exists a uniquely determined continuously dierentiable mapping f : B(d ) B(0 ) X! C 1 D(I R m )
10 10 R. Marz with f(d 0) x, H(f(d q) d q)0,k f(d q);f(d 0) k C D 1 K(jd;d j+ k q k X ) for jd ; d j k q k X :k q k 1 + k (DQ 1 G ;1 q)0 k 1. Then the two assumption (i) and (ii) follow because of d D(t 0 )x 0. In particular, f(d 0) is continuously dierentiable w.r.t. d, i.e., the solution x(:) of the IVP (4.1) with D(t 0 )x(t 0 ) d has a continuous derivative w.r.t. d. With d D(t 0 )x 0 this implies x x 0(t) x d (t)d(t 0 ). As usually, the variational equation (4.10) now results by dierentiation w.r.t. x 0 : If we introduce a perturbation index for (4.1.) analogously to the standard case of DAEs, then the inequalities in (i) and (ii) mean that a DAE (4.1) with index has the perturbation index f1 g, too. For the extended system (.4), (.5) and for (.6), respectively, it holds with x ; x y, 4x ; 4x 4y that A(x(:) :)(R4y) F x (x)4x 0 (:)+B((Ry) 0 (:) x(:) :)4x(:) : 4y(:) ; D(x(:) :)4x(:) In particular, the equation F x (x )4x (q r) with x ; x y is nothing else but the linear DAE A(x (t) t)(r(t)4y(t)) 0 + B((R(t)y (t)) 0 x (t) t)4x(t) q(t) 4y(t) ; D(x (t) t)4x(t) r(t): (4.1) Now, let x (:) be a solution of the nonlinear equation (.1) and y d(x (:) :). Then x (:) solves the extended form (.4), (.5) with y Ry d(x (:) :). With the coecients (4.1) can be reduced to For r(t) 0 this yields A (t) A(x (t) t) D (t) D(x (t) t) B (t) B((d(x (t) t)) 0 x (t) t) (4.13) A (t)(r(t)4y(t)) 0 + B (t)4x(t) q(t) 4y(t) ; D (t)4x(t) r(t): (4.14) A (t)(d (t)4x(t)) 0 + B (t)4x(t) q(t) (4.15) which can be regarded as a linearization of the initial equation (.1). By Theorem 3.4 and Lemma 4.1 the index f1 g is transformed from (.1) to (4.14) and (4.15). Now, let N 0, S 0, G 1 etc. be the subspaces and matrices of the chain formed for A, D and B from (4.13). We investigate the perturbed IVP A(x(t) t)(d(x(t) t)) 0 + b(x(t) t)q(t) (4.16)
11 Nonlinear dierential-algebraic equations with properly formulated leading term 11 D (t 0 )D (t 0 ) ; (d(x(t 0 ) t 0 ) ; y 0 )0 (4.17) y 0 R n q C(I R m ): For I the initial condition (4.17) simplies to R(t 0 )(d(x(t 0 ) t 0 ) ; y 0 )0,i.e., d(x(t 0 ) t 0 )R(t 0 )y 0 : (4.18) Theorem 4.4 Let the DAE (:1) with proper leading part be of index 1. Let x (:) be the solution of (.1) on the interval I. Further, let I. Then the IVP (4:16) (4:18) is uniquely solvable with a solution x(:) dened on I for q C(I R m ), k q k 1, y 0 R n, jr(t 0 )(y 0 ; d(x (t 0 ) t 0 ))j, > 0 suciently small. x(:) depends continuously dierentiably on y 0. It holds that k x ; x k 1 + k d(x(:) :) ; d(x (:) :) k C 1 const(jr(t 0 )(d(x(t 0 ) t 0 ) ; d(x (t 0 ) t 0 ))j+ k q k 1 ): P r o o f of the theorem: We form the extended system for the DAE (4.16) and apply Theorem 4.3 for 1. In the nature of things DAEs of index require a higher regularity of some components. Here it is essential in how far we can assume (4.9) for the extended equation (.6). We have (cf. x) with n(x t) : D(t)Q 1 (t)g (t) ;1 b(x t) n(x t)+d (t)q 1 (t)d (t) ; (y ; d(x t)) (4.19) n(x t) :D (t)q 1 (t)g (t) ;1 b(x t): (4.0) In the case of a linear original equation (.1) with A(x t) A(t), b(x t) B(t)x + q(t), d(x t) D(t)x the expressions (4.19), (4.0) simplify to n(x t) D(t)Q 1 (t)g (t) ;1 q(t)+d(t)q 1 (t)d(t) ; y n(x t) D(t)Q 1 (t)x + D(t)Q 1 (t)g (t) ;1 q(t): It is natural to demand that DQ 1 G ;1 q C 1 for index- DAEs, and likewise that DQ 1 D ; C 1. Thus, condition (4.9), which requires that n(x(:) :) has to belong to the class C 1 for continuous x(:) y(:) and continuously dierentiable (Ry)(:), is fullled for (.1) in the linear case. Theorem 4.5 Let the DAE (:1) with proper leading term be of index. Let be continuously x C(I R m ) be the solution of (:1), and D P 1 D ;, D Q 1 D ; dierentiable. Moreover, let : P 1 (t 0 ). Let n(x(:) :) C 1 (I R n ) for all x C(I R m ) from a neighbourhood ofx and for y CR(I 1 R n ) from a neighbourhood of y d(x (:) :).
12 1 R. Marz (i) For q C 1 D Q 1 (I G ;1 R m ) kqk 1 + k(d Q 1 G ;1 q)0 k 1 y 0 R n jd P 1 D ; (y 0 ; d(x (t 0 ) t 0 ))j > 0 suciently small, the IVP (4:16) (4:17) is uniquely solvable and for the solution x C(I R m ) it holds that kx ; x k 1 + kd(x(:) :) ; d(x (:) :)k C 1 const fkqk 1 + k(d Q 1 G ;1 q)0 k 1 + jd (t 0 )D (t 0 ) ; (d(x(t 0 ) t 0 ) ; d(x (t 0 ) t 0 ))jg: (ii) The solution x(:) of the IVP depends contiuously dierentiably on y 0. Proof.We use the extended form (.6) for (.1) and write the IVP (4.16), (4.17) in the following way (cf. xx1,) A(x (t) t)(d(t)x(t)) 0 + b(x(t) t)q(t) (4.1) D(t 0 )P 1 (t 0 )(x(t 0 ) ; x 0 )0 (4.) with D(t 0 )P 1 (t 0 )(0D P 1 D ; )andq(t) ; q(t) 0. For (.6), the condition (4.9) is given by the assumption. q C 1 (I DQ 1 G ;1 R m+n ) holds if and only if q C 1 D Q 1 (I G ;1 R m ). Consequently, Theorem 4.3 yields the assertion. We formulate a further perturbation theorem, whose assumptions are possibly easier to be checked. Theorem 4.6 Let the DAE (:1) with proper leading term be of index. Let as well as D x x C(I R m ) be the solution of (:1), and let D P 1 D ;, D Q 1 D ; be continuously dierentiable. Let : P 1 (t 0 ). For all x CD 1 (I R m ) from a neighbourhood of x let n(x(:) :) and d(x(:) :) be continuously dierentiable. Then the assumptions from Theorem 4:5 remain true, where the solutions of the IVP (4:16) (4:17) are even from CD 1 (I R m ). Proof. We check immediately whether the linear index- DAE (4.1) has solutions (I R m ) r 4x C 1 D (I R m ), 4y C 1 R(I R n ) for right-hand sides q C 1 D Q 1 G ;1 C 1 R(I R n ). With X : C 1 D (I R m ) C 1 R(I R m ) and Y : C 1 D Q 1 G ;1 (I R m ) C 1 R(I R n )we obtain F x (x ) L b (X Y ) imf x (x )Y. Then the related mappping F IV P x (x ) acts bijectively between the spaces X and Y L IC. By assumption it holds that x ; x y X. The regularity conditions for n(x t) and d(x t) ensure that F(x) Y is always true for x X from a neighbourhood of x. We can further argue analogously to the proof of Theorem 4.3, where the mapping H(x d q) :F IV P (x) ; (q d) operates in the spaces X L IC Y and Y L IC now. The additional regularity conditions in case of DAEs of index, which shall
13 Nonlinear dierential-algebraic equations with properly formulated leading term 13 guarantee certain properties of the mappings (the images F(x) have to lie in the "right" space), imply restrictions on the admissible structure. An interesting special class of DAEs, which is important for applications, consists of DAEs for which N 0 (x t) does not depend on x, i.e., ker D(x t) N 0 (t) x D ti (4.3) and P 0 (t) is continuously dierentiable w.r.t. t. Quite often N 0 (x t) is even independent of x and t. Then it holds that d(x t) d(p 0 (t)x t) x D ti (4.4) and further d x (x t) d x (P 0 (t)x t), in particular, D (t) d x (P 0 (t)x (t) t): Lemma 4.7 Let (:1) be a DAE with proper leading term. Let (4:3) be valid and d C 1 (DI R n ), P 0 DAE (:1). C 1 (I L(R m )). Let x C(I R m ) be a solution of the (i) Then P 0 x D D ; and D x are continuously dierentiable on I. (ii) d(x(:) :) is continuously dierentiable on I for all x C 1 D (I R m ). P r o o f. Provided that P 0 x is continuously dierentiable, then D (t) d x (P 0 (t)x (t) t) is so, too. As a reexive generalized inverse with C 1 -projectors P 0 (t) D (t) ; D (t), R(t) D (t)d (t) ; also D (t) ; is continuously dierentiable. Furthermore, D x D P 0 x belongs to the class C 1. Then x CD 1 (I R m ) implies d(x(:) :)d(d (:) ; D (:)x(:) :) C 1 (I R n ): It remains to show that P 0 x is actually C 1. Therefore, we investigate the function K(x y t) :y ; d(x t) x D y R n ti: We have K(x (t) y (t) t) 0, and K x (x (t) y (t) t) ;D (t) acts bijectively between im P 0 (t) and im R(t). For each t I the equation K(x y t) 0 provides a solution function (: t) with K((y t) y t) 0, (y t) P 0 (t)(y t), (y t) (R(t)y t), P 0 (t)x (t) (y (t) t). Then the regularity of P 0 x results from that of, since y (t) is continuously dierentiable. For a better understanding let us remark that, in case of d(x t) D(t)x + (t), the equation y ; D(t)x ; (t) 0 leads to y R(t)y and P 0 (t)x D(t) ; y ; D(t) ;, i.e., (y t) D(t) ; y ; D(t) ; (t). For nonlinear DAEs (.1) satisfying the assumptions of Lemma 4.7, i.e., DAEs with a smooth function d and an only time-dependent smooth subspace N 0,itisconvenient to work with the function space C 1 P 0 (I R m )C 1 D (I R m ). (.1) can be left in the original form or we may take (d(x(t) t)) 0 d x (P 0 (t)x(t) t)(p 0 (t)x(t)) 0 + d t (P 0 (t)x(t) t):
14 14 R. Marz 5 Special systems of circuit simulation The modied nodal analysis (MNA) used in industrial simulation packages generates, for large classes of circuits, systems of the form (cf. [EsTi]) A c (q(a > 9 c e(t) t)0 +b c (e(t) j L (t) j V (t)) 0 ((j L (t) t)) 0 +b L (e(t) j L (t) j V (t)) 0 (5.1) b V (e(t) j L (t) j V (t)) 0 where e(t), j L (t), j V (t) denote the nodal potentials and the currents of inductances and the voltage sources, respectively. The functions q(z t) and (w t) arecontinuously dierentiable and the Jacobians q z (z t), w (w t) are positive denit. With 0 x e j L j V 1 0 A A ~ A c 0 0 I A ~ d(x t) : q(a > c e t (j L t) 0 qz (A M(x t) : > c e t) 0 ~ b(x t) 0 w (j L t) it holds that ~D : d x M ~ A > G 0 : ~ A ~ D ~ AM ~ A > im G 0 im ~ A ker G0 ker ~ D ker ~ A > : b c (e j L j V t) b L (e j L j V t) b V (e j L j V t The matrix G 0 (x t) has a nullspace N 0 that is independent of x and t. Obviously, (5.1) is nothing else but ~A( ~ d(x(t) t)) 0 + ~ b(x(t) t)0: (5.) If im D(x ~ t) is independent of x, then (5.) has a proper leading term. Because of the constant nullspace N 0, Lemma 4.7 is relevant. If im D(x ~ t) changes with x, we can put A ~ AP ~ A ~ in (5.) and shift the constant projector P with ker A ~ P A ~ ker A ~ below the derivative. The DAE ~A(P ~ A ~ d(x(t) t)) 0 + ~ b(x(t) t)0 (5.3) has a proper leading term with constant subspace N 0 and R ~ P A ~. Here, too, Lemma 4.7 may be applied. Moreover, P ~ A ~ D(x t) isalso constant now. On the other hand, we can dierentiate and investigate the equation ~A( ~ d(x(t) t)) 0 ~ AfM(x(t) t)( ~ A > x(t)) 0 + d t (x(t) t)g ~AM(x(t) t)( ~ A > x(t)) 0 + ~ b(x(t) t)+ ~ Adt (x(t) t)0: (5.4) If ker( ~ AM(x t)) is independent of x, (5.4) represents a DAE with proper leading term. If ker( ~ AM(x t)) depends on x, we proceed to ~AM(x(t) t)p >~ A ( ~ A > x(t)) 0 + ~ b(x(t) t)+ ~ Adt (x(t) t)0: (5.5) 1 A
15 Nonlinear dierential-algebraic equations with properly formulated leading term 15 Combined version are also possible, the choice depends, among other things, on the subspaces im D(x t), D(x t)s 1 (x t), D(x t)n 1 (x t) being constant in case of A(x(t) t)(d(x(t) t)) 0 + b(x(t) t)0: Both versions, (5.3) as well as (5.5), have a constant im D(x t). For them, it holds uniformly that S 1 (x t) fz : ~ b x (x t)p 0 z im ( ~ A ~ D(x t)+ ~ bx (x t)q 0 )g: Then wehave D(x t)s 1 (x t) P ~ A ~ D(x t)s 1 (x t) for (5.3), whereas D(x t)s 1 (x t) ~A > S 1 (x t) is true for (5.5). 6 Constraints Obviously, all solutions x C 1 D(I R m )ofthe DAE A(x(t) t)(d(t)x(t)) 0 + b(x(t) t)0 (6.1) have to satisfy the condition x(t) M 0 (t) ti, with the constraint set M 0 (t) :fx D: b(x t) im A(x t)g: (6.) For DAEs of index 1, M 0 (t) is completely lled with solutions and M 0 (t 0 ) is the set of consistent initial values at time t 0 I(cf. [HiMa]). Theorem 6.1 Let (6:1) be a DAE of index 1. Let t 0 I and x 0 M 0 (t 0 ). Then there exists a unique (maximal) solution x CD(I 1 R m ) with I 3 t 0, x (t 0 )x 0. P r oof.because of x 0 M 0 (t 0 ) there exists a y 0 R(t 0 ) y 0 R n, with A(x 0 t 0 )D(t 0 )D(t 0 ) ; y 0 + b(x 0 t 0 )0: With x D(t) ; D(t)x + Q 0 (t)x D(t) ; u + Q 0 (t)w, w : Q 0 (t)x + D(t) ; y, u : D(t)x we nd A(x t)d(t)d(t) ; y + b(x t) A(D(t) ; u + Q 0 (t)w t)d(t)w + b(d(t) ; u + Q 0 (t)w t) : F(u w t): It holds that F(u 0 w 0 t 0 ) 0 for u 0 : D(t 0 )x 0, w 0 : Q 0 (t 0 )x 0 + D(t 0 ) ; y 0. Moreover, F w (u 0 w 0 t 0 )G 1 (D(t 0 )w 0 D(t 0 ) ; u 0 + Q 0 (t 0 )w 0 t 0 )G 1 (y 0 x 0 t 0 ) is regular in case of index 1. Consequently, the implicit function theorem implies the local equivalence of the relations F(u w t) 0and w!(u t) with a
16 16 R. Marz continuous function!(u t), which has a continuous partial derivative! u (u t) and for which w 0!(u 0 t 0 ) is true. The regular IVP u 0 (t) ; R 0 (t)u(t) D(t)!(u(t) t) u(t 0 )u 0 (6.3) has a solution u C 1 (I R m ) for which u(t) R(t)u(t) t I, holds. Then the function x(t) :D(t) ; u(t)+q 0 (t)!(u(t) t) ti,isthe desired solution. Behind Theorem 6.1 is the idea that the dynamics of a DAE is dominated by an inherent regular dierential equation (here, in case of 1, the dierential equation (6.3)), and representations of the solution result from the constraints. In the case of DAEs (6.1) of index,hidden constraints have to be taken into account. Under the assumptions of the following lemma these hidden constraints can be described relatively easy. Lemma 6. For the DAE (6:1) of index let im G 1 (y x t) not depend on y and Q 0 (t)x. For a continuously dierentiable projector W 1 (x t) L(R m ), ker W 1 (x t) im G 1 (y x t), let the relation be valid. Then is also true. W 1 (x t) W 1 (P 0 (t)x t) xd ti (6.4) (W 1 b)(x t) (W 1 b)(p 0 (t)x t) xd ti (6.5) Proof. By construction, W 1 BQ 0 0 and W 1 (Ay) x Q 0 z 0 for all z R m, hence, Finally, we have (W 1 b)(x t) ; (W 1 b)(p 0 (t)x t) Z 1 0 Z 1 0 W 1 b x Q 0 W 1 (B ; (Ay) x )Q 0 0: (W 1 b) x (sx +(1; s)p 0 (t)x)q 0 (t)xds fw 1x (:::)Q 0 (t)xb(:::)+w 1 b x (:::)Q 0 (t)xgds 0: The structure introduced in Lemma 6. allows us to dierentiate the equation (W 1 b)(x t) 0 along a solution and thus to nd the hidden constraints. More precisely, let D(t) and D(t) ; be from C 1. Then the function (W 1 b)(x (t) t) is continuously dierentiable for each solution x C 1 D(I R m ). x (t) M 0 (t) implies (W 1 b)(x (t) t) 0 t I and (W 1 b)(d(t) ; D(t)x (t) t) 0 t I, respectively, and dierentiation yields (W 1 b) x (D(t) ; D(t)x (t) t)(d(t) ; D(t)x (t)) 0 +(W 1 b) 0 t(d(t) ; D(t)x (t) t)0: From (6.1) we obtain immediately D(t) ; (D(t)x (t)) ; ;D(t) ; A(x (t) t) ; b(x (t) t):
17 Nonlinear dierential-algebraic equations with properly formulated leading term 17 This makes clear that x (t) H 1 (t) ti with H 1 (t) : fx D :(W 1 b) x (x t)(d(t) ;0 D(t)x ; D(t) ; A(x t) ; b(x t)) +(W 1 b)(p 0 (t)x t) 0g must be true. Thus, H 1 (t) describes a hidden constraints. A(x t) ; is a reexive generalized inverse with A(x t) ; A(x t) R(t). It can be supposed that there are no further hidden constraints for and that M 1 (t) M 0 (t) \H 1 (t) ti represents the sharp geometrical location of the solution of the DAE (6.1) that is of index. Furthermore, it can be supposed that, under regularity conditions admitting the existence of the tangent space T x M 1 (t), the relations P 0 (t)t x M 1 (t) P 0 (t)s 1 (y x t) D(t)T x M 1 (t) D(t)S 1 (y x t) hold for x M 1 (t), y ;A(x t) ; b(x t). References [BaMa] K. Balla und R. Marz: A unied approach to linear dierential algebraic equations and their adjoint equations. Humboldt-Universitat Berlin, Institut fur Mathematik, Preprint [EsTi] D. Estevez Schwarz und Caren Tischendorf: Structural analysis of electric circuits and Consequences for MNA. Int. Circ. Theor. Appl. 8 (000) [GrMa] E. Griepentrog, R. Marz: Dierential-algebraic equations and their numerical tratment. Teubner, Leipzig, [HiMa] I. Higueras und R. Marz: Formulating dierential algebraic equations properly. Humboldt-Universitat Berlin, Institut fur Mathematik, Preprint [KaAk] L.V. Kantorovich und G.P. Akilov: Funktsional'nyj analiz. Nauka, Moskva 1977.
INTRODUCTION 2 Hence, by various reasons we are led to study equations of the form (.) in more detail. It should be stressed once more that neither A(
The index of linear dierential algebraic equations with properly stated leading terms R. Marz Introduction A linear dierential algebraic equation (DAE) with properly stated leading term is of the form
More informationthe reference terminal. For electrotechnical reasons, the current entering terminal n is given by i n = ; P n; k= i k. The conductance matrix G(v :::
Topological index calculation of DAEs in circuit simulation Caren Tischendorf, Humboldt-University of Berlin Abstract. Electric circuits are present in a number of applications, e.g. in home computers,
More informationDIFFERENTIAL-ALGEBRAIC EQUATIONS FROM A FUNCTIONAL-ANALYTIC VIEWPOINT: A SURVEY
DIFFERENTIAL-ALGEBRAIC EQUATIONS FROM A FUNCTIONAL-ANALYTIC VIEWPOINT: A SURVEY Roswitha März December 19, 2013 Abstract The purpose of this paper is to provide an overview on the state of the art concerning
More informationClearly, (1.1) covers the well-understood case of regular explicit ODEs x (t) = Bx(t) + g(x(t); t) (1.3) by A =?I, h(y; x; t) g(x; t). The pencil f?i;
Criteria for the trivial solution of dierential algebraic equations with small nonlinearities to be asymptotically stable Roswitha Marz, Humboldt-Universitat Berlin Abstract Dierential algebraic equations
More informationProjectors for matrix pencils
Projectors for matrix pencils Roswitha März Abstract In this paper, basic properties of projector sequences for matrix pairs which can be used for analyzing differential algebraic systems are collected.
More informationgrowth rates of perturbed time-varying linear systems, [14]. For this setup it is also necessary to study discrete-time systems with a transition map
Remarks on universal nonsingular controls for discrete-time systems Eduardo D. Sontag a and Fabian R. Wirth b;1 a Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, b sontag@hilbert.rutgers.edu
More informationFunctional Analysis. Martin Brokate. 1 Normed Spaces 2. 2 Hilbert Spaces The Principle of Uniform Boundedness 32
Functional Analysis Martin Brokate Contents 1 Normed Spaces 2 2 Hilbert Spaces 2 3 The Principle of Uniform Boundedness 32 4 Extension, Reflexivity, Separation 37 5 Compact subsets of C and L p 46 6 Weak
More informationAnalysis Comprehensive Exam Questions Fall 2008
Analysis Comprehensive xam Questions Fall 28. (a) Let R be measurable with finite Lebesgue measure. Suppose that {f n } n N is a bounded sequence in L 2 () and there exists a function f such that f n (x)
More information(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea
Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract
More informationwhere m is the maximal ideal of O X,p. Note that m/m 2 is a vector space. Suppose that we are given a morphism
8. Smoothness and the Zariski tangent space We want to give an algebraic notion of the tangent space. In differential geometry, tangent vectors are equivalence classes of maps of intervals in R into the
More informationWhere 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 informationINRIA Rocquencourt, Le Chesnay Cedex (France) y Dept. of Mathematics, North Carolina State University, Raleigh NC USA
Nonlinear Observer Design using Implicit System Descriptions D. von Wissel, R. Nikoukhah, S. L. Campbell y and F. Delebecque INRIA Rocquencourt, 78 Le Chesnay Cedex (France) y Dept. of Mathematics, North
More informationRearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton D
Rearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton Down, Bath BA2 7AY, U.K. R.J. Douglas, Isaac Newton
More informationStabilität differential-algebraischer Systeme
Stabilität differential-algebraischer Systeme Caren Tischendorf, Universität zu Köln Elgersburger Arbeitstagung, 11.-14. Februar 2008 Tischendorf (Univ. zu Köln) Stabilität von DAEs Elgersburg, 11.-14.02.2008
More informationonly nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr
The discrete algebraic Riccati equation and linear matrix inequality nton. Stoorvogel y Department of Mathematics and Computing Science Eindhoven Univ. of Technology P.O. ox 53, 56 M Eindhoven The Netherlands
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More information56 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 informationPARAMETER IDENTIFICATION IN THE FREQUENCY DOMAIN. H.T. Banks and Yun Wang. Center for Research in Scientic Computation
PARAMETER IDENTIFICATION IN THE FREQUENCY DOMAIN H.T. Banks and Yun Wang Center for Research in Scientic Computation North Carolina State University Raleigh, NC 7695-805 Revised: March 1993 Abstract In
More informationLECTURE 7. k=1 (, v k)u k. Moreover r
LECTURE 7 Finite rank operators Definition. T is said to be of rank r (r < ) if dim T(H) = r. The class of operators of rank r is denoted by K r and K := r K r. Theorem 1. T K r iff T K r. Proof. Let T
More informationChapter 4. Inverse Function Theorem. 4.1 The Inverse Function Theorem
Chapter 4 Inverse Function Theorem d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d dd d d d d This chapter
More informationLinear Algebra, 4th day, Thursday 7/1/04 REU Info:
Linear Algebra, 4th day, Thursday 7/1/04 REU 004. Info http//people.cs.uchicago.edu/laci/reu04. Instructor Laszlo Babai Scribe Nick Gurski 1 Linear maps We shall study the notion of maps between vector
More informationExercise 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 informationNORMS 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 informationCongurations of periodic orbits for equations with delayed positive feedback
Congurations of periodic orbits for equations with delayed positive feedback Dedicated to Professor Tibor Krisztin on the occasion of his 60th birthday Gabriella Vas 1 MTA-SZTE Analysis and Stochastics
More informationz 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 informationDefect-based a posteriori error estimation for index-1 DAEs
Defect-based a posteriori error estimation for index-1 DAEs W. Auzinger, H. Lehner, E. Weinmüller Institute for Analysis and Scientific Computing Vienna University of Technology Wiedner Hauptstrasse 8
More informationPointwise convergence rate for nonlinear conservation. Eitan Tadmor and Tao Tang
Pointwise convergence rate for nonlinear conservation laws Eitan Tadmor and Tao Tang Abstract. We introduce a new method to obtain pointwise error estimates for vanishing viscosity and nite dierence approximations
More informationUnconstrained optimization
Chapter 4 Unconstrained optimization An unconstrained optimization problem takes the form min x Rnf(x) (4.1) for a target functional (also called objective function) f : R n R. In this chapter and throughout
More informationAbstract. Jacobi curves are far going generalizations of the spaces of \Jacobi
Principal Invariants of Jacobi Curves Andrei Agrachev 1 and Igor Zelenko 2 1 S.I.S.S.A., Via Beirut 2-4, 34013 Trieste, Italy and Steklov Mathematical Institute, ul. Gubkina 8, 117966 Moscow, Russia; email:
More information. HILBERT POLYNOMIALS
CLASSICAL ALGEBRAIC GEOMETRY Daniel Plaumann Universität Konstan Summer HILBERT POLYNOMIALS T An ane variety V A n with vanishing ideal I(V) K[,, n ] is completely determined by its coordinate ring A(V)
More informationDISCRETE METHODS AND EXPONENTIAL DICHOTOMY OF SEMIGROUPS. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXIII, 2(2004), pp. 97 205 97 DISCRETE METHODS AND EXPONENTIAL DICHOTOMY OF SEMIGROUPS A. L. SASU Abstract. The aim of this paper is to characterize the uniform exponential
More informationFUNCTION BASES FOR TOPOLOGICAL VECTOR SPACES. Yılmaz Yılmaz
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 33, 2009, 335 353 FUNCTION BASES FOR TOPOLOGICAL VECTOR SPACES Yılmaz Yılmaz Abstract. Our main interest in this
More information1. Bounded linear maps. A linear map T : E F of real Banach
DIFFERENTIABLE MAPS 1. Bounded linear maps. A linear map T : E F of real Banach spaces E, F is bounded if M > 0 so that for all v E: T v M v. If v r T v C for some positive constants r, C, then T is bounded:
More information3.3. SYSTEMS OF ODES 1. y 0 " 2y" y 0 + 2y = x1. x2 x3. x = y(t) = c 1 e t + c 2 e t + c 3 e 2t. _x = A x + f; x(0) = x 0.
.. SYSTEMS OF ODES. Systems of ODEs MATH 94 FALL 98 PRELIM # 94FA8PQ.tex.. a) Convert the third order dierential equation into a rst oder system _x = A x, with y " y" y + y = x = @ x x x b) The equation
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationLecture two. January 17, 2019
Lecture two January 17, 2019 We will learn how to solve rst-order linear equations in this lecture. Example 1. 1) Find all solutions satisfy the equation u x (x, y) = 0. 2) Find the solution if we know
More informationNewtonian 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 informationON TRIVIAL GRADIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -grad
ON TRIVIAL GRAIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -gradient Young measure supported on K must be trivial the
More informationSOLVABILITY AND THE NUMBER OF SOLUTIONS OF HAMMERSTEIN EQUATIONS
Electronic Journal of Differential Equations, Vol. 2004(2004), No. 54, pp. 1 25. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) SOLVABILITY
More informationQUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE. Denitizable operators in Krein spaces have spectral properties similar to those
QUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE BRANKO CURGUS and BRANKO NAJMAN Denitizable operators in Krein spaces have spectral properties similar to those of selfadjoint operators in Hilbert spaces.
More informationAn improved convergence theorem for the Newton method under relaxed continuity assumptions
An improved convergence theorem for the Newton method under relaxed continuity assumptions Andrei Dubin ITEP, 117218, BCheremushinsaya 25, Moscow, Russia Abstract In the framewor of the majorization technique,
More information4. Higher Order Linear DEs
4. Higher Order Linear DEs Department of Mathematics & Statistics ASU Outline of Chapter 4 1 General Theory of nth Order Linear Equations 2 Homogeneous Equations with Constant Coecients 3 The Method of
More informationINVERSE FUNCTION THEOREM and SURFACES IN R n
INVERSE FUNCTION THEOREM and SURFACES IN R n Let f C k (U; R n ), with U R n open. Assume df(a) GL(R n ), where a U. The Inverse Function Theorem says there is an open neighborhood V U of a in R n so that
More informationAbstract Minimal degree interpolation spaces with respect to a nite set of
Numerische Mathematik Manuscript-Nr. (will be inserted by hand later) Polynomial interpolation of minimal degree Thomas Sauer Mathematical Institute, University Erlangen{Nuremberg, Bismarckstr. 1 1, 90537
More informationOrdinary 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 informationLinear Algebra. Linear Algebra. Chih-Wei Yi. Dept. of Computer Science National Chiao Tung University. November 12, 2008
Linear Algebra Chih-Wei Yi Dept. of Computer Science National Chiao Tung University November, 008 Section De nition and Examples Section De nition and Examples Section De nition and Examples De nition
More informationTHE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS
THE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS RALPH HOWARD DEPARTMENT OF MATHEMATICS UNIVERSITY OF SOUTH CAROLINA COLUMBIA, S.C. 29208, USA HOWARD@MATH.SC.EDU Abstract. This is an edited version of a
More informationNotes on the matrix exponential
Notes on the matrix exponential Erik Wahlén erik.wahlen@math.lu.se February 14, 212 1 Introduction The purpose of these notes is to describe how one can compute the matrix exponential e A when A is not
More informationABELIAN SELF-COMMUTATORS IN FINITE FACTORS
ABELIAN SELF-COMMUTATORS IN FINITE FACTORS GABRIEL NAGY Abstract. An abelian self-commutator in a C*-algebra A is an element of the form A = X X XX, with X A, such that X X and XX commute. It is shown
More informationLECTURE 15 + C+F. = A 11 x 1x1 +2A 12 x 1x2 + A 22 x 2x2 + B 1 x 1 + B 2 x 2. xi y 2 = ~y 2 (x 1 ;x 2 ) x 2 = ~x 2 (y 1 ;y 2 1
LECTURE 5 Characteristics and the Classication of Second Order Linear PDEs Let us now consider the case of a general second order linear PDE in two variables; (5.) where (5.) 0 P i;j A ij xix j + P i,
More information290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f
Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica
More informationECON 582: An Introduction to the Theory of Optimal Control (Chapter 7, Acemoglu) Instructor: Dmytro Hryshko
ECON 582: An Introduction to the Theory of Optimal Control (Chapter 7, Acemoglu) Instructor: Dmytro Hryshko Continuous-time optimization involves maximization wrt to an innite dimensional object, an entire
More informationDefect-based a-posteriori error estimation for implicit ODEs and DAEs
1 / 24 Defect-based a-posteriori error estimation for implicit ODEs and DAEs W. Auzinger Institute for Analysis and Scientific Computing Vienna University of Technology Workshop on Innovative Integrators
More informationControl, Stabilization and Numerics for Partial Differential Equations
Paris-Sud, Orsay, December 06 Control, Stabilization and Numerics for Partial Differential Equations Enrique Zuazua Universidad Autónoma 28049 Madrid, Spain enrique.zuazua@uam.es http://www.uam.es/enrique.zuazua
More informationAsymptotic 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 informationTEST CODE: PMB SYLLABUS
TEST CODE: PMB SYLLABUS Convergence and divergence of sequence and series; Cauchy sequence and completeness; Bolzano-Weierstrass theorem; continuity, uniform continuity, differentiability; directional
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationx 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7
Linear Algebra and its Applications-Lab 1 1) Use Gaussian elimination to solve the following systems x 1 + x 2 2x 3 + 4x 4 = 5 1.1) 2x 1 + 2x 2 3x 3 + x 4 = 3 3x 1 + 3x 2 4x 3 2x 4 = 1 x + y + 2z = 4 1.4)
More informationLecture Notes in Functional Analysis
Lecture Notes in Functional Analysis Please report any mistakes, misprints or comments to aulikowska@mimuw.edu.pl LECTURE 1 Banach spaces 1.1. Introducton to Banach Spaces Definition 1.1. Let X be a K
More informationMath 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 informationInverse Function Theorem
Inverse Function Theorem Ethan Y. Jaffe 1 Motivation When as an undergraduate I first learned the inverse function theorem, I was using a textbook of Munkres [1]. The proof presented there was quite complicated
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on
More informationAn 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 informationNumerical 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 information2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.
Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following
More information4 Linear operators and linear functionals
4 Linear operators and linear functionals The next section is devoted to studying linear operators between normed spaces. Definition 4.1. Let V and W be normed spaces over a field F. We say that T : V
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More information1 Relative degree and local normal forms
THE ZERO DYNAMICS OF A NONLINEAR SYSTEM 1 Relative degree and local normal orms The purpose o this Section is to show how single-input single-output nonlinear systems can be locally given, by means o a
More informationIntegral Extensions. Chapter Integral Elements Definitions and Comments Lemma
Chapter 2 Integral Extensions 2.1 Integral Elements 2.1.1 Definitions and Comments Let R be a subring of the ring S, and let α S. We say that α is integral over R if α isarootofamonic polynomial with coefficients
More informationContents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces
Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v 250) Contents 2 Vector Spaces 1 21 Vectors in R n 1 22 The Formal Denition of a Vector Space 4 23 Subspaces 6 24 Linear Combinations and
More informationOptimal Control. Quadratic Functions. Single variable quadratic function: Multi-variable quadratic function:
Optimal Control Control design based on pole-placement has non unique solutions Best locations for eigenvalues are sometimes difficult to determine Linear Quadratic LQ) Optimal control minimizes a quadratic
More informationThe WENO Method for Non-Equidistant Meshes
The WENO Method for Non-Equidistant Meshes Philip Rupp September 11, 01, Berlin Contents 1 Introduction 1.1 Settings and Conditions...................... The WENO Schemes 4.1 The Interpolation Problem.....................
More information5 Banach Algebras. 5.1 Invertibility and the Spectrum. Robert Oeckl FA NOTES 5 19/05/2010 1
Robert Oeckl FA NOTES 5 19/05/2010 1 5 Banach Algebras 5.1 Invertibility and the Spectrum Suppose X is a Banach space. Then we are often interested in (continuous) operators on this space, i.e, elements
More informationChapter 3 Least Squares Solution of y = A x 3.1 Introduction We turn to a problem that is dual to the overconstrained estimation problems considered s
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationLinear Algebra Short Course Lecture 2
Linear Algebra Short Course Lecture 2 Matthew J. Holland matthew-h@is.naist.jp Mathematical Informatics Lab Graduate School of Information Science, NAIST 1 Some useful references Introduction to linear
More informationSTOCHASTIC DIFFERENTIAL EQUATIONS WITH EXTRA PROPERTIES H. JEROME KEISLER. Department of Mathematics. University of Wisconsin.
STOCHASTIC DIFFERENTIAL EQUATIONS WITH EXTRA PROPERTIES H. JEROME KEISLER Department of Mathematics University of Wisconsin Madison WI 5376 keisler@math.wisc.edu 1. Introduction The Loeb measure construction
More informationThe 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 informationOn the simplest expression of the perturbed Moore Penrose metric generalized inverse
Annals of the University of Bucharest (mathematical series) 4 (LXII) (2013), 433 446 On the simplest expression of the perturbed Moore Penrose metric generalized inverse Jianbing Cao and Yifeng Xue Communicated
More informationTools from Lebesgue integration
Tools from Lebesgue integration E.P. van den Ban Fall 2005 Introduction In these notes we describe some of the basic tools from the theory of Lebesgue integration. Definitions and results will be given
More informationLECTURE 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 informationThe Contraction Mapping Principle
Chapter 3 The Contraction Mapping Principle The notion of a complete space is introduced in Section 1 where it is shown that every metric space can be enlarged to a complete one without further condition.
More informationEquivalence of dynamical systems by bisimulation
Equivalence of dynamical systems by bisimulation Arjan van der Schaft Department of Applied Mathematics, University of Twente P.O. Box 217, 75 AE Enschede, The Netherlands Phone +31-53-4893449, Fax +31-53-48938
More information(x, y) = d(x, y) = x y.
1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance
More information(1) is an invertible sheaf on X, which is generated by the global sections
7. Linear systems First a word about the base scheme. We would lie to wor in enough generality to cover the general case. On the other hand, it taes some wor to state properly the general results if one
More information1.1 Limits and Continuity. Precise definition of a limit and limit laws. Squeeze Theorem. Intermediate Value Theorem. Extreme Value Theorem.
STATE EXAM MATHEMATICS Variant A ANSWERS AND SOLUTIONS 1 1.1 Limits and Continuity. Precise definition of a limit and limit laws. Squeeze Theorem. Intermediate Value Theorem. Extreme Value Theorem. Definition
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationSophus Lie s Approach to Differential Equations
Sophus Lie s Approach to Differential Equations IAP lecture 2006 (S. Helgason) 1 Groups Let X be a set. A one-to-one mapping ϕ of X onto X is called a bijection. Let B(X) denote the set of all bijections
More informationCompact operators on Banach spaces
Compact operators on Banach spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 12, 2017 1 Introduction In this note I prove several things about compact
More informationOne-Dimensional Diffusion Operators
One-Dimensional Diffusion Operators Stanley Sawyer Washington University Vs. July 7, 28 1. Basic Assumptions. Let sx be a continuous, strictly-increasing function sx on I, 1 and let mdx be a Borel measure
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationConvergence Theorems of Approximate Proximal Point Algorithm for Zeroes of Maximal Monotone Operators in Hilbert Spaces 1
Int. Journal of Math. Analysis, Vol. 1, 2007, no. 4, 175-186 Convergence Theorems of Approximate Proximal Point Algorithm for Zeroes of Maximal Monotone Operators in Hilbert Spaces 1 Haiyun Zhou Institute
More informationNonlinear Diffusion in Irregular Domains
Nonlinear Diffusion in Irregular Domains Ugur G. Abdulla Max-Planck Institute for Mathematics in the Sciences, Leipzig 0403, Germany We investigate the Dirichlet problem for the parablic equation u t =
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EECS 227A Nonlinear and Convex Optimization. Solutions 5 Fall 2009
UC Berkeley Department of Electrical Engineering and Computer Science EECS 227A Nonlinear and Convex Optimization Solutions 5 Fall 2009 Reading: Boyd and Vandenberghe, Chapter 5 Solution 5.1 Note that
More informationFunctional Analysis Exercise Class
Functional Analysis Exercise Class Week 9 November 13 November Deadline to hand in the homeworks: your exercise class on week 16 November 20 November Exercises (1) Show that if T B(X, Y ) and S B(Y, Z)
More informationChapter -1: Di erential Calculus and Regular Surfaces
Chapter -1: Di erential Calculus and Regular Surfaces Peter Perry August 2008 Contents 1 Introduction 1 2 The Derivative as a Linear Map 2 3 The Big Theorems of Di erential Calculus 4 3.1 The Chain Rule............................
More informationOn 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 informationYour first day at work MATH 806 (Fall 2015)
Your first day at work MATH 806 (Fall 2015) 1. Let X be a set (with no particular algebraic structure). A function d : X X R is called a metric on X (and then X is called a metric space) when d satisfies
More informationContinuous functions with compact support
@ Applied General Topology c Universidad Politécnica de Valencia Volume 5, No. 1, 2004 pp. 103 113 Continuous functions with compact support S. K. Acharyya, K. C. Chattopadhyaya and Partha Pratim Ghosh
More information