A normal form for pure differential algebraic systems

Size: px
Start display at page:

Download "A normal form for pure differential algebraic systems"

Transcription

1 A normal form for pure differential algebraic systems Stephan Trenn December 2th 27 Abstract: In this paper linear time-invariant differential algebraic equations (DAEs) are studied; the focus is on pure DAEs which are DAEs without an ordinary differential equation (ODE) part. A normal form for pure DAEs is given which is similar to the Byrnes-Isidori normal form for ODEs. Furthermore, the normal form exhibits a Kalman-like decomposition into impulse-controllable- and impulse-observable states. This leads to a characterization of impulse-controllability and -observability. Keywords: differential algebraic equation, normal form, impulse controllability, impulse observability MSC (Scheme=msc2): 34A9, 34C2 Introduction Differential algebraic equations (DAEs) of the form Eẋ = Ax + bu, y = cx, () (c,e,a,b) R n R n n R n n R n, n N, play an important role in systems theory. Those equations arise when modelling for example electrical circuits, mechanical systems, or, in general, dynamical systems with additional algebraic conditions. Interconnected ordinary differential equations (ODEs) can also be desribed as a DAE. There is a wide range of literature for DAEs of the form (), i.e. linear time-invariant DAEs, e.g. (Campbell 98, Campbell 982, Dai 989, Rabier & Rheinboldt 22, Kunkel & Mehrmann 26). Normal or condensed forms for DAEs have always been a research topic and the most famous normal form is the Kronecker normal form or, if one considers a special class of DAEs, the Weierstraß normal form. The latter is basically a decoupling into an ODE and a pure DAE. Most normal or condensed forms concentrate on the two matrices E and A and not on the input and output vectors b and c. But for control problems normal forms must incorporate the input and output. For ODEs the Byrnes-Isidori normal form (which focus on the relative degree (Isidori 995, p. 65), see also (Ilchmann, Ryan & Townsend 27, Lem. 3.5)) and the Kalman-decomposition (which focus on controllable and observable sub-states (Kalman 962)) are examples of such normal forms. This paper gives a normal form for pure DAEs which can be seen as a generalization of the Byrnes-Isidori normal form combined with a Kalman-like decomposition. In fact, the state space is separated into impulse-controllable and -observable sub-states, see Theorem 24. Compared to a similar decomposition proposed in (Dai 989, p. 52) (without proof) the normal form from

