Stability analysis of differential algebraic systems
|
|
- Calvin Osborne Mathews
- 5 years ago
- Views:
Transcription
1 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 Novi Sad,
2 Introduction Stability analysis for linear differential-algebraic equations DAEs of the form E(t)ẋ = A(t)x + f, with variable coefficients on the half-line I = [0, ). They arise as linearization of nonlinear systems around reference solutions. F(t, x, ẋ) = 0 Stability analysis for DAEs 2 / 58
3 Applications Mechanical multibody systems Electrical circuit simulation Mechatronic systems Chemical reactions Semi-discretized PDEs (Stokes, Navier-Stokes) Automatically generated coupled systems Stability analysis for DAEs 3 / 58
4 Automatic gearboxes Modeling, simulation and software control of automatic gearboxes. Project with Daimler AG (Dissertation: Peter Hamann 2009). Stability analysis for DAEs 4 / 58
5 Technological Application Modeling of multi-physics model: multi-body system, elasticity, hydraulics, friction,.... Development of control methods for coupled system. Real time control of gearbox. Goal: Decrease full consumption, improve smoothness of switching Large control system of nonlinear DAEs. Stability analysis for DAEs 5 / 58
6 Overview 1. Classical theory for ODEs: 2. Extension of theory to DAEs. 3. Numerical computation of spectral intervals for DAEs (Extending work of Dieci/Van Vleck for ODEs). References: V.H. Linh and V.M.. Lyapunov, Bohl and Sacker-Sell Spectral Intervals for Differential-Algebraic Equations. J. DYNAMICS AND DIFF. EQUATIONS, Vol. 21, , 2009 V.H. Linh and V.M. and E. Van Vleck. QR Methods and Error Analysis for Computing Lyapunov and Sacker-Sell Spectral Intervals for Linear Differential-Algebraic Equations. To appear in ADV. COMP. MATH., 2010 Stability analysis for DAEs 6 / 58
7 Spectral theory for ODEs Classical spectral theory for ODEs ẋ = f (t, x), t I, x(0) = x 0, with x C 1 (I, R n ). By shifting the solution, we may assume that x(t) 0. A constant coefficient system ẋ = Ax with A R n,n is asymptotically stable if all eigenvalues of A have negative real part. Stability analysis for DAEs 7 / 58
8 Asympt. stab. of var. coefficient ODEs Even if for all t R, the matrix A(t) has all eigenvalues in the left half plane, the system ẋ = A(t)x may be unstable. Example For all t R [ cos A(t) = 2 (3t) 5 sin 2 ] (3t) 6 cos(3t) sin(3t) cos(3t)sin(3t) + 3 sin 2 (3t) 5 cos 2 (3t) has a double [ ] eigenvalue 2 but the solution of ẋ = A(t)x, c1 x(0) = is 0 x(t) = [ c1 e t cos(3t) c 1 e t cos(3t) ]. Stability analysis for DAEs 8 / 58
9 Lyapunov exponents For the linear ODE ẋ = A(t)x with bounded coefficient function A(t) and nontrivial solution x we define the upper and lower Lyapunov exponents, λ u (x) = lim sup t 1 t ln x(t), λl (x) = lim inf t 1 t ln x(t). Since A is bounded, the Lyapunov exponents are finite. Theorem (Lyapunov 1907) If the greatest bound of upper Lyapunov exponents for all solutions ẋ = A(t)x is negative, then the system is asymptotically stable. Stability analysis for DAEs 9 / 58
10 Lyapunov exp. of fundamental sol n For the fundamental solution of Ẋ = A(t)X, the Lyapunov exponents for the i-th column of X are λ u (Xe i ), and λ l (Xe i ), i = 1, 2,..., n, (1) where e i denotes the i-th unit vector. W.l.o.g. we assume that the columns of X are ordered such that the upper Lyapunov exponents satisfy λ u (Xe 1 ) λ u (Xe 2 )... λ u (Xe n ). Stability analysis for DAEs 10 / 58
11 Lyapunov spectrum Definition Lyapunov 1907, Perron 1930, Daleckii/Krein 1974 The Lyapunov spectrum Σ L of ẋ = A(t)x is the union of Lyapunov spectral intervals Σ L := n [λ l i, λu i ]. i=1 If each of the Lyapunov spectral intervals shrinks to a point, i.e., if λ l i = λ u i i = 1, 2,..., n, then the system is called Lyapunov-regular. If a system is Lyapunov-regular, then we simply write λ i for the Lyapunov exponents. Stability analysis for DAEs 11 / 58
12 Kinematic similarity Definition A change of variables z = T 1 x with an invertible matrix function T C 1 (I, R n n ) is called a kinematic similarity transformation if T and T 1 are bounded. If Ṫ is bounded as well, then it is called a Lyapunov transformation. Theorem (Perron 1930) For every linear ODE ẋ = A(t)x, there exists a Lyapunov transformation to upper triangular form, and this transformation can be chosen to be pointwise orthogonal. Stability analysis for DAEs 12 / 58
13 Characterization of Lyapunov regularity Theorem (Lyapunov 1907) Let B = [b i,j ] C(I, R n n ) be bounded and upper-triangular. Then the system Ṙ = B(t)R, is Lyapunov-regular if and only if all the limits 1 t lim b i,i (s)ds, i = 1, 2,..., n, t t 0 exist and these limits coincide with the Lyapunov exponents λ i, i = 1, 2,..., n. Stability analysis for DAEs 13 / 58
14 Definition Stability of Lyapunov exponents Consider a homogeneous linear system ẋ = A(t)x with upper Lyapunov exponents λ u i and a perturbed system ẋ = [A(t) + A(t)]x with upper Lyapunov exponents νi u, both decreasingly ordered. The upper Lyapunov exponents, λ u 1... λu n, are called stable if for any ε > 0 there exists a δ = δ(ɛ) > 0 such that sup t 0 A(t) < δ implies λ u i ν u i < ɛ, i = 1,..., n. A fundamental solution matrix X is called integrally separated if for i = 1, 2,..., n 1, there exist b > 0 and c > 0 such that for all t, s with t s. X(t)e i X(s)e i X(s)e i+1 X(t)e i+1 ceb(t s), Stability analysis for DAEs 14 / 58
15 Are Lyapunov exponents stable? Theorem (see e.g. Dieci/Van Vleck 2006) i) Integral separation is invariant under Lyapunov transformations (or kinematic similarity transformations). ii) An integrally separated system has pairwise distinct upper (and pairwise distinct lower) Lyapunov exponents. iii) Distinct upper Lyapunov exponents are stable if and only if there exists an integrally separated fundamental solution matrix. iv) Integral separation is a generic property. Stability analysis for DAEs 15 / 58
16 Computation of Lyapunov exponents Theorem (Dieci/Van Vleck 2002) A system ẋ = B(t)x with B bounded, continuous, and triangular, has an integrally separated fundamental solution matrix iff the diagonal elements of B are integrally separated. If the diagonal of B is integrally separated, then Σ L = Σ CL, where with λ l i,i := lim inf t 1 t t 0 Σ CL := n [λ l i,i, λu i,i ], i=1 b i,i (s)ds, λ u i,i := lim sup t 1 t t 0 b i,i (s)ds, i = 1, 2,..., n. Stability analysis for DAEs 16 / 58
17 Bohl exponents, Piers Bohl Definition Let x be a nontrivial solution of ẋ = A(t)x. The (upper) Bohl exponent κ u B (x) of this solution is the greatest lower bound of all those numbers ρ for which there exist numbers N ρ such that x(t) N ρ e ρ(t s) x(s) for any t s 0. If such numbers ρ do not exist, then one sets κ u B (x) = +. Similarly, the lower Bohl exponent κ l B (x) is the least lower bound of all those numbers ρ for which there exist numbers N ρ such that x(t) N ρe ρ (t s) x(s), 0 s t. The interval [κ l B (x), κu B (x)] is called the Bohl interval of the solution. Stability analysis for DAEs 17 / 58
18 Bohl exponents Theorem (Daleckii/Krein 1974) Bohl and Lyapunov exponents are related via The Bohl exponents are given by κ u B (x) = lim sup s,t s κ l B (x) λl (x) λ u (x) κ u B (x). ln x(t) ln x(s), κ l ln x(t) ln x(s) B (x) = lim inf t s s,t s t s t+1 If A(t) is integrally bounded, i.e., if sup t 0 t A(s) ds <, then the Bohl exponents are finite. Stability analysis for DAEs 18 / 58
19 Lyapunov and Bohl exponents Bohl exponents characterize the uniform growth rate of solutions, while Lyapunov exponents simply characterize the growth rate of solutions departing from t = 0. If the greatest bound of upper Lyapunov exponents for all solutions ẋ = A(t)x is negative, then the system is asymptotically stable. If the same holds for the greatest upper bound of the upper Bohl exponents then the system is (uniformly) exponentially stable. Bohl exponents are stable without any extra assumption. Stability analysis for DAEs 19 / 58
20 Sacker-Sell spectra Definition The fundamental matrix solution X of Ẋ = A(t)X is said to admit an exponential dichotomy if there exist a projector P : R n n R n n and constants α, β > 0, as well as K, L 1, such that X(t)PX 1 (s) Ke α(t s), t s, X(t)(I P)X 1 (s) Le β(t s), t s. The Sacker-Sell (or exponential-dichotomy) spectrum Σ S for is given by those values λ R such that the shifted system ẋ λ = [A(t) λi]x λ does not have exponential dichotomy. The complement of Σ S is called the resolvent set. Stability analysis for DAEs 20 / 58
21 Properties of Sacker-Sell spectra Theorem (Sacker/Sell 1978) The property that a system possesses an exponential dichotomy as well as the exponential dichotomy spectrum are preserved under kinematic similarity transformations. Σ S is the union of at most n disjoint closed intervals, and it is stable. Furthermore, the Sacker-Sell intervals contain the Lyapunov intervals, i.e. Σ L Σ S. Stability analysis for DAEs 21 / 58
22 Characterization of Sacker-Sell spectra Theorem (Dieci/Van Vleck 2006) Consider ẋ = B(t)x with B bounded, continuous, and upper triangular. The Sacker-Sell spectrum of this system and that of the corresponding diagonal system coincide. ẋ = D(t)x, with D(t) = diag(b 1,1 (t),..., b n,n (t)), t 0, Thus, one can retrieve Σ S of ẋ = A(t)x from the diagonal elements of the triangularized system. Stability analysis for DAEs 22 / 58
23 Stability Theory for DAEs Lyapunov theory for regular constant coeff. DAEs Stykel 2002 Index 1 systems Ascher/Petzold 1993, Systems of tractability index 2, Tischendorf 1994, Hanke/Macana/März 1998, Systems with properly stated leading term, Higueras/März/Tischendorf 2003, März 1998, März/Riazza 2002, Riazza 2002, Riazza/Tischendorf Lyapunov exponents and regularity, Cong/Nam 2003/2004. Exponential dichotomy in bound. val. problems, Lentini/März Exponential stability and Bohl exponents, Du/Linh 2006, General theory for linear DAEs Linh/M Perturbation theory Linh/M./Van Vleck 2009 Stability analysis for DAEs 23 / 58
24 A crash course in DAE Theory We put E(t)ẋ = A(t)x + f (t) and its derivatives up to order µ into a large DAE M k (t)ż k = N k (t)z k + g k (t), k N 0 for z k = (x, ẋ,..., x (k) ). M 2 = E 0 0 A Ė E 0 Ȧ 2Ë A Ė E, N 2 = A 0 0 Ȧ 0 0 Ä 0 0, z 2 = x ẋ ẍ. Stability analysis for DAEs 24 / 58
25 Theorem (Kunkel/M. 1996) Under some constant rank assumptions, for a square regular linear DAE there exist integers µ, a, d such that: 1. rank M µ (t) = (µ + 1)n a on I, and there exists a smooth matrix function Z 2 with Z T 2 M µ(t) = The first block column Â2 of Z 2 N µ(t) has full rank a so that there exists a smooth matrix function T 2 such that Â2T 2 = rank E(t)T 2 = d = n a and there exists a smooth matrix function Z 1 of size (n, d) with rank Ê1 = d, where Ê1 = Z T 1 E. Stability analysis for DAEs 25 / 58
26 Reduced problem The quantity µ is called the strangeness-index. It describes the smoothness requirements for the inhomogeneity. It generalizes the usual differentiation index to general DAEs (and counts slightly differently). We obtain a numerically computable strangeness-free formulation of the equation with the same solution. Ê 1 (t)ẋ = Â1(t)x + ˆf 1 (t), d differential equations 0 = Â2(t)x + ˆf 2 (t), a algebraic equations where Â1 = Z T 1 A, ˆf 1 = Z T 1 f, and ˆf 2 = Z T 2 g µ. The reduced system is strangeness-free. This is a Remodelling! For the theory we may assume that this has been done. Stability analysis for DAEs 26 / 58
27 Definition Fundamental solution matrices A matrix function X C 1 (I, R n k ), d k n, is called fundamental solution matrix of E(t)Ẋ = A(t)X if each of its columns is a solution to E(t)ẋ = A(t)x and rank X(t) = d, for all t 0. A fundamental solution matrix is said to be maximal if k = n and minimal if k = d, respectively. A maximal fundamental matrix solution, denoted by X(t, s), is called normalized if it satisfies the projected initial condition E(0)(X(0, 0) I) = 0.. Every fundamental solution matrix has exactly d linearly independent columns and a minimal fundamental matrix solution can be easily made maximal by adding n d zero columns. Stability analysis for DAEs 27 / 58
28 Lyapunov exponents for DAEs Definition For a fundamental solution matrix X of a strangeness-free DAE system E(t)ẋ = A(t)x, and for d k n, we introduce λ u i = lim sup t 1 t ln X(t)e i and λ l 1 i = lim inf t t ln X(t)e i, i = 1, 2,..., k. The λ u i, i = 1, 2,..., n, are called (upper) Lyapunov exponents and the intervals [λ l i, λu i ], i = 1, 2,..., d, are called Lyapunov spectral intervals. The DAE system is said to be Lyapunov-regular if λ l i = λ u i, i = 1, 2,..., d. Stability analysis for DAEs 28 / 58
29 Kinematic equivalence Definition Suppose that W C(I, R n n ) and T C 1 (I, R n n ) are pointwise nonsingular matrix functions such that T and T 1 are bounded. Then the transformed DAE system Ẽ(t) x = Ã(t) x, with Ẽ = WET, Ã = WAT WEṪ and x = T x is called globally kinematically equivalent to E(t)ẋ = A(t)x. If, furthermore, also W and W 1 are bounded then we call this a strong global kinematical equivalence transformation. Stability analysis for DAEs 29 / 58
30 Transformation to triangular form Lemma Consider a strangeness-free DAE E(t)ẋ = A(t)x with continuous coefficients and a minimal fundamental solution matrix X. Then there exist pointwise orthogonal matrix functions U C(I, R n n ) and V C 1 (I, R n n ) such [ that ] in EẊ = AX the change of variables R1 X = VR, with R = and R 0 1 C 1 (I, R d d ) and the multiplication from the left with U T leads to the system E d Ṙ 1 = A d R 1, where E d := U T 1 EV 1 is pointwise nonsingular and A d := U T 1 AV 1 U T 1 E V 1. Here U 1, V 1 are the matrix functions consisting of the first d columns of U, V, respectively. Stability analysis for DAEs 30 / 58
31 Theorem Transformation to block form Consider a reduced strangeness-free DAE system. If the coefficient matrices are sufficiently smooth, then there exists an orthogonal matrix function ˆQ C 1 (I, R n n ) such that with ˆx = ˆQ T x, the submatrix E 1 is compressed, i.e., the transformed system has the form [ Ê ] ˆx = [ Â11 Â 12 Â 21 Â 22 ] ˆx, t 0, Furthermore, this system is still strangeness-free and thus Ê11 and Â22 are pointwise nonsingular. The associated underlying (implicit) ODE is, where Âs := Â11 Â12Â 1 22 Â21. Ê 11 ˆx1 = Âsˆx 1, Stability analysis for DAEs 31 / 58
32 Relation between Lyapunov exponents Theorem Let λ u ( 1 22 Â21) be the upper Lyapunov exponent of the matrix function  1 22 Â21. If the boundedness condition λ u ( 1 22 Â21) 0 holds, then the upper Lyapunov exponents of the transformed DAE and its underlying ODE coincide if they are both ordered decreasingly. Stability analysis for DAEs 32 / 58
33 Perturbed DAE systems Consider perturbed DAEs (E(t) + E(t))ẋ = (A(t) + A(t))x, t 0, with special perturbations ( E, A), E, A C(I, R n n ) that are sufficiently smooth and small enough such that by appropriate orthogonal transformation we obtain [ Ê11 + Ê ] [ Â11 + ˆx = Â11 Â 21 + Â21 Â 12 + Â12 Â 22 + Â22 ] ˆx, t 0. If this is the case then we say that the perturbations are admissible. Stability analysis for DAEs 33 / 58
34 Stability of Lyapunov exponents Definition The upper Lyapunov exponents λ u 1... λu d are said to be stable if for any ɛ > 0, there exists δ > 0 such that the conditions sup t Ẽ(t) < δ, sup t Ã(t) < δ on admissable perturbations imply that the perturbed DAE system is strangeness-free and λ u i γ u i < ɛ, i = 1, 2,..., d, where the γi u are the ordered upper Lyapunov exponents of the perturbed system. A DAE system and an admissably perturbed system are called asymptotically equivalent if they are strangeness-free and lim E(t) = lim A(t) = 0. t t Stability analysis for DAEs 34 / 58
35 Asymptotic equivalence Theorem Suppose that the DAE and an admissibly perturbed DAE are asymptotically equivalent. If the Lyapunov exponents are stable then λ u i = γ u i, for all i = 1, 2,..., d, where again the γ u i are the ordered upper Lyapunov exponents of the perturbed system. Stability analysis for DAEs 35 / 58
36 Integral separation Definition A minimal fundamental solution matrix X for a strangeness-free DAE is called integrally separated if for i = 1, 2,..., d 1 there exist b > 0 and c > 0 such that for all t, s with t s 0. X(t)e i X(s)e i X(s)e i+1 X(t)e i+1 ceb(t s), Stability analysis for DAEs 36 / 58
37 Distinct Lyapunov exponents Proposition Consider a strangeness-free DAE. 1. If the DAE is integrally separated then the same holds for any strongly globally kinematically equivalent system. 2. If the DAE is integrally separated, then it has pairwise distinct upper and pairwise distinct lower Lyapunov exponents. 3. If  1 22 Â21 is bounded, then the DAE is integrally separated if and only if and the underlying ODE is integrally separated. Stability analysis for DAEs 37 / 58
38 Stability of exponents Theorem Consider a strangeness-free DAE and its transformed system, satisfying that  1 22 Â21, Â12 1 22, Ê 11, Ê 1 11 (Â11 Â12 1 22 Â21), are bounded. The DAE has d pairwise distinct upper and pairwise distinct lower Lyapunov exponents and they are stable iff it is integrally separated. If  1 22 Â21, Â12 1 22, Ê11, and Ê 1 11 are bounded, then the system has an integrally separated fundamental solution matrix iff its adjoint has. Stability analysis for DAEs 38 / 58
39 Differences between ODEs and DAEs Example For the DAE system ẋ 1 = x 1 + x 2, 0 = x 1 x 3, ẋ 2 = x 2, 0 = x 2 e t x 4, the underlying ODE is not integrally separated, but the Lyapunov exponents are stable and the minimal fundamental solution X(t) = e t te t 0 e t e t te t 0 e 2t is integrally separated. However, the Lyapunov exponents of the DAE ({1, 2}), are not stable., Stability analysis for DAEs 39 / 58
40 Shifted systems Definition Consider a strangeness-free DAE. For a scalar λ R, the DAE system E(t)ẋ = [A(t) λe(t)]x, t 0, is called a shifted DAE system. The shifted DAE transforms as [ Ê ] [ Â11 λê11 Â ˆx = 12 Â 21 Â 22 ] ˆx, t 0, and clearly, the shifted DAE system inherits the strangeness-free property from the original DAE. Stability analysis for DAEs 40 / 58
41 Definition Exponential Dichotomy A strangeness-free DAE system is said to have an exponential dichotomy if for a maximal fundamental solution ˆX(t), there exists a projection matrix P R d d and constants α, β > 0, and K, L 1 such that [ ] P 0 ˆX(t) ˆX 0 0 (s) Ke α(t s), t s, [ ] ˆX(t) Id P 0 ˆX 0 0 (s) Leβ(t s), t s. Here X (s) is a reflexive generalized inverse. Theorem A strangeness-free DAE system has an exponential dichotomy if and only if in the transformed system  1 22 Â21 is bounded and the underlying ODE has an exponential dichotomy. Stability analysis for DAEs 41 / 58
42 Sacker-Sell spectra Definition The Sacker-Sell (or exponential dichotomy) spectrum of a strangeness-free DAE system is defined by Σ S := {λ R, the shifted DAE does not have an exponential dichotomy}. The complement of Σ S is called the resolvent set. The Sacker-Sell spectrum of a DAE system does not depend on the choice of the orthogonal change of basis that brings it to the transformed system. Stability analysis for DAEs 42 / 58
43 Sacker-Sell spectra Theorem Consider a DAE and suppose that in the transformed DAE Â 1 22 Â21 is bounded. The Sacker-Sell spectrum is exactly the Sacker-Sell spectrum of the underlying ODE. It consists of at most d closed intervals. If the Sacker-Sell spectrum of the DAE system is given by d disjoint closed intervals, then there exists a minimal fundamental solution matrix ˆX with integrally separated columns. In this case it is given exactly by the d (not necessarily disjoint) Bohl intervals associated with the columns of ˆX and Σ L Σ S. Stability analysis for DAEs 43 / 58
44 Stability of Sacker-Sell spectra Theorem Consider a strangeness-free DAE system  1 22 Â21, Â12 1 22, Ê 11, Ê 1 11 (Â11 Â12 1 22 Â21), are bounded and for k d, Σ S = k i=1 [a i, b i ]. Consider an admissible perturbation. Let ε > 0 be sufficiently small such that b i + ε < a i+1 ε for some i, 0 i k. For i = 0 and i = k, set b 0 = and a k+1 =, respectively. Then, there exists δ > 0 such that the inequality max{sup t E(t), sup t A(t) } δ, implies that the interval (b i + ε, a i+1 ε) is contained in the resolvent of the perturbed DAE system. Stability analysis for DAEs 44 / 58
45 Stability of Sacker-Sell spectra Corollary Let the assumptions of the last Theorem hold and let ε > 0 be sufficiently small such that b i 1 + ε < a i ε < a i b i < b i + ε < a i+1 ε, for 0 i k. For i = 0 and i = k, set b 0 = and a k+1 =, respectively. Then, there exists δ > 0 such that the inequality max{sup t Ẽ(t) }, sup Ã(t) δ, implies that the Sacker-Sell interval [a i, b i ] either remains a Sacker-Sell interval under the perturbation or it is possibly split into several new intervals, but the smallest left end-point and the largest right end-point stay in the interval [a i ε, b i + ε]. t Stability analysis for DAEs 45 / 58
46 Numerical methods For the numerical computation we have first have to obtain the strangeness-free form of E(t), A(t). It can be obtained pointwise for every t via the FORTRAN code GELDA Kunkel/M./Rath/Weickert 1997 or the corresponding MATLAB version Kunkel/M./Seidel It comes in the form [ E1 (t) 0 ] [ A1 (t) ẋ = A 2 (t) ] x where A 2 is full row rank. Stability analysis for DAEs 46 / 58
47 Smooth QR factorizations Kunkel/M. 1991, Dieci/Eirola 1999 Suppose that the original DAE has sufficiently smooth coefficients. There exists a pointwise nonsingular, upper triangular matrix function Ã22 C 1 (I, R (n d) (n d) ) and a pointwise orthogonal matrix function Q C 1 (I, R n n ) such that A 2 = [ 0 Ã22 ] ˆQ. To make the factorization unique and to obtain smoothness, we require the diagonal elements of Ã22 to be positive. Alternatively we can derive differential equations for Q (or its Householder factors) and to solve the corresponding initial value problems. Stability analysis for DAEs 47 / 58
48 Transformed DAE The transformation x = Q T x leads to [ ] [ ] [ Ẽ11 Ẽ 12 E1 Ã11 Ã = Q, Ã 22 ] = [ A1 A 2 ] Q [ E1 0 ] Q. To evaluate Q at time t, we may use either a finite difference formula or the smooth QR method derived in Kunkel/M The solution component x 2 associated with the algebraic equations is simply 0, thus we only have to deal with x 1. Stability analysis for DAEs 48 / 58
49 Basic Idea for Computing Exponents Determine for every point t E = [e ij ] = P T Ẽ 11 Q, A = [a ij ] = P T Ã 11 Q P T Ẽ 11 Q = P T Ã 11 Q EQ T Q, such that E, A are upper triangular. Determine strictly lower triangular part of the skew symmetric S(Q) = Q T Q by corresponding part of E 1 P T Ã 11 Q and the remaining part by skew-symmetry. Determine P and E via a smooth QR-factorization Ẽ11Q = PE. Keep orthogonality via orthogonal integrators Hairer/Lubich/Wanner 2002 or projected ODE integrators Dieci/Van Vleck Compute the spectral intervals from E 1 (t)ṙ1 = A 1 (t)r 1, t I, where R 1 is the fundamental solution matrix of the triangularized underlying implicit ODE. Stability analysis for DAEs 49 / 58
50 Continuous QR algorithm Compute a smooth QR factorization of A 2 [ ] [ E1 U1 T Ẽ12 A1 U ż = 1 T Ã Ã 22 with E 1, A 1, Ã22 upper triangular. Apply ODE methods of Dieci/Van Vleck to Compute λ i (t j ) = 1 t j ln[r 1 (t j )] i,i = 1 t j ln E 1 (t)ṙ1 = A 1 (t)r 1, t I, ] z, j [Θ l ] i,i = 1 j ln[θ l ] i,i, i = 1, 2,..., d. t j l=1 Solve optimization problems inf τ t T λ i (t) and sup τ t T λ i (t), i = 1, 2,..., d for a given τ (0, T ). l=1 Stability analysis for DAEs 50 / 58
51 Discrete QR algorithm Take a mesh 0 = t 0 < t 1 <... < t N 1 < t N = T. Compute the fundamental solution X [j] on [t j 1, t j ] by solving EẊ [j] = AX [j], t j 1 t t j, X [j] (t j 1 ) = χ j 1, using the DAE integrator GELDA. Determine QR factorizations [ Q(t j ) T X [j] Zj (t j ) = 0 Compute λ i (t j ) = 1 t j ln[r 1 (t j )] i,i = 1 t j ln ], Z j = Q j Θ j, j = 1, 2,..., N j [Θ l ] i,i = 1 j ln[θ l ] i,i, i = 1, 2,..., d, t j l=1 Solve the optimization problems inf τ t T λ i (t) and sup τ t T λ i (t), i = 1, 2,..., d for a given τ (0, T ). Stability analysis for DAEs 51 / 58 l=1
52 Lyapunov exp. via cont. QR-Euler method Lyapunov regular 2 2 DAE λ 1 = 5, λ 2 = 0. T h λ 1 λ 2 CPU(s) Stability analysis for DAEs 52 / 58
53 Lyapunov exp. via disc. QR-Euler method Lyapunov regular 2 2 DAE λ 1 = 5, λ 2 = 0. T h λ 1 λ 2 CPU(s) Stability analysis for DAEs 53 / 58
54 Lyapunov exp. via cont. QR-Euler method Lyapunov non regular 2 2 DAE with Lyapunov intervals [ 1, 1], [ 6, 4]. T t 0 h [λ l 1, λu 1 ] [λl 2, λu 2 ] CPU(s) [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] Stability analysis for DAEs 54 / 58
55 Sacker-Sell interv. via cont. QR-Euler Sacker-Sell intervals [ 2, 2] and [ 5 2, 5 + 2]. T H h [κ l 1, κu 1 ] [κl 2, κu 2 ] CPU(s) [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] [ , ] Stability analysis for DAEs 55 / 58
56 Conclusions The classical Theory of Lyapunov/Bohl/Sacker-Sell has been extended to linear DAEs with variable coefficients. Boundedness conditions and strangeness-free formulations are the key tools. In principle we can compute spectral intervals. Numerical methods for computing the Sacker-Sell spectra of DAEs extending work of Dieci/Van Vleck. They are expensive. Perturbation theory of Dieci/Van Vleck for ODEs has been extended and the methods have been modified to deal only with partial exponents (e.g. the largest Sacker-Sell interval) Linh/M./Van Vleck Dec SVD based methods for more accurate spectra. Stability analysis for DAEs 56 / 58
57 Future work Extension to analysis of nonlinear systems Production code for classes special classes of DAEs Extension to operator DAEs/PDEs Stability analysis for DAEs 57 / 58
58 Thank you very much for your attention. Stability analysis for DAEs 58 / 58
Differential-algebraic equations. Control and Numerics V
Differential-algebraic equations. Control and Numerics V Volker Mehrmann Institut für Mathematik Technische Universität Berlin with V.H. Linh, P. Kunkel, E. Van Vleck DFG Research Center MATHEON Mathematics
More informationApproximation of spectral intervals and associated leading directions for linear DAEs via smooth SVDs*
Approximation of spectral intervals and associated leading directions for linear DAEs via smooth SVDs* (supported by Alexander von Humboldt Foundation) Faculty of Mathematics, Mechanics and Informatics
More informationOptimal 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 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 informationBohl exponent for time-varying linear differential-algebraic equations
Bohl exponent for time-varying linear differential-algebraic equations Thomas Berger Institute of Mathematics, Ilmenau University of Technology, Weimarer Straße 25, 98693 Ilmenau, Germany, thomas.berger@tu-ilmenau.de.
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 informationNonlinear 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 informationLecture 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 information1. Find the solution of the following uncontrolled linear system. 2 α 1 1
Appendix B Revision Problems 1. Find the solution of the following uncontrolled linear system 0 1 1 ẋ = x, x(0) =. 2 3 1 Class test, August 1998 2. Given the linear system described by 2 α 1 1 ẋ = x +
More information8 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 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 informationChapter 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 information6 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 informationNOTES 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 informationOn the dynamics of strongly tridiagonal competitive-cooperative system
On the dynamics of strongly tridiagonal competitive-cooperative system Chun Fang University of Helsinki International Conference on Advances on Fractals and Related Topics, Hong Kong December 14, 2012
More informationLinear ODEs. Existence of solutions to linear IVPs. Resolvent matrix. Autonomous linear systems
Linear ODEs p. 1 Linear ODEs Existence of solutions to linear IVPs Resolvent matrix Autonomous linear systems Linear ODEs Definition (Linear ODE) A linear ODE is a differential equation taking the form
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationLecture notes: Applied linear algebra Part 1. Version 2
Lecture notes: Applied linear algebra Part 1. Version 2 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 1 Notation, basic notions and facts 1.1 Subspaces, range and
More informationDifferential-algebraic equations. Control and Numerics I
Differential-algebraic equations. Control and Numerics I Volker Mehrmann Institut für Mathematik Technische Universität Berlin P. Kunkel DFG Research Center MATHEON Mathematics for key technologies 8.3.10
More informationExamples 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 informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationPeriodic Linear Systems
Periodic Linear Systems Lecture 17 Math 634 10/8/99 We now consider ẋ = A(t)x (1) when A is a continuous periodic n n matrix function of t; i.e., when there is a constant T>0 such that A(t + T )=A(t) for
More information21 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 informationComputing Sacker-Sell spectra in discrete time dynamical systems
Computing Sacker-Sell spectra in discrete time dynamical systems Thorsten Hüls Fakultät für Mathematik, Universität Bielefeld Postfach 100131, 33501 Bielefeld, Germany huels@math.uni-bielefeld.de March
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 informationLecture Notes for Math 524
Lecture Notes for Math 524 Dr Michael Y Li October 19, 2009 These notes are based on the lecture notes of Professor James S Muldowney, the books of Hale, Copple, Coddington and Levinson, and Perko They
More informationEIGENVALUE PROBLEMS. Background on eigenvalues/ eigenvectors / decompositions. Perturbation analysis, condition numbers..
EIGENVALUE PROBLEMS Background on eigenvalues/ eigenvectors / decompositions Perturbation analysis, condition numbers.. Power method The QR algorithm Practical QR algorithms: use of Hessenberg form and
More informationLMI 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 information1 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 information16. 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 informationPh.D. Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2) EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified.
PhD Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2 EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified Problem 1 [ points]: For which parameters λ R does the following system
More informationTHEOREM OF OSELEDETS. We recall some basic facts and terminology relative to linear cocycles and the multiplicative ergodic theorem of Oseledets [1].
THEOREM OF OSELEDETS We recall some basic facts and terminology relative to linear cocycles and the multiplicative ergodic theorem of Oseledets []. 0.. Cocycles over maps. Let µ be a probability measure
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationStability 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 informationLecture 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 information7 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 informationThe 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 informationCayley-Hamilton Theorem
Cayley-Hamilton Theorem Massoud Malek In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n Let A be an n n matrix Although det (λ I n A
More informationModelling, Simulation and Control in Key Technologies
Modelling, Simulation and Control in Key Technologies Volker Mehrmann TU Berlin, Institut für Mathematik DFG Research Center MATHEON Mathematics for key technologies 09.02.11, Delft Overview 1 Introduction
More informationBalanced 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 informationMath Fall Final Exam
Math 104 - Fall 2008 - Final Exam Name: Student ID: Signature: Instructions: Print your name and student ID number, write your signature to indicate that you accept the honor code. During the test, you
More informationIntroduction 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 informationExponential 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 informationON THE ERROR IN COMPUTING LYAPUNOV EXPONENTS BY QR METHODS
Draft version of September 2, 2005 ON THE ERROR IN COMPUTING LYAPUNOV EXPONENTS BY QR METHODS LUCA DIECI AND ERIK S. VAN VLECK Abstract. We consider the error introduced using QR methods to approximate
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationA note on linear differential equations with periodic coefficients.
A note on linear differential equations with periodic coefficients. Maite Grau (1) and Daniel Peralta-Salas (2) (1) Departament de Matemàtica. Universitat de Lleida. Avda. Jaume II, 69. 251 Lleida, Spain.
More informationMath 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 informationNonlinear stabilization via a linear observability
via a linear observability Kaïs Ammari Department of Mathematics University of Monastir Joint work with Fathia Alabau-Boussouira Collocated feedback stabilization Outline 1 Introduction and main result
More informationLinGloss. A glossary of linear algebra
LinGloss A glossary of linear algebra Contents: Decompositions Types of Matrices Theorems Other objects? Quasi-triangular A matrix A is quasi-triangular iff it is a triangular matrix except its diagonal
More informationEE363 homework 7 solutions
EE363 Prof. S. Boyd EE363 homework 7 solutions 1. Gain margin for a linear quadratic regulator. Let K be the optimal state feedback gain for the LQR problem with system ẋ = Ax + Bu, state cost matrix Q,
More informationTopic # /31 Feedback Control Systems. Analysis of Nonlinear Systems Lyapunov Stability Analysis
Topic # 16.30/31 Feedback Control Systems Analysis of Nonlinear Systems Lyapunov Stability Analysis Fall 010 16.30/31 Lyapunov Stability Analysis Very general method to prove (or disprove) stability of
More informationOn linear quadratic optimal control of linear time-varying singular systems
On linear quadratic optimal control of linear time-varying singular systems Chi-Jo Wang Department of Electrical Engineering Southern Taiwan University of Technology 1 Nan-Tai Street, Yungkung, Tainan
More informationHybrid Control and Switched Systems. Lecture #11 Stability of switched system: Arbitrary switching
Hybrid Control and Switched Systems Lecture #11 Stability of switched system: Arbitrary switching João P. Hespanha University of California at Santa Barbara Stability under arbitrary switching Instability
More informationStabilization of persistently excited linear systems
Stabilization of persistently excited linear systems Yacine Chitour Laboratoire des signaux et systèmes & Université Paris-Sud, Orsay Exposé LJLL Paris, 28/9/2012 Stabilization & intermittent control Consider
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationNonlinear Programming Algorithms Handout
Nonlinear Programming Algorithms Handout Michael C. Ferris Computer Sciences Department University of Wisconsin Madison, Wisconsin 5376 September 9 1 Eigenvalues The eigenvalues of a matrix A C n n are
More informationQualifying Exam Math 6301 August 2018 Real Analysis I
Qualifying Exam Math 6301 August 2018 Real Analysis I QE ID Instructions: Please solve the following problems. Work on your own and do not discuss these problems with your classmates or anyone else. 1.
More informationLINEAR EQUATIONS OF HIGHER ORDER. EXAMPLES. General framework
Differential Equations Grinshpan LINEAR EQUATIONS OF HIGHER ORDER. EXAMPLES. We consider linear ODE of order n: General framework (1) x (n) (t) + P n 1 (t)x (n 1) (t) + + P 1 (t)x (t) + P 0 (t)x(t) = 0
More informationODE Final exam - Solutions
ODE Final exam - Solutions May 3, 018 1 Computational questions (30 For all the following ODE s with given initial condition, find the expression of the solution as a function of the time variable t You
More informationOptimization Theory. Linear Operators and Adjoints
Optimization Theory Linear Operators and Adjoints A transformation T. : X Y y Linear Operators y T( x), x X, yy is the image of x under T The domain of T on which T can be defined : D X The range of T
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko
More information1 9/5 Matrices, vectors, and their applications
1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric
More informationPutzer 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 information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationComponentwise perturbation analysis for matrix inversion or the solution of linear systems leads to the Bauer-Skeel condition number ([2], [13])
SIAM Review 4():02 2, 999 ILL-CONDITIONED MATRICES ARE COMPONENTWISE NEAR TO SINGULARITY SIEGFRIED M. RUMP Abstract. For a square matrix normed to, the normwise distance to singularity is well known to
More informationNonlinear palindromic eigenvalue problems and their numerical solution
Nonlinear palindromic eigenvalue problems and their numerical solution TU Berlin DFG Research Center Institut für Mathematik MATHEON IN MEMORIAM RALPH BYERS Polynomial eigenvalue problems k P(λ) x = (
More informationHybrid Control and Switched Systems. Lecture #7 Stability and convergence of ODEs
Hybrid Control and Switched Systems Lecture #7 Stability and convergence of ODEs João P. Hespanha University of California at Santa Barbara Summary Lyapunov stability of ODEs epsilon-delta and beta-function
More informationPart IB Numerical Analysis
Part IB Numerical Analysis Definitions Based on lectures by G. Moore Notes taken by Dexter Chua Lent 206 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationarxiv: v3 [math.ds] 22 Feb 2012
Stability of interconnected impulsive systems with and without time-delays using Lyapunov methods arxiv:1011.2865v3 [math.ds] 22 Feb 2012 Sergey Dashkovskiy a, Michael Kosmykov b, Andrii Mironchenko b,
More informationStability of Nonlinear Systems An Introduction
Stability of Nonlinear Systems An Introduction Michael Baldea Department of Chemical Engineering The University of Texas at Austin April 3, 2012 The Concept of Stability Consider the generic nonlinear
More informationSection 8.2 : Homogeneous Linear Systems
Section 8.2 : Homogeneous Linear Systems Review: Eigenvalues and Eigenvectors Let A be an n n matrix with constant real components a ij. An eigenvector of A is a nonzero n 1 column vector v such that Av
More informationA NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES
Journal of Mathematical Sciences: Advances and Applications Volume, Number 2, 2008, Pages 3-322 A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Department of Mathematics Taiyuan Normal University
More informationSolution of Linear State-space Systems
Solution of Linear State-space Systems Homogeneous (u=0) LTV systems first Theorem (Peano-Baker series) The unique solution to x(t) = (t, )x 0 where The matrix function is given by is called the state
More informationNormed & Inner Product Vector Spaces
Normed & Inner Product Vector Spaces ECE 174 Introduction to Linear & Nonlinear Optimization Ken Kreutz-Delgado ECE Department, UC San Diego Ken Kreutz-Delgado (UC San Diego) ECE 174 Fall 2016 1 / 27 Normed
More informationECE 275A Homework #3 Solutions
ECE 75A Homework #3 Solutions. Proof of (a). Obviously Ax = 0 y, Ax = 0 for all y. To show sufficiency, note that if y, Ax = 0 for all y, then it must certainly be true for the particular value of y =
More informationMET Workshop: Exercises
MET Workshop: Exercises Alex Blumenthal and Anthony Quas May 7, 206 Notation. R d is endowed with the standard inner product (, ) and Euclidean norm. M d d (R) denotes the space of n n real matrices. When
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationNumerical integration of DAE s
Numerical integration of DAE s seminar Sandra Allaart-Bruin sbruin@win.tue.nl seminar p.1 Seminar overview February 18 Arie Verhoeven Introduction to DAE s seminar p.2 Seminar overview February 18 Arie
More informationThis can be accomplished by left matrix multiplication as follows: I
1 Numerical Linear Algebra 11 The LU Factorization Recall from linear algebra that Gaussian elimination is a method for solving linear systems of the form Ax = b, where A R m n and bran(a) In this method
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More information33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM
33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM (UPDATED MARCH 17, 2018) The final exam will be cumulative, with a bit more weight on more recent material. This outline covers the what we ve done since the
More informationDiscrete and continuous dynamic systems
Discrete and continuous dynamic systems Bounded input bounded output (BIBO) and asymptotic stability Continuous and discrete time linear time-invariant systems Katalin Hangos University of Pannonia Faculty
More information3 Gramians and Balanced Realizations
3 Gramians and Balanced Realizations In this lecture, we use an optimization approach to find suitable realizations for truncation and singular perturbation of G. It turns out that the recommended realizations
More informationNonlinear 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 informationKrylov Subspace Methods for Nonlinear Model Reduction
MAX PLANCK INSTITUT Conference in honour of Nancy Nichols 70th birthday Reading, 2 3 July 2012 Krylov Subspace Methods for Nonlinear Model Reduction Peter Benner and Tobias Breiten Max Planck Institute
More informationTwo Results About The Matrix Exponential
Two Results About The Matrix Exponential Hongguo Xu Abstract Two results about the matrix exponential are given. One is to characterize the matrices A which satisfy e A e AH = e AH e A, another is about
More informationLecture 7. Econ August 18
Lecture 7 Econ 2001 2015 August 18 Lecture 7 Outline First, the theorem of the maximum, an amazing result about continuity in optimization problems. Then, we start linear algebra, mostly looking at familiar
More informationLinear Ordinary Differential Equations
MTH.B402; Sect. 1 20180703) 2 Linear Ordinary Differential Equations Preliminaries: Matrix Norms. Denote by M n R) the set of n n matrix with real components, which can be identified the vector space R
More informationAn 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 informationDraft. Lecture 01 Introduction & Matrix-Vector Multiplication. MATH 562 Numerical Analysis II. Songting Luo
Lecture 01 Introduction & Matrix-Vector Multiplication Songting Luo Department of Mathematics Iowa State University MATH 562 Numerical Analysis II Songting Luo ( Department of Mathematics Iowa State University[0.5in]
More informationIterative Solution of a Matrix Riccati Equation Arising in Stochastic Control
Iterative Solution of a Matrix Riccati Equation Arising in Stochastic Control Chun-Hua Guo Dedicated to Peter Lancaster on the occasion of his 70th birthday We consider iterative methods for finding the
More informationLinear Hyperbolic Systems
Linear Hyperbolic Systems Professor Dr E F Toro Laboratory of Applied Mathematics University of Trento, Italy eleuterio.toro@unitn.it http://www.ing.unitn.it/toro October 8, 2014 1 / 56 We study some basic
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko
More informationOn Linear-Quadratic Control Theory of Implicit Difference Equations
On Linear-Quadratic Control Theory of Implicit Difference Equations Daniel Bankmann Technische Universität Berlin 10. Elgersburg Workshop 2016 February 9, 2016 D. Bankmann (TU Berlin) Control of IDEs February
More informationLecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?
KTH ROYAL INSTITUTE OF TECHNOLOGY Norms for vectors and matrices Why? Lecture 5 Ch. 5, Norms for vectors and matrices Emil Björnson/Magnus Jansson/Mats Bengtsson April 27, 2016 Problem: Measure size of
More informationDepartment of Mathematics IIT Guwahati
Stability of Linear Systems in R 2 Department of Mathematics IIT Guwahati A system of first order differential equations is called autonomous if the system can be written in the form dx 1 dt = g 1(x 1,
More informationThere is a more global concept that is related to this circle of ideas that we discuss somewhat informally. Namely, a region R R n with a (smooth)
82 Introduction Liapunov Functions Besides the Liapunov spectral theorem, there is another basic method of proving stability that is a generalization of the energy method we have seen in the introductory
More informationLinear algebra properties of dissipative Hamiltonian descriptor systems
Linear algebra properties of dissipative Hamiltonian descriptor systems C. Mehl V. Mehrmann M. Wojtylak January 6, 28 Abstract A wide class of matrix pencils connected with dissipative Hamiltonian descriptor
More information4.2. ORTHOGONALITY 161
4.2. ORTHOGONALITY 161 Definition 4.2.9 An affine space (E, E ) is a Euclidean affine space iff its underlying vector space E is a Euclidean vector space. Given any two points a, b E, we define the distance
More information