2 Theorem 2 is more specific and allows for a better analysis. There are already results on normal or condensed forms of DAEs available, e.g. (Loiseau, Özçaldiran, Malabre & Karcanias 99), (Rath 997), (Kunkel & Mehrmann 26). But none of these result focus on the relative degree or on impulse-controllable and -observable states. In addition they partly use a different concept of equivalence which leads to other normal forms. On the other hand some of these results go much further as the results in this paper because rectangular (in particular non-regular) DAEs with time-varying coefficients are considered. This paper is structured as follows. First, some preliminaries (Section 2) are given, in particular the subtle difference between DAEs and differential algebraic systems (DASs) is explained. Section 3 deals with the transfer function of DASs and realization theory, in particular some specific minimal realizations of pure DASs are given. Before stating the main results in Section 5, impulse-controllability and -observability are revisited in Section 4, the invariants impulse-controllability-index and impulse-observability-index are defined. The main result is the normal form given in Theorem 2. This normal form can be used to give new characterizations of impulse-controllability and -observability, see Theorem 24. The following notation will be used throughout this paper. N and R are the natural and real numbers, R[s is the ring of polynomials and R(s) is the field of rational functions with real coefficients. For a polynomial p(s) R[s the degree of p(s) is denoted by deg p(s). The matrix I R n n is the identity matrix[ of size n N being clear from the context. For two square A matrizes A,B let diag (A,B) :=. For n N row vectors c B,c 2,...,c n R m of the c c 2 same length m N let [c /c 2 /... /c n :=. Rn m. The rank, image, and kernel of matrix A is denoted by rka, im A, and ker A, resp. c n 2 Preliminaries: Differential algebraic systems (DASs) In this work only differential algebraic systems (DASs), i.e. matrix-tuples (see Definition ), are considered and not differential algebraic equations (DAEs) like (). The reason is that for the latter one has always to define what the variable x should be. In particular it would be necessary to specify an appropriate solution space. Since the results of this work are independent of the chosen solution space, any discussion about solution spaces will be avoided by considering DASs instead of DAEs. Definition (DASs, regular and pure DASs, ODSs) A differential algebraic system (DAS) with state space dimension n N is a tupel (c,e,a,b) R n R n n R n n R n. The space of all DASs with state space dimension n is Σ n := R n R n n R n n R n. The space of regular DASs with state space dimension n N is Σ reg n := { (c,e,a,b) Σ n det(es A) R[s\{} }. 2

3 The space of pure DASs is Σ pure n := { (c,e,a,b) Σ n deta A E is nilpotent }. The space of ordinary differential systems (ODSs) is Σ ODS n := { (c,e,a,b) Σ n det E }. Remark 2 (i) Every pure DAS and every ODS is regular, i.e. for all n N Σ pure n Σ reg n and Σ ODS n Σ reg n (ii) No pure DAS is an ODS and vice versa, i.e. for all n N. Σ pure n Σ ODS n (iii) For invertible A R n n and some E R n n, n N, the matrix A E is nilpotent if, and only if, EA is nilpotent, hence = Σ pure n = { (c,e,a,b) Σ n deta EA is nilpotent }. Definition 3 (Equivalence) Two DASs (c,e,a,b ) Σ n and (c 2,E 2,A 2,b 2 ) Σ n2, n,n 2 N, are called equivalent, written (c,e,a,b ) (c 2,E 2,A 2,b 2 ), if, and only if, n = n 2 =: n and there exist invertible matrices S,T R n n such that Note that is an equivalence relation. (c 2,E 2,A 2,b 2 ) = (c T,SE T,SA T,Sb ). Remark 4 Every regular DAS (c,e,a,b) is equivalent to a DAS in Weierstrass form ( [ [ [ ) I J b [ c c 2,,, N I where N is a nilpotent matrix ((Weierstraß 867), see also (Kunkel & Mehrmann 26, Thm. 2.7)). Clearly, this is a (unique) decomposition into an ODS (also called slow system) and a pure DAS (also known as the fast system). b 2 Proposition 5 For all n N { Σ pure n = (c,e,a,b) Σ n (ĉ,n,i,ˆb) Σ pure n : (c,e,a,b) (ĉ,n,i,ˆb) }. Proof. By definition, every pure DAE (c,e,a,b) Σ n is equivalent to (c,a E,I,A b) = (ĉ,n,i,ˆb) Σ pure n. If (c,e,a,b) Σ n is equivalent to (ĉ,n,i,ˆb) Σ pure n then there exist invertible matrices S,T R n n such that A = SIT = ST and E = SNT. In particular, A is invertible and A E = T NT. By assumption, N is nilpotent and hence A E is nilpotent which implies that (c,e,a,b) is pure. Proposition 5 (see also the forthcoming Proposition 5) justifies that every pure DASs can be considered to be in the standard form (c,n,i,b), where N is a nilpotent matrix. qed 3

4 3 Transfer function and minimal realization In this section transfer functions of DASs and minimal realizations are studied. From the theory of ODEs it is well known, that the transfer function is a useful tool to study the input-output behaviour of a linear system. Furthermore the definition of the (negative) relative degree is based on transfer functions and the negative relative degree is important for the normal form of pure DASs given in this paper (Theorem 2). It will also turn out that one of the given minimal realization is a part of this normal form. Definition 6 (Transfer function and IO-equivalence) The transfer function of a regular DAS (c,e,a,b) Σ reg n, n N, is the rational function g(s) R(s) given by g(s) = c(es A) b. Two regular DASs (c,e,a,b ) Σ reg n, n N, and (c 2,E 2,A 2,b 2 ) Σ reg n 2, n 2 N, are called IO-equivalent, written (c,e,a,b ) (c 2,E 2,A 2,b 2 ), if, and only if, their corresponding transfer functions g (s) and g 2 (s) are equal. Remark 7 For two regular DASs (c,e,a,b ) Σ reg n, n N, and (c 2,E 2,A 2,b 2 ) Σ reg n 2, n 2 N it follows from the definition that (c,e,a,b ) (c 2,E 2,A 2,b 2 ) (c,e,a,b ) (c 2,E 2,A 2,b 2 ). The converse is in general not true, but this question is strongly related to minimal realizations, impulse-controllability and (impulse-)observability, which are studied later in this work (see Corollary 26 and Remark 27). Remark 8 (i) The transfer function of an ODS is strictly proper (i.e. the degree of the numerator is smaller than the degree of the denominator). (ii) The transfer function of a pure DAS is a polynomial, in particular if the pure DAS is in standard form (c,n,i,b) Σ pure n, n N, the transfer function is given by n g(s) = cn i bs i. For convenience, if n = the transfer function is defined as g(s). Definition 9 A realization of a transfer function g(s) R(s) is a regular DAS (c,e,a,b) Σ reg n, n N, with g(s) = c(es A) b. A realization is called minimal if, and only if, there exists no other realization with smaller state-space dimension. For a given transfer function it is an interesting question how a realization might look, what the minimal dimension is and if there are some standard realizations. For ODEs these questions are studied in realization theory and most relevant questions are answered. The next propositions shows that for the realization theory of DASs one can basically concentrate on pure DASs. i= 4

5 Proposition Let g(s) = p(s) q(s) R(s), then there exists unique p (s),p 2 (s) R[s with deg p 2 (s) < deg q(s) such that g(s) = p (s) + p 2(s) q(s). If (c,e,a,b ) Σ pure n, n N and (c 2,E 2,A 2,b 2 ) Σ ODS n 2, n 2 N are realizations of p (s) and p 2(s) q(s), resp., then (c,e,a,b) := ( (c,c 2 ),diag (E,E 2 ),diag (A,A 2 ),(b,b 2 ) ) Σ reg n +n 2 is a realization of g(s). Conversely, every realization of g(s) is equivalent to (c,e,a,b) = ( (c,c 2 ),diag (E,E 2 ),diag (A,A 2 ),(b,b 2 ) ) Σ reg n +n 2, where (c,e,a,b ) Σ pure n, n N, is a pure realization of p (s) and (c 2,E 2,A 2,b 2 ) Σ ODS n 2, n 2 N, is an ODS realizations of p 2(s) q(s) (n = or n 2 = is possible). Furthermore, in both cases (c i,e i,a i,b i ), i =,2, are minimal realizations if, and only if, (c, E, A, b) is a minimal realization. Proof. The unique decomposition g(s) = p (s)+ p 2(s) g(s) with deg p 2(s) < deg q(s) is a well known algebraic result (Euclidian algorithm for polynomials). From the definition of the transfer function it easily follows that (c,e,a,b) is a realization of g(s) if (c,e,a,b ) and (c 2,E 2,A 2,b 2 ), resp. Conversely, observe that every regular DAS is equivalent to a DAS in Weierstraß form (see Remark 4), which yields the assertion of the proposition. It remains to show the minimality property. Clearly, if (c,e,a,b) is minimal then (c i,e i,a i,b i ), i =,2, are minimal, too. To show that (c,e,a,b) is minimal if (c i,e i,a i,b i ), i =,2, are are realizations of p (s) and p 2(s) q(s) minimal, consider any realization (ĉ,ê,â,ĉ) Σreg ˆn with ˆn N. Then this realization is equivalent to a DAS in Weierstraß form with dimension ˆn, whose pure DAS and ODS parts have dimensions ˆn N and ˆn 2 N, resp. Let the transfer function of the pure DAS part be the polynomial ˆp (s) R[s and let the transfer function of the ODS part be the strictly proper rational function ˆp 2(s) ˆq(s) R(s). Since ˆp (s)+ ˆp 2(s) ˆq(s) = g(s) = p (s)+ p 2 q(s) it follows that ˆp (s) = p (s) and ˆp 2(s) ˆq(s) = p 2(s) q(s). This implies, by the minimality assumption, that ˆn i n i, i =,2, hence ˆn = ˆn + ˆn 2 n + n 2, i.e. the given realization of g(s) with dimension n + n 2 is minimal. qed The foregoing proposition justifies that for a realization theory of general DASs it is sufficient to consider pure DASs and ODSs separately. Realization theory of ODSs is well understood, hence it remains to study the realization theory of pure DASs. Proposition Consider a polynomial transfer function g(s) = r i= α is i R[s for r N, α r. Then the following DASs are minimal realizations of g(s) with state space dimension r + : (i) R-form: ( [,...,,,[,I, [ ) αr Σ pure r+, 5

6 where I = α α r α r α r. (ii) O-form: ( (iii) C-form: [,...,,,[,I, (c,n,î,b) = ([ α,..., α r,[ [ ) αr α Σ pure r+. ),I,[ Σ pure r+. Proof. A simple calculation invoking Remark 8 (ii) shows that the tranfer function of the O- and C-form coincide with g(s). With S = α r I and T = α r I the C-form and the R-form are equivalent and hence the transfer function of the R-form also coincides with g(s). To show that these realizations are minimal consider any realization (c,e,a,b) Σ reg n, n N, of g(s). The ODS part and pure DAS part of the Weierstraß form (see Remark 4) have state dimensions n,n 2 N with n + n 2 = n and transfer functions g (s) R(s) and g 2 (s) R[s, resp. By Remark 8, g (s) is strictly proper and deg g 2 (s) n 2. Together with g (s) + g 2 (s) = g(s) R[s this yields g (s) and r = deg g(s) = deg g 2 (s) n 2. This shows n = n + n 2 r +, i.e. the minimal state-space dimension for any realization of g(s) is r +. qed First results on realization theory can be found in (Dai 989), in particular Proposition is a constructive version of (Dai 989, Lemma 2-6.2) and Proposition is implicitely used in the proof of (Dai 989, Thm ). 4 Impulse-controllability and impulse-observability From the theory of linear ODEs it is well known, that the controllability- and observabilitymatrices play an important role for controllability and observability as well as for the construction of normal forms. It is possible to define analogous matrices for DASs, which play similar roles. Furthermore one can define impulse-controllability- and impulse-observability-indices which are invariants with respect to equivalence transformations. This is important for the normal form and can be used for characterizations of impulse-controllability and -observability. Definition 2 Consider a pure DAS (c,e,a,b) Σ pure n, n N. The impulse-controllabilitymatrix of (c,e,a,b) is B imp := [ b,n b b,n b 2 b,...,n b n b, where N b := EA. The impulse-controllability-index of (c, E, A, b) is d b := rk B imp. 6

7 The impulse-observability-matrix of (c, E, A, b) is C imp := [ c/cn c /cn c 2 /... /cn c n, where N c := A E. The impulse-observability-index of (c, E, A, b) is d c := rk C imp. Definition 3 A pure DAS (c,e,a,b) Σ pure n, n N, is called (i) impulse-controllable (in the sense of (Cobb 984)) if, and only if, im N b = im B imp, where N b = EA. (ii) impulse-observable (in the sense of (Cobb 984)) if, and only if, ker N c = ker C imp, where N c = A E. Remark 4 It might seem artificial to define impulse-controllability and -observability in terms of algebraic conditions. A natural definition should be based on reachability of certain impulsive states and deduction of impulsive states from the output. The problem is that these definitions would require a complete distributional solution theory leading to an unnecessary overhead for the purposes of this paper. For this reason, the definition of impulse-controllability and -observability is based on characterizations given in (Cobb 984, Thm. 4 and Thm. 9). Proposition 5 Impulse-controllability and -observability as well as the corresponding indices are invariant under equivalence transformations. Proof. Let (c,e,a,b ),(c 2,E 2,A 2,b 2 ) Σ pure n be equivalent via S,T R n n. Let B imp,, C imp,, B imp,2, and C imp,2 be the corresponding impulse-controllabel- and impulse-observablematrices. From the definition it follows that B imp,2 = SB imp,, hence the corresponding inpulse-controlability-indices are equal. Furthermore, im E 2 A 2 = im SE A S = im SE A, which yields that (c,e,a,b ) is impulse-controllable if, and only if, (c 2,E 2,A 2,b 2 ) is impulsecontrollable. Analogously, C imp,2 = C imp, T and ker A 2 E 2 = ker T A E T = ker A E T, which show that the impulse-observability-index and impulse-controllability are invariant. qed 7

8 Proposition 5 again justifies that one can assume that every pure DAS is in the standard form (c,n,i,b). In fact, this simplifies the Definitions 2 and 3 because then N b = N c = N. The next proposition highlights an important property of the impulse-controllability- and impulseobservability-matrices. Proposition 6 Consider a pure DAS in standard form (c,n,i,b) Σ pure n, n N, with impulse-controllability- and impulse-observability-indices d b,d c N. Then B imp = [ b,nb,...,n db b,,..., and C imp = [ c/cn/... /cn dc //... /. Proof. Let d N be the smallest number such that N d b = (which exists since N is nilpotent). In terms of (Lang 97, XII.7) the vector b is N-cyclic with period d. Now (Lang 97, Lemma XII.7.) states that [b,nb,...,n d b has full rank which yields d b = rk B imp = rk [ b,nb,...,n d b,,..., = d, this is the assertion of the proposition. The same argument applied to N and c shows the analogous property for C imp. qed Remark 7 For (c,e,a,b) Σ pure n let (b,e,a,c ) Σ pure n be the dual system (see e.g. (Dai 989, 2.4)). If d b and d c are the impulse-controllable- and impulse-observable-indices of (c,e,a,b), then it is easy to see that d c and d b are the impulse-controllable- and impulseobservable-indices of the dual system. 5 A normal form for DASs In this section a normal form for pure DASs is given. For the derivation of the normal form the following definition of the negative relative degree is needed. Definition 8 Consider a pure DAS (c,e,a,b) Σ pure n, n N, with (polynomial) transfer function g(s) R[s. The negative relative degree of (c, E, A, b) is By convention, if g(s) then r :=. r := deg g(s). Remark 9 (i) For an ODS with transfer function g(s) = p(s) q(s) the relative degree ρ is defined as the difference between the degrees of the denominator and numerator, i.e. ρ := deg q(s) deg p(s). This definition is consistent with Definition 8 and r = ρ. 8

9 (ii) By Remark 7 the negative relative degree is invariant under equivalence transformations. Furthermore, for a pure DAS in standard form (c,n,i,b) Σ pure n the negative relative degree fulfills (see Remark 8 (ii)) r = max { i N cn i b }, where by convention the maximum of an empty set is. It is now possible to formulate the main result of this paper. The main advantage is the possibility to observe easily the influence of the input on the states and the influence of states on the output. Theorem 2 Consider a pure DAS (c,e,a,b) Σ pure n, n N, with negative relative degree r, impulse-controllability- and impulse-observability-indices d b,d c N. Then (c,e,a,b) is equivalent to (ĉ, ˆN,Î,ˆb) Σ pure n, where ĉ = [,...,,, ˆN = E N E 2 E 3 } dc r } n d c d b + r + } db r } r + Î = I I I I, ˆb =, γ where γ := ca (EA ) r b = c(a E) r A b, [ [ =, = [, I =, and N R (n dc d b+r+) (n d c d b +r+) is a nilpotent matrix (in Jordan normal form). Proof. Without loss of generality, assume that the DAS is in standard form, i.e. (c, E, A, b) = (c,n,i,b) for some nilpotent matrix N. In this case γ = cn r b (see Remark 9 (ii)). The proof consists of two main steps. The first step is the construction of the transformation matrices S and T, in particular the construction must ensure that S and T are invertible. In 9

10 the second step it is shown that indeed (c,n,i,b) (ĉ, ˆN,Î,ˆb) via S and T. Step. The construction is based on the five matrices L R n (dc r ), L R n (n dc d b+r+), B R n (d b r ), B R n (r+), and Î Rn n, which define the transformation matrix S and T by S := γ [ L, L, B, B, T := γ[ L, L, B, B Î. Step a: The matrix Î. Let where Obviously, Î is invertible. I := cb γ [ I Î := cnb γ I cn r b γ R n n, Step b: The matrices B and B. Let B := [ b,nb,...,n r b R n (r+) and By Remark 9 (ii) CB = C := [ cn r /... /cn/c R (r+) n cn r b cn r b. cb cn r b cn r b R(r+) (r+). (2) R(r+) (r+) (3) is invertible and hence B and C must have full rank. In particular this implies d b r + and d c r +. Let B := [ N r+ b,n r+2 b,...,n d b b R n (d b r ), then by the definition of d b the matrix [ B, B has full column rank. Step c: The matrix L. If d c = r +, then L is the empty matrix. Otherwise let C := [ cn dc /cn dc 2 / /cn r+ R (dc r ) n.

11 Then ker [ C/C is an (n d c )-dimensional subspace of ker C (where dim ker C = n r ), i.e. there exists a full rank matrix L R n (dc r ) such that im L ker [ C/C = ker C. In particular im L ker C = {} and im L ker C. Let L := γl ( CL ). It remains to show that, firstly, L is well defined, i.e. that CL is an invertible matrix, and, secondly, that [L, B, B has full rank (otherwise the matrix S is not well defined). Assume that CLm = for some m R n. Then Lm im L ker C = {}, hence CL has only a trivial kernel which implies invertibility. To show that [L, B, B has full rank, observe that im L = im L and, by the definition of the relative degree, im [ B, B ker C. Hence {} = im L ker C im L im [ B, B, which implies that [L, B, B has full rank. Step d: The matrix L. If d b = r +, then L is the empty matrix. Otherwise choose, analogously as in the previous step, a full rank matrix K R (d b r ) n such that im K ker [ B, B = ker B. Again the matrix B K is invertible. Let K = (KB) K, with an analogous argument as in Step c it can be shown that [ K/C/C has full rank, hence it is possible to choose a full rank matrix L R n (n dc d b+r+) such that im L = ker [ K/C/C. It remains to show that [ L, L, B, B has full rank (i.e. is invertible). To show this, first observe that, by the definition of the relative degree, im B ker C = {} and recall that im L ker C = {} and analogously im K ker B = {}, the latter is equivalent to im B ker K = {}. Altogether this yields ker [ K/C/C im [ L, B, B = {}, which implies that the square matrix [ L, L, B, B has full rank which completes the first step of the proof. Step 2. Step 2a: ST = Î. By definition ST = Î. Step 2b: Sb = ˆb. Let e r = [,...,,,,..., }{{} R n then Sb = ˆb = γe r if, and only if, b = γs e r. The latter is r fulfilled since γs = [ L, L, B,b,Nb,...,N r b. }{{} =B Step 2c: ct = ĉ. Choose a full rank matrix K R (n dc d b+r+) n such that im K = ker [ L, B, B.

12 It can be shown analogously as in Step d that the square matrix C := [ C/K/K/C has full rank (i.e. is invertible). Writing B := [ L, L, B, B the matrix T can be written as T = C γ CBÎ. Since cc = [,...,, it remains to show that [,...,,γ CBÎ = [,...,, = ĉ, or, equivalently, that the last row of the product CB equals the last row of γî. It is easy to see that the last row of γî is [,...,,cb,cnb,...,cn r b. Observe that CB = CL CL CB CB KL KL KB KB KL KL KB KB CL CL CB CB. (4) The matrices L and L are such that im L and im L are both subspaces of ker C, hence CL = and CL =. From the definition of the relative degree it follows that CB =. Together with (3) this shows that the last row of CB is [,...,,cb,cnb,...,cn r b. Step 2d: SNT. Invoking the notation of Step 2c write SNT = (CB) CNBÎ. Note that the product CB in (4) can further be simplified by the following observations, CL = γi, C[L, B, B =, K[L, B, B =, K[L, B =, and KB = I: γi CB = KL KL I. CB Hence By Proposition 6 furthermore CNB = CB [ (CB) = γ I (KL) γ KL I (CB) [ NB = B and CN = C,, KNB = and CNL =, hence [. [ γ KNL KNL CNB = [. KNL KNL KNB [ CNL CB 2

13 Therefore, SNT = (CB) CNBÎ = [ Ê ˆN [ E 2 Ê 3 KNBI [ (CB) CNL where Ê = (KL) KNL, ˆN = (KL) KNL, E 2 = KL [ given by (2). Note that CNL = hence (CB) CNL =, and cn r+ cn r. cn 2 cn L = γcn r+ L(CL). I, + KNL, Ê 3 = KNL, and I is = γ, KNB = K[Nb,N 2 b,...,n r b,n r+ b = [,,...,,(BK) KN r+ b = hence KNBI =. Clearly, [ I = [, and it remains to show that ˆN is nilpotent. This follows from the fact that SNTÎ = SNS is nilpotent and because of the special block structure this implies that ˆN must also be nilpotent. Without changing the block structure it is possible to transform ˆN to Jordan form N, this changes Ê and Ê3 to E and E 3. qed Remark 2 The proof of Theorem 2 is constructive. In fact, for a given DAS in standard form (c,n,i,b) Σ pure n with negative relative degree r and impulse-controllability- and impulse-observability-indices d b,d c N the specific matrices in the normal form are given as 3

14 follows: E = J (KL) KNL R (n dc d b+r+) (d b r ), [ E 2 = KNL KL R (d b r ) (d c r ), E 3 = KNLJ R (d b r ) (n d c d b +r+), N = J (KL) KNLJ R (n dc d b+r+) (n d c d b +r+), = cb γ cnb γ = (CB) γ I = cb γ cnb γ cn r b γ R (db r ) (r+), R (r+) (dc r ), cn r b γ R(r+) (r+), where B := [ b,nb,...,n r b, B := [ N r+ b,n r+2 b,...,n d b b C := [ cn dc /cn dc 2 / /cn r+, C := [ cn r /... /cn/c, ( [B K := [,I /B ) [ [B, B B /B R (d b r ) n L := γ [ C, C ( [C/C [ C, C ) [I/ R n (d c r ), K R n (n dc d b+r+) is a basis of ker [ L /B /B, L R n (n dc d b+r+) is a basis of ker [ K/C/C, and J R (n dc d b+r+) (n d c d b +r+) is a basis transformation such that N is in Jordan normal form. If the DAS (c,e,a,b) is not in standard form, then either N and b in the above formulae must be replaced by A E and A b, resp., or N and c must be replaced by EA and ca, resp. Remark 22 If the negative relative degree of a pure DAE is maximal, i.e. r = n, then the normal form above coincides with the minimal realization in R-form as given in Proposition. Corollary 23 All minimal realizations of a pure DAS are equivalent. The normal form of Theorem 2 can be viewed as a specialization of (2-5.4) in (Dai 989, p. 52): it is more explicit and simpler, the size of the different blocks is explicitly given, and the influence of the input on the states can be seen more directly as well as the influence of the states on the output. Furthermore no proof is given in (Dai 989). 4

15 6 Impulse-controllability and -observability revisited With the normal form from Theorem 2 it is now possible to give characterization of impulsecontrollability and -observability. Theorem 24 Consider (c,e,a,b) Σ pure n, n N, with negative relative degree r, impulsecontrollability- and impulse-observability-indices d b,d c N and let N R (n d b d c+r+) (n d b d c+r+) be given as in Theorem 2. Then the following characterizations of impulse-controllability and -observability hold: (i) The DAS is impulse-controllable if, and only if, d c = r + and N = (ii) The DAS is impulse-observable if, and only if, d b = r + and N =. Proof. Let (ĉ, ˆN,Î,ˆb) be the normal form of (c,e,a,b) from Theorem 2. (i) It is easily seen that (ĉ, ˆN,Î,ˆb) is equivalent to ( c,ñ,i, b) with E N Ñ = E 2 E 3 where the matrices E,E 2,E 3,N, are the same as in Theorem 2 and has the same structure as from Theorem 2, in particular and have a one in the upper right corner. The vector b is given by b = [,...,,γ,,..., with γ at the (n d b +)-th position. It is easily seen that im [Ñ b,ñ2 b,..., Ñ n b = im, which implies that impulse-controllability for the given DAS is equivalent to the condition im E N im. E 2 E 3 A necessary and sufficient condition for this is that the matrix is not existent (because it has a one in the upper right corner), i.e. d c = r +, and that N is the zero matrix. (ii) It is easily seen that (ĉ, ˆN,Î,ĉ) is equivalent to ( c,ñ,i, b) with [ Ñ =, E N E 2 E 3 5

16 where E,E 2,E 3,N,O are as in the normal form in Theorem 2, has the same structure as from Theorem 2 and [ = The vector c is given by c = [,...,,,,..., where the one is at position d c. Easy calculations show that (here it is needed that has a one in the upper right corner) ker[ cñdc / cñdc /... / cñ = ker. [ Hence impulse-controllability is equivalent to the condition [ E N ker ker [ E 2 E 3. Because has a one in the upper right corner the inclusion holds if, and only if, does not exists, i.e. d b = r +, and N =. qed Corollary 25 A pure DAS with state space dimension n N is impulse-controllable and -observable if, and only if, it is equivalent to (c,n,î,b) = [,...,,,, I [,...,,γ,,...,, }{{}}{{} n r r where the diagonal square blocks of N and Î have size (n r ) and (r + ) for some r {,...,n } and γ. Corollary 26 (i) Two pure DASs with the same state space dimension which are impulsecontrollable and -observable are equivalent if, and only if, they are IO-equivalent. (ii) If the negative relative degree of a pure DAS (c,e,a,b) Σ pure n, n N, is maximal, i.e. r = n, then (c, E, A, b) is impulse-controllable and -observable. (iii) All minimal realization of a pure DAS are impulse-controllable and -observable. Remark 27 Note that an impulse-controllable and -observable DAS which is a realization of a polynomial transfer function need not to be minimal, because one can add arbitrarily many trivial state equations z =, z 2 =,..., z N = without loosing the property of impulsecontrollability and -observability. 6

17 7 Conclusion For pure differential algebraic equation a normal form is derived which shows very clearly the influence of the input on the states as well as the influence of the states on the output. The relative degree appears very clearly in the normal form. The normal form also separates the states into impulse-controllable and -observable states and easy characterizations of impulsecontrollability and -observability based on the normal form are given. Some specific minimal realizations of pure DAEs are given and connections between the relative degree and the normal form are highlighted. In combination with distributional solution theory the normal form might be used in future research to study the influence of inconsistent initial values on the output and the influence of non-smooth inputs on the states and the output. The normal form might also help for synthesis of controllers for specific control tasks, e.g. impulse elimination. Finally the proof of the normal is constructive, i.e. it is possible to calculate the transformation matrices and the normal form explicitly, nevertheless the given formulae are not studied with respect to numerical feasibility. Acknowledgment I thank Achim Ilchmann who carefully read the manuscript and who gave valuable hints and suggestions which helped to improve the clarity and quality of the paper. I would also like to thank Vu Hoang Linh (Hanoi Univ., Vietnam) whose visit in Ilmenau initiated the work on this paper. References Campbell, S. L. (98), Singular Systems of Differential Equations I, Pitman, New York. Campbell, S. L. (982), Singular Systems of Differential Equations II, Pitman, New York. Cobb, D. J. (984), Controllability, observability and duality in singular systems, IEEE Trans. Automat. Contr. AC-29, Dai, L. (989), Singular Control Systems, number 8 in Lecture Notes in Control and Information Sciences, Springer-Verlag, Berlin. Ilchmann, A., Ryan, E. & Townsend, P. (27), Tracking with prescribed transient behaviour for nonlinear systems of known relative degree, SIAM J. Control Optimization 46(), Isidori, A. (995), Nonlinear Control Systems, Communication and Control Engineering Series, 3 edn, Springer-Verlag, Berlin. Kalman, R. (962), Canonical structure of linear dynamical systems, Proc. Nat. Acad. Sci. U.S.A. 48(4), Kunkel, P. & Mehrmann, V. (26), Differential-Algebraic Equations. Analysis and Numerical Solution, EMS Publishing House, Zürich, Switzerland. 7

18 Lang, S. (97), Linear Algebra, 2nd edn, Addison-Wesley, Reading, Massachusetts. fourth printing 973. Loiseau, J., Özçaldiran, K., Malabre, M. & Karcanias, N. (99), Feedback canonical forms of singular systems, Kybernetika 27(4), Rabier, P. J. & Rheinboldt, W. C. (22), Theoretical and Numerical Analysis of Differential- Algebraic Equations, Vol. VIII of Handbook of Numerical Analysis, Elsevier Publications, Amsterdam, The Netherlands. Rath, W. (997), Derivative and proportional state feedback for linear descriptor systems with variable coefficients, Lin. Alg. Appl. 26, Weierstraß, K. (867), Zur Theorie der bilinearen und quadratischen Formen, Monatsh. Akad. Wiss. pp

Impulse free solutions for switched differential algebraic equations

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

More information

Controllability of switched differential-algebraic equations

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

More information

Linear relations and the Kronecker canonical form

Linear relations and the Kronecker canonical form Linear relations and the Kronecker canonical form Thomas Berger Carsten Trunk Henrik Winkler August 5, 215 Abstract We show that the Kronecker canonical form (which is a canonical decomposition for pairs

More information

Zeros and zero dynamics

Zeros and zero dynamics CHAPTER 4 Zeros and zero dynamics 41 Zero dynamics for SISO systems Consider a linear system defined by a strictly proper scalar transfer function that does not have any common zero and pole: g(s) =α p(s)

More information

On families of anticommuting matrices

On families of anticommuting matrices On families of anticommuting matrices Pavel Hrubeš December 18, 214 Abstract Let e 1,..., e k be complex n n matrices such that e ie j = e je i whenever i j. We conjecture that rk(e 2 1) + rk(e 2 2) +

More information

Optimization Based Output Feedback Control Design in Descriptor Systems

Optimization Based Output Feedback Control Design in Descriptor Systems Trabalho apresentado no XXXVII CNMAC, S.J. dos Campos - SP, 017. Proceeding Series of the Brazilian Society of Computational and Applied Mathematics Optimization Based Output Feedback Control Design in

More information

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same. Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read

More information

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

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

More information

A Necessary and Sufficient Condition for High-Frequency Robustness of Non-Strictly-Proper Feedback Systems

A Necessary and Sufficient Condition for High-Frequency Robustness of Non-Strictly-Proper Feedback Systems A Necessary and Sufficient Condition for High-Frequency Robustness of Non-Strictly-Proper Feedback Systems Daniel Cobb Department of Electrical Engineering University of Wisconsin Madison WI 53706-1691

More information

Zero controllability in discrete-time structured systems

Zero controllability in discrete-time structured systems 1 Zero controllability in discrete-time structured systems Jacob van der Woude arxiv:173.8394v1 [math.oc] 24 Mar 217 Abstract In this paper we consider complex dynamical networks modeled by means of state

More information

A proof of the Jordan normal form theorem

A proof of the Jordan normal form theorem A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,

More information

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

Throughout these notes we assume V, W are finite dimensional inner product spaces over C. Math 342 - Linear Algebra II Notes Throughout these notes we assume V, W are finite dimensional inner product spaces over C 1 Upper Triangular Representation Proposition: Let T L(V ) There exists an orthonormal

More information

A matrix over a field F is a rectangular array of elements from F. The symbol

A matrix over a field F is a rectangular array of elements from F. The symbol Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted

More information

Math 554 Qualifying Exam. You may use any theorems from the textbook. Any other claims must be proved in details.

Math 554 Qualifying Exam. You may use any theorems from the textbook. Any other claims must be proved in details. Math 554 Qualifying Exam January, 2019 You may use any theorems from the textbook. Any other claims must be proved in details. 1. Let F be a field and m and n be positive integers. Prove the following.

More information

Equivalence of dynamical systems by bisimulation

Equivalence 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

Linear Algebra. Grinshpan

Linear Algebra. Grinshpan Linear Algebra Grinshpan Saturday class, 2/23/9 This lecture involves topics from Sections 3-34 Subspaces associated to a matrix Given an n m matrix A, we have three subspaces associated to it The column

More information

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

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

More information

Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.

Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc. 1 Polynomial Matrices 1.1 Polynomials Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc., n ws ( ) as a

More information

An Observation on the Positive Real Lemma

An Observation on the Positive Real Lemma Journal of Mathematical Analysis and Applications 255, 48 49 (21) doi:1.16/jmaa.2.7241, available online at http://www.idealibrary.com on An Observation on the Positive Real Lemma Luciano Pandolfi Dipartimento

More information

Elementary Linear Algebra

Elementary Linear Algebra Matrices J MUSCAT Elementary Linear Algebra Matrices Definition Dr J Muscat 2002 A matrix is a rectangular array of numbers, arranged in rows and columns a a 2 a 3 a n a 2 a 22 a 23 a 2n A = a m a mn We

More information

Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form

Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form Journal of Mathematical Modeling Vol. 3, No. 1, 2015, pp. 91-101 JMM Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form Kamele Nassiri Pirbazari

More information

Linear Algebra MAT 331. Wai Yan Pong

Linear Algebra MAT 331. Wai Yan Pong Linear Algebra MAT 33 Wai Yan Pong August 7, 8 Contents Linear Equations 4. Systems of Linear Equations..................... 4. Gauss-Jordan Elimination...................... 6 Linear Independence. Vector

More information

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND

More information

THE S 1 -EQUIVARIANT COHOMOLOGY RINGS OF (n k, k) SPRINGER VARIETIES

THE S 1 -EQUIVARIANT COHOMOLOGY RINGS OF (n k, k) SPRINGER VARIETIES Horiguchi, T. Osaka J. Math. 52 (2015), 1051 1062 THE S 1 -EQUIVARIANT COHOMOLOGY RINGS OF (n k, k) SPRINGER VARIETIES TATSUYA HORIGUCHI (Received January 6, 2014, revised July 14, 2014) Abstract The main

More information

(VI.D) Generalized Eigenspaces

(VI.D) Generalized Eigenspaces (VI.D) Generalized Eigenspaces Let T : C n C n be a f ixed linear transformation. For this section and the next, all vector spaces are assumed to be over C ; in particular, we will often write V for C

More information

Control Systems. Linear Algebra topics. L. Lanari

Control Systems. Linear Algebra topics. L. Lanari Control Systems Linear Algebra topics L Lanari outline basic facts about matrices eigenvalues - eigenvectors - characteristic polynomial - algebraic multiplicity eigenvalues invariance under similarity

More information

Eigenvalues of Random Matrices over Finite Fields

Eigenvalues of Random Matrices over Finite Fields Eigenvalues of Random Matrices over Finite Fields Kent Morrison Department of Mathematics California Polytechnic State University San Luis Obispo, CA 93407 kmorriso@calpoly.edu September 5, 999 Abstract

More information

On linear quadratic optimal control of linear time-varying singular systems

On 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 information

Eventually reducible matrix, eventually nonnegative matrix, eventually r-cyclic

Eventually reducible matrix, eventually nonnegative matrix, eventually r-cyclic December 15, 2012 EVENUAL PROPERIES OF MARICES LESLIE HOGBEN AND ULRICA WILSON Abstract. An eventual property of a matrix M C n n is a property that holds for all powers M k, k k 0, for some positive integer

More information

only 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

only 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 information

0.1 Rational Canonical Forms

0.1 Rational Canonical Forms We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best

More information

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

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

More information

STABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin

STABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting

More information

MATHEMATICS 217 NOTES

MATHEMATICS 217 NOTES MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable

More information

On the closures of orbits of fourth order matrix pencils

On the closures of orbits of fourth order matrix pencils On the closures of orbits of fourth order matrix pencils Dmitri D. Pervouchine Abstract In this work we state a simple criterion for nilpotentness of a square n n matrix pencil with respect to the action

More information

MATH 8253 ALGEBRAIC GEOMETRY WEEK 12

MATH 8253 ALGEBRAIC GEOMETRY WEEK 12 MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f

More information

Key words. regular matrix pencils, rank one perturbations, matrix spectral perturbation theory

Key words. regular matrix pencils, rank one perturbations, matrix spectral perturbation theory EIGENVALUE PLACEMENT FOR REGULAR MATRIX PENCILS WITH RANK ONE PERTURBATIONS HANNES GERNANDT AND CARSTEN TRUNK Abstract. A regular matrix pencil se A and its rank one perturbations are considered. We determine

More information

Digital Workbook for GRA 6035 Mathematics

Digital Workbook for GRA 6035 Mathematics Eivind Eriksen Digital Workbook for GRA 6035 Mathematics November 10, 2014 BI Norwegian Business School Contents Part I Lectures in GRA6035 Mathematics 1 Linear Systems and Gaussian Elimination........................

More information

ELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS

ELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS ELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS J. WARNER SUMMARY OF A PAPER BY J. CARLSON, E. FRIEDLANDER, AND J. PEVTSOVA, AND FURTHER OBSERVATIONS 1. The Nullcone and Restricted Nullcone We will need

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS

More information

Citation Osaka Journal of Mathematics. 43(2)

Citation Osaka Journal of Mathematics. 43(2) TitleIrreducible representations of the Author(s) Kosuda, Masashi Citation Osaka Journal of Mathematics. 43(2) Issue 2006-06 Date Text Version publisher URL http://hdl.handle.net/094/0396 DOI Rights Osaka

More information

Eigenvalue placement for regular matrix pencils with rank one perturbations

Eigenvalue placement for regular matrix pencils with rank one perturbations Eigenvalue placement for regular matrix pencils with rank one perturbations Hannes Gernandt (joint work with Carsten Trunk) TU Ilmenau Annual meeting of GAMM and DMV Braunschweig 2016 Model of an electrical

More information

Observability of linear differential-algebraic systems a survey

Observability of linear differential-algebraic systems a survey Observability of linear differential-algebraic systems a survey Thomas Berger, Timo Reis and Stephan Trenn Abstract We investigate different concepts related to observability of linear constant coefficient

More information

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8. Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:

More information

ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices

ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS KOLMAN & HILL NOTES BY OTTO MUTZBAUER 11 Systems of Linear Equations 1 Linear Equations and Matrices Numbers in our context are either real numbers or complex

More information

A q x k+q + A q 1 x k+q A 0 x k = 0 (1.1) where k = 0, 1, 2,..., N q, or equivalently. A(σ)x k = 0, k = 0, 1, 2,..., N q (1.

A q x k+q + A q 1 x k+q A 0 x k = 0 (1.1) where k = 0, 1, 2,..., N q, or equivalently. A(σ)x k = 0, k = 0, 1, 2,..., N q (1. A SPECTRAL CHARACTERIZATION OF THE BEHAVIOR OF DISCRETE TIME AR-REPRESENTATIONS OVER A FINITE TIME INTERVAL E.N.Antoniou, A.I.G.Vardulakis, N.P.Karampetakis Aristotle University of Thessaloniki Faculty

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #17 11/05/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #17 11/05/2013 18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #17 11/05/2013 Throughout this lecture k denotes an algebraically closed field. 17.1 Tangent spaces and hypersurfaces For any polynomial f k[x

More information

Lecture 4: Algebra, Geometry, and Complexity of the Simplex Method. Reading: Sections 2.6.4, 3.5,

Lecture 4: Algebra, Geometry, and Complexity of the Simplex Method. Reading: Sections 2.6.4, 3.5, Lecture 4: Algebra, Geometry, and Complexity of the Simplex Method Reading: Sections 2.6.4, 3.5, 10.2 10.5 1 Summary of the Phase I/Phase II Simplex Method We write a typical simplex tableau as z x 1 x

More information

The Jordan Canonical Form

The Jordan Canonical Form The Jordan Canonical Form The Jordan canonical form describes the structure of an arbitrary linear transformation on a finite-dimensional vector space over an algebraically closed field. Here we develop

More information

First of all, the notion of linearity does not depend on which coordinates are used. Recall that a map T : R n R m is linear if

First of all, the notion of linearity does not depend on which coordinates are used. Recall that a map T : R n R m is linear if 5 Matrices in Different Coordinates In this section we discuss finding matrices of linear maps in different coordinates Earlier in the class was the matrix that multiplied by x to give ( x) in standard

More information

Chapter 2 Linear Transformations

Chapter 2 Linear Transformations Chapter 2 Linear Transformations Linear Transformations Loosely speaking, a linear transformation is a function from one vector space to another that preserves the vector space operations. Let us be more

More information

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real

More information

Math 2030 Assignment 5 Solutions

Math 2030 Assignment 5 Solutions Math 030 Assignment 5 Solutions Question 1: Which of the following sets of vectors are linearly independent? If the set is linear dependent, find a linear dependence relation for the vectors (a) {(1, 0,

More information

August 2015 Qualifying Examination Solutions

August 2015 Qualifying Examination Solutions August 2015 Qualifying Examination Solutions If you have any difficulty with the wording of the following problems please contact the supervisor immediately. All persons responsible for these problems,

More information

Bohl exponent for time-varying linear differential-algebraic equations

Bohl 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 information

On the order bound of one-point algebraic geometry codes.

On the order bound of one-point algebraic geometry codes. On the order bound of one-point algebraic geometry codes. Anna Oneto and Grazia Tamone 1 Abstract. Let S ={s i} i IN IN be a numerical semigroup. For each i IN, let ν(s i) denote the number of pairs (s

More information

Structural Properties of LTI Singular Systems under Output Feedback

Structural Properties of LTI Singular Systems under Output Feedback Structural Properties of LTI Singular Systems under Output Feedback Runyi Yu Dept. of Electrical and Electronic Eng. Eastern Mediterranean University Gazimagusa, Mersin 10, Turkey runyi.yu@emu.edu.tr Dianhui

More information

11. Dimension. 96 Andreas Gathmann

11. Dimension. 96 Andreas Gathmann 96 Andreas Gathmann 11. Dimension We have already met several situations in this course in which it seemed to be desirable to have a notion of dimension (of a variety, or more generally of a ring): for

More information

On Positive Real Lemma for Non-minimal Realization Systems

On Positive Real Lemma for Non-minimal Realization Systems Proceedings of the 17th World Congress The International Federation of Automatic Control On Positive Real Lemma for Non-minimal Realization Systems Sadaaki Kunimatsu Kim Sang-Hoon Takao Fujii Mitsuaki

More information

A BOUNDARY VALUE PROBLEM FOR LINEAR PDAEs

A BOUNDARY VALUE PROBLEM FOR LINEAR PDAEs Int. J. Appl. Math. Comput. Sci. 2002 Vol.12 No.4 487 491 A BOUNDARY VALUE PROBLEM FOR LINEAR PDAEs WIESŁAW MARSZAŁEK ZDZISŁAW TRZASKA DeVry College of Technology 630 US Highway One North Brunswick N8902

More information

1 Matrices and vector spaces

1 Matrices and vector spaces Matrices and vector spaces. Which of the following statements about linear vector spaces are true? Where a statement is false, give a counter-example to demonstrate this. (a) Non-singular N N matrices

More information

MINIMAL POLYNOMIALS AND CHARACTERISTIC POLYNOMIALS OVER RINGS

MINIMAL POLYNOMIALS AND CHARACTERISTIC POLYNOMIALS OVER RINGS JP Journal of Algebra, Number Theory and Applications Volume 0, Number 1, 011, Pages 49-60 Published Online: March, 011 This paper is available online at http://pphmj.com/journals/jpanta.htm 011 Pushpa

More information

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88 Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant

More information

2 b 3 b 4. c c 2 c 3 c 4

2 b 3 b 4. c c 2 c 3 c 4 OHSx XM511 Linear Algebra: Multiple Choice Questions for Chapter 4 a a 2 a 3 a 4 b b 1. What is the determinant of 2 b 3 b 4 c c 2 c 3 c 4? d d 2 d 3 d 4 (a) abcd (b) abcd(a b)(b c)(c d)(d a) (c) abcd(a

More information

Absolutely indecomposable symmetric matrices

Absolutely indecomposable symmetric matrices Journal of Pure and Applied Algebra 174 (2002) 83 93 wwwelseviercom/locate/jpaa Absolutely indecomposable symmetric matrices Hans A Keller a; ;1, A Herminia Ochsenius b;1 a Hochschule Technik+Architektur

More information

MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics

MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam This study sheet will not be allowed during the test Books and notes will not be allowed during the test Calculators and cell phones

More information

Where is matrix multiplication locally open?

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

More information

CHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998

CHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998 CHAPTER 0 PRELIMINARY MATERIAL Paul Vojta University of California, Berkeley 18 February 1998 This chapter gives some preliminary material on number theory and algebraic geometry. Section 1 gives basic

More information

Decomposition of Linear Port-Hamiltonian Systems

Decomposition of Linear Port-Hamiltonian Systems American ontrol onference on O'Farrell Street, San Francisco, A, USA June 9 - July, Decomposition of Linear Port-Hamiltonian Systems K. Höffner and M. Guay Abstract It is well known that the power conserving

More information

Modern Optimal Control

Modern Optimal Control Modern Optimal Control Matthew M. Peet Arizona State University Lecture 21: Optimal Output Feedback Control connection is called the (lower) star-product of P and Optimal Output Feedback ansformation (LFT).

More information

Rings and groups. Ya. Sysak

Rings and groups. Ya. Sysak Rings and groups. Ya. Sysak 1 Noetherian rings Let R be a ring. A (right) R -module M is called noetherian if it satisfies the maximum condition for its submodules. In other words, if M 1... M i M i+1...

More information

GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.

GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,

More information

Robust Control 2 Controllability, Observability & Transfer Functions

Robust Control 2 Controllability, Observability & Transfer Functions Robust Control 2 Controllability, Observability & Transfer Functions Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University /26/24 Outline Reachable Controllability Distinguishable

More information

POSITIVE PARTIAL REALIZATION PROBLEM FOR LINEAR DISCRETE TIME SYSTEMS

POSITIVE PARTIAL REALIZATION PROBLEM FOR LINEAR DISCRETE TIME SYSTEMS Int J Appl Math Comput Sci 7 Vol 7 No 65 7 DOI: 478/v6-7-5- POSITIVE PARTIAL REALIZATION PROBLEM FOR LINEAR DISCRETE TIME SYSTEMS TADEUSZ KACZOREK Faculty of Electrical Engineering Białystok Technical

More information

Computation of a canonical form for linear differential-algebraic equations

Computation of a canonical form for linear differential-algebraic equations Computation of a canonical form for linear differential-algebraic equations Markus Gerdin Division of Automatic Control Department of Electrical Engineering Linköpings universitet, SE-581 83 Linköping,

More information

Abstract Algebra II Groups ( )

Abstract Algebra II Groups ( ) Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition

More information

Infinite elementary divisor structure-preserving transformations for polynomial matrices

Infinite elementary divisor structure-preserving transformations for polynomial matrices Infinite elementary divisor structure-preserving transformations for polynomial matrices N P Karampetakis and S Vologiannidis Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki

More information

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. On the Kronecker Canonical Form of Singular Mixed Matrix Pencils

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. On the Kronecker Canonical Form of Singular Mixed Matrix Pencils MATHEMATICAL ENGINEERING TECHNICAL REPORTS On the Kronecker Canonical Form of Singular Mixed Matrix Pencils Satoru IWATA and Mizuyo TAKAMATSU METR 2015 28 December 2015 DEPARTMENT OF MATHEMATICAL INFORMATICS

More information

MATH 326: RINGS AND MODULES STEFAN GILLE

MATH 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 information

The Gauss-Jordan Elimination Algorithm

The Gauss-Jordan Elimination Algorithm The Gauss-Jordan Elimination Algorithm Solving Systems of Real Linear Equations A. Havens Department of Mathematics University of Massachusetts, Amherst January 24, 2018 Outline 1 Definitions Echelon Forms

More information

Integral Similarity and Commutators of Integral Matrices Thomas J. Laffey and Robert Reams (University College Dublin, Ireland) Abstract

Integral Similarity and Commutators of Integral Matrices Thomas J. Laffey and Robert Reams (University College Dublin, Ireland) Abstract Integral Similarity and Commutators of Integral Matrices Thomas J. Laffey and Robert Reams (University College Dublin, Ireland) Abstract Let F be a field, M n (F ) the algebra of n n matrices over F and

More information

Math Linear Algebra II. 1. Inner Products and Norms

Math Linear Algebra II. 1. Inner Products and Norms Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,

More information

Null Controllability of Discrete-time Linear Systems with Input and State Constraints

Null Controllability of Discrete-time Linear Systems with Input and State Constraints Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-11, 2008 Null Controllability of Discrete-time Linear Systems with Input and State Constraints W.P.M.H. Heemels and

More information

Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012

Preliminary/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 information

Products of commuting nilpotent operators

Products of commuting nilpotent operators Electronic Journal of Linear Algebra Volume 16 Article 22 2007 Products of commuting nilpotent operators Damjana Kokol Bukovsek Tomaz Kosir tomazkosir@fmfuni-ljsi Nika Novak Polona Oblak Follow this and

More information

Decomposition of a recursive family of polynomials

Decomposition of a recursive family of polynomials Decomposition of a recursive family of polynomials Andrej Dujella and Ivica Gusić Abstract We describe decomposition of polynomials f n := f n,b,a defined by f 0 := B, f 1 (x := x, f n+1 (x = xf n (x af

More information

SOLUTION OF GENERALIZED LINEAR VECTOR EQUATIONS IN IDEMPOTENT ALGEBRA

SOLUTION OF GENERALIZED LINEAR VECTOR EQUATIONS IN IDEMPOTENT ALGEBRA , pp. 23 36, 2006 Vestnik S.-Peterburgskogo Universiteta. Matematika UDC 519.63 SOLUTION OF GENERALIZED LINEAR VECTOR EQUATIONS IN IDEMPOTENT ALGEBRA N. K. Krivulin The problem on the solutions of homogeneous

More information

Dragan S. Djordjević. 1. Introduction

Dragan S. Djordjević. 1. Introduction UNIFIED APPROACH TO THE REVERSE ORDER RULE FOR GENERALIZED INVERSES Dragan S Djordjević Abstract In this paper we consider the reverse order rule of the form (AB) (2) KL = B(2) TS A(2) MN for outer generalized

More information

Minimal-span bases, linear system theory, and the invariant factor theorem

Minimal-span bases, linear system theory, and the invariant factor theorem Minimal-span bases, linear system theory, and the invariant factor theorem G. David Forney, Jr. MIT Cambridge MA 02139 USA DIMACS Workshop on Algebraic Coding Theory and Information Theory DIMACS Center,

More information

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)

More information

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is

More information

LINEAR SYSTEMS AND MATRICES

LINEAR SYSTEMS AND MATRICES CHAPTER 3 LINEAR SYSTEMS AND MATRICES SECTION 3. INTRODUCTION TO LINEAR SYSTEMS This initial section takes account of the fact that some students remember only hazily the method of elimination for and

More information

D-MATH Alessio Savini. Exercise Sheet 4

D-MATH Alessio Savini. Exercise Sheet 4 ETH Zürich Exercise Sheet 4 Exercise 1 Let G, H be two Lie groups and let ϕ : G H be a smooth homomorphism. Show that ϕ has constant rank. Solution: We need to show that for every g G the rank of the linear

More information

Linear Systems and Matrices

Linear Systems and Matrices Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......

More information

THE 2-MODULAR DECOMPOSITION MATRICES OF THE SYMMETRIC GROUPS S 15, S 16, AND S 17

THE 2-MODULAR DECOMPOSITION MATRICES OF THE SYMMETRIC GROUPS S 15, S 16, AND S 17 THE 2-MODULAR DECOMPOSITION MATRICES OF THE SYMMETRIC GROUPS S 15, S 16, AND S 17 Abstract. In this paper the 2-modular decomposition matrices of the symmetric groups S 15, S 16, and S 17 are determined

More information

Arithmetic Funtions Over Rings with Zero Divisors

Arithmetic Funtions Over Rings with Zero Divisors BULLETIN of the Bull Malaysian Math Sc Soc (Second Series) 24 (200 81-91 MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Arithmetic Funtions Over Rings with Zero Divisors 1 PATTIRA RUANGSINSAP, 1 VICHIAN LAOHAKOSOL

More information

Robust Internal Model Control for Impulse Elimination of Singular Systems

Robust Internal Model Control for Impulse Elimination of Singular Systems International Journal of Control Science and Engineering ; (): -7 DOI:.59/j.control.. Robust Internal Model Control for Impulse Elimination of Singular Systems M. M. Share Pasandand *, H. D. Taghirad Department

More information

Math 121 Homework 5: Notes on Selected Problems

Math 121 Homework 5: Notes on Selected Problems Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements

More information

The Maximum Dimension of a Subspace of Nilpotent Matrices of Index 2

The Maximum Dimension of a Subspace of Nilpotent Matrices of Index 2 The Maximum Dimension of a Subspace of Nilpotent Matrices of Index L G Sweet Department of Mathematics and Statistics, University of Prince Edward Island Charlottetown, PEI C1A4P, Canada sweet@upeica J

More information