Reachability, Observability and Minimality for a Class of 2D Continuous-Discrete Systems
|
|
- Emerald Watson
- 5 years ago
- Views:
Transcription
1 Proceedings of the 7th WSEAS International Conference on Systems Theory and Scientific Computation, Athens, Greece, August 24-26, 27 Reachability, Observability and Minimality for a Class of 2D Continuous-Discrete Systems VALERIU PREPELIŢĂ University Politehnica of Bucharest Department of Mathematics Splaiul Indpendentei 33 ROMANIA vprepelita@mathem.pub.ro IONEL TEVY University Politehnica of Bucharest Department of Mathematics Splaiul Indpendentei 33 ROMANIA tevy@mathem.pub.ro Abstract: Reachability and observability criteria are obtained for 2D continuous-discrete time-variable Attasi type systems by using suitable 2D reachability and observability Gramians. Necessary and sufficient conditions of reachability and observability are derived for time-invariant systems. The duality between the two concepts is emphasized as well as their connection with the minimality of these systems. Key Words: 2D continuous-discrete linear systems, controllability, reachability, observability, duality principle. Typing manuscripts, LATEX Introduction The concepts of controllability and observability, introduced by Kalman for D systems were extended to 2D systems for Roesser [9], Fornasini and Marchesini [2], and Attasi [] models; in order to keep their relationship with minimality, new concepts of modal controllability and modal observability were introduced in [6]. In this paper a class of 2D continuous-discrete time-variable linear systems is studied, which is related to Attasi s 2D discrete model and represents the extension to time-variable framework of the hybrid systems introduced in [8]. Such systems can appear in various problems as signal and image processing, seismology and geophysics, control of multipass processes, iterative learning control synthesis [5] or repetitive processes [3]. The state and output formulæ for these systems are established in Section 2 and the notions of complete reachability and complete observability are defined. These properties are characterized by means of the full ranks of suitable 2D reachability and observability Gramians. Section 4 is devoted to time-invariant 2D continuous-discrete systems and a list of criteria of reachability and observability is provided. The duality between the two concepts is emphasized. In Section 5 the relation between reachability, observability and minimality is established. WSEAS Transactions on Mathematics,... (27),... 2 The state space representation of the 2D continuous-discrete systems We consider the linear spaces X R n, U R m and Y R p, called respectively the state, input and output spaces. The time set is T R Z. Definition A two-dimensional continuousdiscrete linear system (2Dcd) is a quintuplet Σ (A (t, k), A 2 (t, k), B(t, k), C(t, k), D(t, k)) R n n R n n R n m R p n R p m with A (t, k)a 2 (t, k) A 2 (t, k)a (t, k) (t, k) T, where all matrices are continuous with respect to t R for any k Z; the state space representation of Σ is given by the state and output equations ẋ(t,k+)a (t,k+)x(t,k+)+a 2 (t,k)ẋ(t,k) A (t, k)a 2 (t, k)x(t, k) + B(t, k)u(t, k) () y(t, k) C(t, k)x(t, k) + D(t, k)u(t, k) (2) where ẋ(t, k) x t (t, k). Let us denote by Φ(t, t ; k) or Φ A (t, t ; k) the (continuous) fundamental matrix of A (t, k) with respect to t R, for any fixed k Z. Φ(t, t ; k) has the following properties, for any t, t, t R: i) d dt Φ(t, t ; k) A (t, k)φ(t, t ; k), ii) Φ(t, t ; k) I n, iii) Φ(t, t ; k)φ(t, t ; k) Φ(t, t ; k), iv) Φ(t, t ; k) Φ(t, t; k). (3)
2 Proceedings of the 7th WSEAS International Conference on Systems Theory and Scientific Computation, Athens, Greece, August 24-26, If A is a constant matrix, then Φ(t, t ; k) e A (t t ). The discrete fundamental matrix F (t; k, k ) of the matrix A 2 (t, k) is defined by F (t; k, k ) { A2 (t,k )A 2 (t,k 2) A 2 (t,k ) for k > k I n for k k for any fixed t R. If A 2 is a constant matrix, then F (t; k, k ) A k k 2. Φ(t, t ; k) and F (s; l, l ) are commutative matrices for any t, t, s R and k, l, l Z since A (t, k) and A 2 (t, k) are commutative matrices. Definition 2 A vector x X is said to be the initial state of Σ at the moment (t, k ) T if, for any (t, k) T with (t, k) (t, k ) the following conditions hold: x(t,k )Φ(t, t ;k )x, x(t,k)f (t ; k,k )x. (4) In [7] it was proved: Proposition 3 The state of the system Σ at the moment (t, k) T determined by the control u(, ) and by the initial state x X is t t k x(t,k)φ(t,t ;k)f (t ;k,k )x + lk Φ(t, s; k)f (s; k, l + )B(s, l)u(s, l)ds. (5) By replacing the state x(t, k) given by (5) in the output equation (2) we obtain Proposition 4 The input-output map of the system Σ is given by the formula t y(t,k)c(t,k)φ(t,t ;k)f (t ;k,k )x + k C(t,k) t lk Φ(t, s; k)f (s; k,l+)b(s,l)u(s,l)ds+d(t,k)u(t,k). (6) 3 Reachability and observability of time-variable 2D continuousdiscrete systems For the concept of reachability we need only the state equation (), hence a 2Dcd system can be reduced to the triplet Σ (A (t, k), A 2 (t, k), B(t, k)). For observability the system can be reduced to the triplet Σ (A (t, k), A 2 (t, k), C(t, k)). For both notions a system will be a quadruplet Σ (A (t, k), A 2 (t, k), B(t, k), C(t, k)). By (s, l) < (t, k) we mean s t, l k and (s, l) (t, k). A triplet (t, k, x) R Z X is said to be a phase of Σ if x is the state of Σ at the moment (t, k) (i.e. x x(t, k), where x(t, k) is given by (5)). Definition 5 A phase (t, k, x) of Σ is said to be reachable if there exist (t, k ) T, (t, k ) < (t, k) and a control u(, ) which transfers the phase (t, k, ) to (t, k, x). A phase (t, k, x) is said to be controllable if there exist (t, k ) T, (t, k ) > (t, k) and a control u(, ) which transfers the phase (t, k, x) to (t, k, ). If for some fixed (τ, χ) T every phase (τ, χ, x) is reachable (controllable), the system Σ is said to be completely reachable (completely controllable) at the moment (τ, χ). Definition 6 A phase (τ, χ, x) is said to be unobservable if for any control u it provides the same output y(s, l) for (s, l) (τ, χ) as the phase (τ, χ, ). In this case the state x X is said to be unobservable at (τ, χ). The system Σ is said to be completely observable at (τ, χ) if there is no state unobservable at (τ, χ). Definition 7 The matrices R Σ (t, τ; k, χ) τ χ t lk Φ(τ, s; χ)f (s; χ, l+) B(s, l)b(s, l) T F (s; χ, l + ) T Φ(τ, s; χ) T ds, (7) O Σ (τ, t; χ, k) t τ k Φ(s, τ; l) T F (τ; l, χ) T lχ C(s, l) T C(s, l)f (τ; l, χ)φ(s, τ; l)ds. (8) are called respectively the reachability Gramian and the observability Gramian of Σ. We have proved in [8]: Theorem 8 Σ is completely reachable at (τ, χ) if and only if rankr Σ (t, τ; k, χ) n for some (t, k) (τ, χ). Theorem 9 The system Σ (A (t, k), A 2 (t, k), C(t, k)) is completely observable at (τ, χ) if and only if for some (t, k) (τ, χ). ranko Σ (τ, t; χ, k) n. (9)
3 Proceedings of the 7th WSEAS International Conference on Systems Theory and Scientific Computation, Athens, Greece, August 24-26, Reachability and observability of time-invariant 2D continuousdiscrete systems Let us consider a time invariant system Σ (A, A 2, B, C), i.e. a system with A, A 2, B and C constant matrices. In this case we can consider the initial moment (t, k ) (, ) and the time set T R + Z +. Then the state formula (5) and the input-output map (6) become t k l t k l x(t, k) e A t A k 2x + e A (t s) A k l 2 Bu(s, l)ds () y(t, k) Ce A t A k 2x + Ce A (t s) A k l 2 Bu(s, l)ds. () Definition The system Σ d (A d, Ad 2, Bd, C) is called the dual of Σ if A d AT, Ad 2 AT 2, Bd C T, C d B T. We can prove (see [8]) the Duality Principle: Theorem The system Σ d is completely observable if and only if Σ is completely reachable. We associate to Σ the reachability matrix C Σ [B A B... A n B A 2 B A A 2 B... A n A 2 B... A n 2 B A A n 2 B A n A n 2 B] and the observability matrix O Σ [C T A T CT... (A T )n C T A T 2 CT A T AT 2 CT... (A T )n A T 2 CT... (A T 2 )n C T A T (AT 2 )n C T... (A T )n (A T 2 )n C T ] T. Theorem 8 gives (see [7],Theorem 4.2) Theorem 2 Σ (A, A 2, B) is completely reachable if and only if We can prove rankc Σ n. (2) Proposition 3 The set of all reachable states of Σ is X r ImC Σ. Proposition 4 The set of all reachable states of Σ is the smallest subspace of X which is (A, A 2 )- invariant and contains the columns of B. An immediate consequence of Proposition 4 is the following Theorem 5 Σ (A, A 2, B) is completely reachable if and only if X is the smallest subspace of X which is (A, A 2 )-invariant and contains the columns of B. By duality (Theorem ) and Theorem 2 we obtain Theorem 6 The system Σ (A, A 2, C) is completely observable if and only if ranko Σ n. (3) From () and Definition 7 we obtain Proposition 7 The set of all unobservable states of Σ is X uo KerO Σ. Proof: By using Hamilton-Cayley Theorem for A and A 2 we obtain X uo {x X CA l Ak 2 x, l, k, n } KerO Σ. Proposition 8 The set X uo of all unobservable states of Σ is the greatest subspace of X which is (A, A 2 ) invariant and is contained in KerC. We obtain from Proposition 8: Theorem 9 The system Σ (A, A 2, C) is completely observable if and only if {} is the greatest subspace of X which is (A, A 2 ) invariant and is contained in KerC. Definition 2 Two systems Σ (A, A 2, B, C) and Σ (Ã, Ã2, B, C) are said to be isomorphic if there exists a nonsingular matrix T R n n such that à i T A i T, i, 2; B T B, C CT. (4) Theorem 2 Any system Σ (A, A 2, B) is isomorphic to a system Σ (Ã, Ã2, B) of the form [ ] [ ] A A à 2 A2 A, à A 2 22, 22 A 222 [ ] B B, (5) with A, A 2 R q q, B R q m, q n. The triplet Σ (A, A 2, B ) is completely reachable. Proof: We consider the direct sum decomposition of the state space X R n as X X X 2 where X r X. The partitions of the matrices in (5) are obtained with respect to this decomposition, since by Proposition 4 X r is (A, A 2 )-invariant and contains the columns of B; q is the dimension of the subspace X r. We can derive other criteria of reachability.
4 Proceedings of the 7th WSEAS International Conference on Systems Theory and Scientific Computation, Athens, Greece, August 24-26, 27 4 Theorem 22 Σ (A, A 2, B) is completely reachable if and only if there is no common left eigenvector of matrices A and A 2, orthogonal on the columns of B. Proof:Let us assume that there exists v R n \ {} such that λ, µ C with v T A λv T, v T A 2 µv T and v T B. Then v T A i Aj 2 B λi µ j v T B i, j, hence v T C Σ, i.e. Σ (A, A 2, B) is not completely reachable. Conversely, if Σ is not completely reachable, then there exists v R n \ {} such that v T C Σ, hence the subspace S {x R n x T C Σ } contains a vector v. If x S, then x T A i Aj 2B for any i, j, n and by Hamilton-Cayley Theorem this equality is true for any i, j. Then, for any x S, (A T x)t A i Aj 2 B xt A i+ A j 2B, i, j, hence A T x S, i.e. S is A T -invariant; analogously, S is A T 2 -invariant. It results that S contains an eigenvector x of A T ; let λ be the corresponding eigenvalue. Let us consider the subspace S 2 {x X A T x λx}. If x S 2 then A T (AT 2 x) AT 2 AT x λat 2 x, hence AT 2 x S 2, that is S 2 is A T 2 -invariant and so is S 3 S S 2. Then S 3 contains an eigenvector w of A T 2 and since S 3 S 2, w is an eigenvector of A T too. Moreover, since S 3 S, we have w T C Σ and particularly w T B, hence w is a common left eigenvector of A and A 2 orthogonal on the columns of B. The following theorem is an extension to 2Dcd systems of the Popov-Hautus-Belevitch criterion of reachability. Theorem 23 Σ (A, A 2, B) is completely reachable if and only if for any λ, λ 2 C rank[ B λ I A λ 2 I A 2 ] n. Proof: Obviously, the existence of λ, λ 2 C such that rank[ B λ I A λ 2 I A 2 ] < n is equivalent to the existence of v R n \ {} such that v T [ B λ I A λ 2 I A 2 ] which means v T B, v T A λ v T, v T A 2 λ 2 v T that is, by Theorem 22, to the fact that Σ is not completely reachable. By duality we obtain the following results concerning observability: Theorem 24 The system Σ (A, A 2, C) is completely observable if and only if there is no common eigenvector of the matrices A and A 2 belonging to KerC. Theorem 25 The system Σ (A, A 2, C) is completely observable if and only if for any λ, λ 2 C C rank λ I A n. λ 2 I A 2 5 Reachability, observability and minimality Definition 26 The matrix T Σ (s, z) C(sI A ) (zi A 2 ) B (6) is called the transfer matrix of the time-invariant system Σ (A, A 2, B, C). Obviously, T Σ (s, z) is a p m rational strictly proper (in both variables s and z) matrix with separable denominator, since it has the form T Σ (s, z) det(si A )det(zi A 2 ) C(sI A ) (zi A 2 ) B. Definition 27 Given a strictly proper matrix T (s, z), a system Σ (A, A 2, B, C) is said to be a realization of Σ if T (s, z) T Σ (s, z), that is if T (s, z) C(sI A ) (zi A 2 ) B. (7) A realization Σ of T (s, z) is minimal if dimσ dim Σ for any realization Σ of T (s, z). Now let us consider the Laurent series expansion of T (s, z) about s, z T (s, z) M i,j s i z j. (8) i j The matrices M i,j R p m are called the Markov parameters of T (s, z). Proposition 28 Σ (A, A 2, B, C) is a realization of T (s, z) if and only if, for any i, j N, M i,j CA i A j 2B. (9) Proof: By (7) we have T (s, z) C(sI A ) (zi A 2 ) B C( i A i s i )( j A j 2 z j )B i j CA i Aj 2 s i z j. Since (8) holds and two equal Laurent series have equal corresponding coefficients, (9) is true. The following theorem establishes the connection between the concepts of reachability, observability and minimality.
5 Proceedings of the 7th WSEAS International Conference on Systems Theory and Scientific Computation, Athens, Greece, August 24-26, 27 5 Theorem 29 A system Σ (A, A 2, B, C) is a minimal realization of some strictly proper matrix T (s, z) if and only if Σ is completely reachable and completely observable. Proof: Necessity. By negation, let us assume that Σ is not completely reachable. Then Σ is isomorphic to a system Σ as in Theorem 2 with q < n. If we partition C as C [ C C 2 ] with C R p q, since (si n [ ] à k ) (siq A k ) A 2k (si n q A 22k ) [ (siq A k ) ]? (si n q A 22k ), k, 2 we obtain T (s, z) T Σ (s, z) T Σ(s, z) C (si q A ) (zi q A 2 ) B T Σ z), hence Σ (A, A 2, B, C ) is a realization of T (s, z) of dimension q < n, i.e. Σ is not minimal. The case Σ not completely observable is similar. Sufficiency. Let us assume that Σ is completely reachable and completely observable. If Σ is not minimal, let Σ (Â, Â2, B, Ĉ) be a realization of T (s, z) with dim Σ n < n dimσ. Let us consider the controllability and observability matrices C Σ and O Σ and let us denote by and the matrices C Σ O Σ obtained from C Σ and O Σ by replacing the matrices A, A 2, B and C by Â, Â2, B and Ĉ. By Proposition 28, since Σ and Σ are realizations of the same matrix T (s, z) we have (see (9)): CA i Aj 2 B ĈÂi B, Âj 2 i, j ; these matrices are the block elements of the product matrices O Σ C Σ and Ô ΣĈΣ hence O Σ C Σ ÔΣĈΣ. Then, by Sylvester Inequalities, we have ranko Σ + rankc Σ n ranko Σ C Σ rankôσĉσ min(rankôσ, rankĉσ). By hypothesis ranko Σ n, rankc Σ n and rankôσ n < n, rankĉσ n < n; we get n n, contradiction, hence Σ is minimal. From Theorems 23, 25 and 29 we get Theorem 3 Σ (A, A 2, B, C) is a minimal realization if and only if and rank[ B λ I A λ 2 I A 2 ] n, (2) rank for any λ, λ 2 C. C λ I A λ 2 I A 2 n (2) Since for any n n matrix A det(si A) if and only if s σ(a) (where σ(a) denotes the spectrum of A, rank(si A) n for any s / σ(a) and Theorem 3 gives Corollary 3 Σ (A, A 2, B, C) is a minimal realization if and only if equalities (2) and (2) hold for any (s, z) σ(a ) σ(a 2 ). Application Let us consider the 2Dcd system a Σ (A, A 2, B, C), where A b c, c b A 2 C [ d, B and ]. The characteristic polynomials are det(si A ) (s a)(s b c)(s b+c) and det(si A 2 ) (z a)(z )(z + ). The matrices in (2) and (2) are respectively C s a z d s b c z c s b z O T and s a z d s b c z c s b z The spectra are respectively σ(a ) {a, b c, b + c} and σ(a 2 ) {d,, } Then the 3 rd order minors of C have respectively the values, (a b) 2 c 2,d 2 and a + b + dc for (s, z) (a, d), c(b + c a), a b + c c(d ) and d for (s, z) (b + c, ), c(a b + c), 2c(a b + c), and c(d + ) for (s, z) (b c, ) and there are similar expressions for the other values of (s, z) σ(a ) σ(a 2 ). We can conclude that Σ is unreachable in the following four cases:(a b c, d ), (c, d ), (a b c, d ) and (c, d ); otherwise Σ is completely reachable. Obviously, for s a and z d ranko 2, hence Σ is unobservable. By Corollary 3 Σ is not minimal. Now, the transfer matrix of Σ is T Σ (s, z) C(sI A ) (zi A 2 ) B (s a)(s b c)(z d)( z) (s a)(s b c)(s b+c)(z d)(z )(z+) (s b+c)(z+) hence a minimal realization of Σ is à b c, à 2, B and C. 6 Conclusion Reachability and observability criteria were obtained for 2D continuous-discrete time-variable systems by using suitable 2D reachability and observability Gramians. In the case of time-invariant systems, necessary and sufficient conditions of reachability and observability were obtained by means of duality. The relationship between reachability, observability and minimality was emphasized. This research can be developed and extended to other topics of the Systems.
6 Proceedings of the 7th WSEAS International Conference on Systems Theory and Scientific Computation, Athens, Greece, August 24-26, 27 6 Theory such as stability, stabilizability, detectability, feedback and observers and optimal control for 2D continuous-discrete systems. Acknowledgements: Partially supported by the Grant CNCSIS 86/ 27 and by the 5-th Italian-Romanian Executive Programme of S&T Cooperation for 26-28, University Politehnica of Bucharest. References: [] S. Attasi, Introduction d une classe de systèmes linéaires reccurents à deux indices, C.R. Acad. Sc. Paris 277, 973, p. 35. [2] E. Fornasini and G. Marchesini, State Space Realization Theory of Two-Dimensional Filters, IEEE Trans.Aut.Control AC 2, 976, pp [3] K. Galkovski, E. Rogers and D.H. Owens, New 2D models and a transition matrix for discrete linear repetitive processes, Int.J.Control 5,999, pp [4] S. Y. Kung, B.C. Lévy, M. Morf and T. Kailath, New Results in 2-D Systems Theory, Part II: 2-D State-Space Models-Realizations and the Notions of Controllability, Observability and Minimality, Proc. of the IEEE 6, 977, pp [5] J. Kurek and M.B. Zaremba, Iterative learning control synthesis on 2D system theory, IEEE Trans.Aut.Control, 993, pp [6] V. Prepeliţă, Linear hybrid systems. Bull.Math.Soc.Sci.Math. de Roumanie 4, 979, pp [7] V. Prepeliţă, Criteria of reachability for 2D continuous-discrete systems, Rev. Roumaine Math. Pures Appl., 23, pp [8] V. Prepeliţă and Constantin Drăguşin, The duality principle in a class of 2D continuous-discrete linear systems, Math. Reports 4, 23, pp [9] R.P. Roesser, A Discrete State-Space Model for Linear Image Processing, IEEE Trans.Aut.Control, 975, pp. -.
Generalized 2D Continuous-Discrete Systems with Boundary Conditions
Generalized 2D Continuous-Discrete Systems with Boundary Conditions VALERIU PREPELIŢĂ University Politehnica of Bucharest Department of Mathematics-Informatics I Splaiul Independentei 313, 060042 Bucharest
More information16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1
16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1 Charles P. Coleman October 31, 2005 1 / 40 : Controllability Tests Observability Tests LEARNING OUTCOMES: Perform controllability tests Perform
More informationControl Systems. Laplace domain analysis
Control Systems Laplace domain analysis L. Lanari outline introduce the Laplace unilateral transform define its properties show its advantages in turning ODEs to algebraic equations define an Input/Output
More informationLinear System Theory
Linear System Theory Wonhee Kim Chapter 6: Controllability & Observability Chapter 7: Minimal Realizations May 2, 217 1 / 31 Recap State space equation Linear Algebra Solutions of LTI and LTV system Stability
More informationControl Systems Design, SC4026. SC4026 Fall 2009, dr. A. Abate, DCSC, TU Delft
Control Systems Design, SC4026 SC4026 Fall 2009, dr. A. Abate, DCSC, TU Delft Lecture 4 Controllability (a.k.a. Reachability) vs Observability Algebraic Tests (Kalman rank condition & Hautus test) A few
More information1 Continuous-time Systems
Observability Completely controllable systems can be restructured by means of state feedback to have many desirable properties. But what if the state is not available for feedback? What if only the output
More informationControllability, Observability, Full State Feedback, Observer Based Control
Multivariable Control Lecture 4 Controllability, Observability, Full State Feedback, Observer Based Control John T. Wen September 13, 24 Ref: 3.2-3.4 of Text Controllability ẋ = Ax + Bu; x() = x. At time
More information1 Similarity transform 2. 2 Controllability The PBH test for controllability Observability The PBH test for observability...
Contents 1 Similarity transform 2 2 Controllability 3 21 The PBH test for controllability 5 3 Observability 6 31 The PBH test for observability 7 4 Example ([1, pp121) 9 5 Subspace decomposition 11 51
More informationControl Systems Design, SC4026. SC4026 Fall 2010, dr. A. Abate, DCSC, TU Delft
Control Systems Design, SC4026 SC4026 Fall 2010, dr. A. Abate, DCSC, TU Delft Lecture 4 Controllability (a.k.a. Reachability) and Observability Algebraic Tests (Kalman rank condition & Hautus test) A few
More informationSYSTEMTEORI - ÖVNING 5: FEEDBACK, POLE ASSIGNMENT AND OBSERVER
SYSTEMTEORI - ÖVNING 5: FEEDBACK, POLE ASSIGNMENT AND OBSERVER Exercise 54 Consider the system: ẍ aẋ bx u where u is the input and x the output signal (a): Determine a state space realization (b): Is the
More informationControl Systems. System response. L. Lanari
Control Systems m i l e r p r a in r e v y n is o System response L. Lanari Outline What we are going to see: how to compute in the s-domain the forced response (zero-state response) using the transfer
More informationSystems and Control Theory Lecture Notes. Laura Giarré
Systems and Control Theory Lecture Notes Laura Giarré L. Giarré 2018-2019 Lesson 14: Rechability Reachability (DT) Reachability theorem (DT) Reachability properties (DT) Reachability gramian (DT) Reachability
More informationObservability. Dynamic Systems. Lecture 2 Observability. Observability, continuous time: Observability, discrete time: = h (2) (x, u, u)
Observability Dynamic Systems Lecture 2 Observability Continuous time model: Discrete time model: ẋ(t) = f (x(t), u(t)), y(t) = h(x(t), u(t)) x(t + 1) = f (x(t), u(t)), y(t) = h(x(t)) Reglerteknik, ISY,
More informationRobust 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 informationIntro. Computer Control Systems: F8
Intro. Computer Control Systems: F8 Properties of state-space descriptions and feedback Dave Zachariah Dept. Information Technology, Div. Systems and Control 1 / 22 dave.zachariah@it.uu.se F7: Quiz! 2
More informationZero 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 informationGENERALIZED HO-KALMAN ALGORITHM FOR 2D CONTINUOUS DISCRETE LINEAR SYSTEMS
GENERALIZED HO-KALMAN ALGORITHM FOR 2D CONTINUOUS DISCRETE LINEAR SYSTEMS v. Prepelita Universitatea Politehnica Bucure ti, Catedm Matematici I, Splaiul Independentei 313, Sector 6, Cod 77206, Bucure ti,
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.4: Dynamic Systems Spring Homework Solutions Exercise 3. a) We are given the single input LTI system: [
More informationModule 07 Controllability and Controller Design of Dynamical LTI Systems
Module 07 Controllability and Controller Design of Dynamical LTI Systems Ahmad F. Taha EE 5143: Linear Systems and Control Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ataha October
More informationLecture 7 and 8. Fall EE 105, Feedback Control Systems (Prof. Khan) September 30 and October 05, 2015
1 Lecture 7 and 8 Fall 2015 - EE 105, Feedback Control Systems (Prof Khan) September 30 and October 05, 2015 I CONTROLLABILITY OF AN DT-LTI SYSTEM IN k TIME-STEPS The DT-LTI system is given by the following
More informationECEN 605 LINEAR SYSTEMS. Lecture 8 Invariant Subspaces 1/26
1/26 ECEN 605 LINEAR SYSTEMS Lecture 8 Invariant Subspaces Subspaces Let ẋ(t) = A x(t) + B u(t) y(t) = C x(t) (1a) (1b) denote a dynamic system where X, U and Y denote n, r and m dimensional vector spaces,
More informationECE504: Lecture 9. D. Richard Brown III. Worcester Polytechnic Institute. 04-Nov-2008
ECE504: Lecture 9 D. Richard Brown III Worcester Polytechnic Institute 04-Nov-2008 Worcester Polytechnic Institute D. Richard Brown III 04-Nov-2008 1 / 38 Lecture 9 Major Topics ECE504: Lecture 9 We are
More informationChapter 6 Controllability and Obervability
Chapter 6 Controllability and Obervability Controllability: whether or not the state-space equation can be controlled from input. Observability: whether or not the initial state can be observed from output.
More informationNonlinear Observers. Jaime A. Moreno. Eléctrica y Computación Instituto de Ingeniería Universidad Nacional Autónoma de México
Nonlinear Observers Jaime A. Moreno JMorenoP@ii.unam.mx Eléctrica y Computación Instituto de Ingeniería Universidad Nacional Autónoma de México XVI Congreso Latinoamericano de Control Automático October
More informationJoão P. Hespanha. January 16, 2009
LINEAR SYSTEMS THEORY João P. Hespanha January 16, 2009 Disclaimer: This is a draft and probably contains a few typos. Comments and information about typos are welcome. Please contact the author at hespanha@ece.ucsb.edu.
More informationMultivariable Control. Lecture 03. Description of Linear Time Invariant Systems. John T. Wen. September 7, 2006
Multivariable Control Lecture 3 Description of Linear Time Invariant Systems John T. Wen September 7, 26 Outline Mathematical description of LTI Systems Ref: 3.1-3.4 of text September 7, 26Copyrighted
More informationControl Systems. Frequency domain analysis. L. Lanari
Control Systems m i l e r p r a in r e v y n is o Frequency domain analysis L. Lanari outline introduce the Laplace unilateral transform define its properties show its advantages in turning ODEs to algebraic
More informationContents. 1 State-Space Linear Systems 5. 2 Linearization Causality, Time Invariance, and Linearity 31
Contents Preamble xiii Linear Systems I Basic Concepts 1 I System Representation 3 1 State-Space Linear Systems 5 1.1 State-Space Linear Systems 5 1.2 Block Diagrams 7 1.3 Exercises 11 2 Linearization
More informationPositive systems in the behavioral approach: main issues and recent results
Positive systems in the behavioral approach: main issues and recent results Maria Elena Valcher Dipartimento di Elettronica ed Informatica Università dipadova via Gradenigo 6A 35131 Padova Italy Abstract
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 informationModule 03 Linear Systems Theory: Necessary Background
Module 03 Linear Systems Theory: Necessary Background Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September
More information1 Some Facts on Symmetric Matrices
1 Some Facts on Symmetric Matrices Definition: Matrix A is symmetric if A = A T. Theorem: Any symmetric matrix 1) has only real eigenvalues; 2) is always iagonalizable; 3) has orthogonal eigenvectors.
More informationKalman Decomposition B 2. z = T 1 x, where C = ( C. z + u (7) T 1, and. where B = T, and
Kalman Decomposition Controllable / uncontrollable decomposition Suppose that the controllability matrix C R n n of a system has rank n 1
More informationPARALLEL TRANSPORT AND MULTI-TEMPORAL CONTROLLABILITY
U.P.B. Sci. Bull., Series A, Vol. 77, Iss. 2, 25 ISSN 22-727 PARALLEL TRANSPORT AND MULTI-TEMPORAL CONTROLLABILITY Cristian Ghiu, Constantin Udrişte 2 Our idea was to make a bridge between the parallel
More informationModule 08 Observability and State Estimator Design of Dynamical LTI Systems
Module 08 Observability and State Estimator Design of Dynamical LTI Systems Ahmad F. Taha EE 5143: Linear Systems and Control Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ataha November
More informationECE 388 Automatic Control
Controllability and State Feedback Control Associate Prof. Dr. of Mechatronics Engineeering Çankaya University Compulsory Course in Electronic and Communication Engineering Credits (2/2/3) Course Webpage:
More informationZeros 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 informationCriterions on periodic feedback stabilization for some evolution equations
Criterions on periodic feedback stabilization for some evolution equations School of Mathematics and Statistics, Wuhan University, P. R. China (Joint work with Yashan Xu, Fudan University) Toulouse, June,
More informationEE226a - Summary of Lecture 13 and 14 Kalman Filter: Convergence
1 EE226a - Summary of Lecture 13 and 14 Kalman Filter: Convergence Jean Walrand I. SUMMARY Here are the key ideas and results of this important topic. Section II reviews Kalman Filter. A system is observable
More informationTheorem 1. ẋ = Ax is globally exponentially stable (GES) iff A is Hurwitz (i.e., max(re(σ(a))) < 0).
Linear Systems Notes Lecture Proposition. A M n (R) is positive definite iff all nested minors are greater than or equal to zero. n Proof. ( ): Positive definite iff λ i >. Let det(a) = λj and H = {x D
More informationMULTIVARIABLE ZEROS OF STATE-SPACE SYSTEMS
Copyright F.L. Lewis All rights reserved Updated: Monday, September 9, 8 MULIVARIABLE ZEROS OF SAE-SPACE SYSEMS If a system has more than one input or output, it is called multi-input/multi-output (MIMO)
More information1 Controllability and Observability
1 Controllability and Observability 1.1 Linear Time-Invariant (LTI) Systems State-space: Dimensions: Notation Transfer function: ẋ = Ax+Bu, x() = x, y = Cx+Du. x R n, u R m, y R p. Note that H(s) is always
More informationOn the connection between discrete linear repetitive processes and 2-D discrete linear systems
Multidim Syst Sign Process (217) 28:341 351 DOI 1.17/s1145-16-454-8 On the connection between discrete linear repetitive processes and 2-D discrete linear systems M. S. Boudellioua 1 K. Galkowski 2 E.
More informationSolution for Homework 5
Solution for Homework 5 ME243A/ECE23A Fall 27 Exercise 1 The computation of the reachable subspace in continuous time can be handled easily introducing the concepts of inner product, orthogonal complement
More informationCONSERVATIVE DILATIONS OF DISSIPATIVE N-D SYSTEMS: THE COMMUTATIVE AND NON-COMMUTATIVE SETTINGS. Dmitry S. Kalyuzhnyĭ-Verbovetzkiĭ
CONSERVATIVE DILATIONS OF DISSIPATIVE N-D SYSTEMS: THE COMMUTATIVE AND NON-COMMUTATIVE SETTINGS Dmitry S. Kalyuzhnyĭ-Verbovetzkiĭ Department of Mathematics Ben-Gurion University of the Negev P.O. Box 653
More informationTopics in control Tracking and regulation A. Astolfi
Topics in control Tracking and regulation A. Astolfi Contents 1 Introduction 1 2 The full information regulator problem 3 3 The FBI equations 5 4 The error feedback regulator problem 5 5 The internal model
More informationECE557 Systems Control
ECE557 Systems Control Bruce Francis Course notes, Version.0, September 008 Preface This is the second Engineering Science course on control. It assumes ECE56 as a prerequisite. If you didn t take ECE56,
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationModel reduction of large-scale dynamical systems
Model reduction of large-scale dynamical systems Lecture III: Krylov approximation and rational interpolation Thanos Antoulas Rice University and Jacobs University email: aca@rice.edu URL: www.ece.rice.edu/
More informationMEM 355 Performance Enhancement of Dynamical Systems MIMO Introduction
MEM 355 Performance Enhancement of Dynamical Systems MIMO Introduction Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University 11/2/214 Outline Solving State Equations Variation
More informationẋ n = f n (x 1,...,x n,u 1,...,u m ) (5) y 1 = g 1 (x 1,...,x n,u 1,...,u m ) (6) y p = g p (x 1,...,x n,u 1,...,u m ) (7)
EEE582 Topical Outline A.A. Rodriguez Fall 2007 GWC 352, 965-3712 The following represents a detailed topical outline of the course. It attempts to highlight most of the key concepts to be covered and
More information6.241 Dynamic Systems and Control
6.241 Dynamic Systems and Control Lecture 24: H2 Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 4, 2011 E. Frazzoli (MIT) Lecture 24: H 2 Synthesis May
More informationLecture 4 and 5 Controllability and Observability: Kalman decompositions
1 Lecture 4 and 5 Controllability and Observability: Kalman decompositions Spring 2013 - EE 194, Advanced Control (Prof. Khan) January 30 (Wed.) and Feb. 04 (Mon.), 2013 I. OBSERVABILITY OF DT LTI SYSTEMS
More informationControl, Stabilization and Numerics for Partial Differential Equations
Paris-Sud, Orsay, December 06 Control, Stabilization and Numerics for Partial Differential Equations Enrique Zuazua Universidad Autónoma 28049 Madrid, Spain enrique.zuazua@uam.es http://www.uam.es/enrique.zuazua
More informationModel reduction of interconnected systems
Model reduction of interconnected systems A Vandendorpe and P Van Dooren 1 Introduction Large scale linear systems are often composed of subsystems that interconnect to each other Instead of reducing the
More informationThe disturbance decoupling problem (DDP)
CHAPTER 3 The disturbance decoupling problem (DDP) Consider the system 3.1. Geometric formulation { ẋ = Ax + Bu + Ew y = Cx. Problem 3.1 (Disturbance decoupling). Find a state feedback u = Fx+ v such that
More informationStability, Pole Placement, Observers and Stabilization
Stability, Pole Placement, Observers and Stabilization 1 1, The Netherlands DISC Course Mathematical Models of Systems Outline 1 Stability of autonomous systems 2 The pole placement problem 3 Stabilization
More informationOn 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 informationH 2 -optimal model reduction of MIMO systems
H 2 -optimal model reduction of MIMO systems P. Van Dooren K. A. Gallivan P.-A. Absil Abstract We consider the problem of approximating a p m rational transfer function Hs of high degree by another p m
More informationSYSTEMTEORI - ÖVNING Stability of linear systems Exercise 3.1 (LTI system). Consider the following matrix:
SYSTEMTEORI - ÖVNING 3 1. Stability of linear systems Exercise 3.1 (LTI system. Consider the following matrix: ( A = 2 1 Use the Lyapunov method to determine if A is a stability matrix: a: in continuous
More informationObservability and state estimation
EE263 Autumn 2015 S Boyd and S Lall Observability and state estimation state estimation discrete-time observability observability controllability duality observers for noiseless case continuous-time observability
More informationECEN 605 LINEAR SYSTEMS. Lecture 7 Solution of State Equations 1/77
1/77 ECEN 605 LINEAR SYSTEMS Lecture 7 Solution of State Equations Solution of State Space Equations Recall from the previous Lecture note, for a system: ẋ(t) = A x(t) + B u(t) y(t) = C x(t) + D u(t),
More informationModel reduction for linear systems by balancing
Model reduction for linear systems by balancing Bart Besselink Jan C. Willems Center for Systems and Control Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen, Groningen,
More informationControllability. Chapter Reachable States. This chapter develops the fundamental results about controllability and pole assignment.
Chapter Controllability This chapter develops the fundamental results about controllability and pole assignment Reachable States We study the linear system ẋ = Ax + Bu, t, where x(t) R n and u(t) R m Thus
More informationON THE MATRIX EQUATION XA AX = τ(x)
Applicable Analysis and Discrete Mathematics, 1 (2007), 257 264. Available electronically at http://pefmath.etf.bg.ac.yu Presented at the conference: Topics in Mathematical Analysis and Graph Theory, Belgrade,
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 informationME 234, Lyapunov and Riccati Problems. 1. This problem is to recall some facts and formulae you already know. e Aτ BB e A τ dτ
ME 234, Lyapunov and Riccati Problems. This problem is to recall some facts and formulae you already know. (a) Let A and B be matrices of appropriate dimension. Show that (A, B) is controllable if and
More informationLecture notes: Applied linear algebra Part 2. Version 1
Lecture notes: Applied linear algebra Part 2. Version 1 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 First, some exercises: xercise 0.1 (2 Points) Another least
More informationLecture 19 Observability and state estimation
EE263 Autumn 2007-08 Stephen Boyd Lecture 19 Observability and state estimation state estimation discrete-time observability observability controllability duality observers for noiseless case continuous-time
More informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
More informationMath 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler.
Math 453 Exam 3 Review The syllabus for Exam 3 is Chapter 6 (pages -2), Chapter 7 through page 37, and Chapter 8 through page 82 in Axler.. You should be sure to know precise definition of the terms we
More informationMATHEMATICS 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 informationCDS Solutions to Final Exam
CDS 22 - Solutions to Final Exam Instructor: Danielle C Tarraf Fall 27 Problem (a) We will compute the H 2 norm of G using state-space methods (see Section 26 in DFT) We begin by finding a minimal state-space
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 informationTopic # Feedback Control
Topic #11 16.31 Feedback Control State-Space Systems State-space model features Observability Controllability Minimal Realizations Copyright 21 by Jonathan How. 1 Fall 21 16.31 11 1 State-Space Model Features
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 informationCME 345: MODEL REDUCTION
CME 345: MODEL REDUCTION Balanced Truncation Charbel Farhat & David Amsallem Stanford University cfarhat@stanford.edu These slides are based on the recommended textbook: A.C. Antoulas, Approximation of
More informationChap. 3. Controlled Systems, Controllability
Chap. 3. Controlled Systems, Controllability 1. Controllability of Linear Systems 1.1. Kalman s Criterion Consider the linear system ẋ = Ax + Bu where x R n : state vector and u R m : input vector. A :
More informationEC Control Engineering Quiz II IIT Madras
EC34 - Control Engineering Quiz II IIT Madras Linear algebra Find the eigenvalues and eigenvectors of A, A, A and A + 4I Find the eigenvalues and eigenvectors of the following matrices: (a) cos θ sin θ
More informationLecture 2 INF-MAT : A boundary value problem and an eigenvalue problem; Block Multiplication; Tridiagonal Systems
Lecture 2 INF-MAT 4350 2008: A boundary value problem and an eigenvalue problem; Block Multiplication; Tridiagonal Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationNull 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 informationNotes on n-d Polynomial Matrix Factorizations
Multidimensional Systems and Signal Processing, 10, 379 393 (1999) c 1999 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Notes on n-d Polynomial Matrix Factorizations ZHIPING LIN
More informationE2 212: Matrix Theory (Fall 2010) Solutions to Test - 1
E2 212: Matrix Theory (Fall 2010) s to Test - 1 1. Let X = [x 1, x 2,..., x n ] R m n be a tall matrix. Let S R(X), and let P be an orthogonal projector onto S. (a) If X is full rank, show that P can be
More informationObservability of Linear Hybrid Systems
Observability of Linear Hybrid Systems René Vidal 1, Alessandro Chiuso 2, Stefano Soatto 3, and Shankar Sastry 1 1 Department of EECS, University of California, Berkeley, CA 94720, USA, Phone: (510) 643
More informationDifferential equations
Differential equations Math 7 Spring Practice problems for April Exam Problem Use the method of elimination to find the x-component of the general solution of x y = 6x 9x + y = x 6y 9y Soln: The system
More informationA Method for Determining Stabilizeability of a Class of Switched Systems
Proceedings of the 7th WSEAS International Conference on Systems Theory and Scientific Computation Athens Greece August 4-6 007 7 A Method for Determining Stabilizeability of a Class of Switched Systems
More informationReview of Controllability Results of Dynamical System
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 13, Issue 4 Ver. II (Jul. Aug. 2017), PP 01-05 www.iosrjournals.org Review of Controllability Results of Dynamical System
More informationLecture 7 (Weeks 13-14)
Lecture 7 (Weeks 13-14) Introduction to Multivariable Control (SP - Chapters 3 & 4) Eugenio Schuster schuster@lehigh.edu Mechanical Engineering and Mechanics Lehigh University Lecture 7 (Weeks 13-14) p.
More informationThe norms can also be characterized in terms of Riccati inequalities.
9 Analysis of stability and H norms Consider the causal, linear, time-invariant system ẋ(t = Ax(t + Bu(t y(t = Cx(t Denote the transfer function G(s := C (si A 1 B. Theorem 85 The following statements
More informationMATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.
MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. Diagonalization Let L be a linear operator on a finite-dimensional vector space V. Then the following conditions are equivalent:
More informationGENERALIZED EIGENVECTORS, MINIMAL POLYNOMIALS AND THEOREM OF CAYLEY-HAMILTION
GENERALIZED EIGENVECTORS, MINIMAL POLYNOMIALS AND THEOREM OF CAYLEY-HAMILTION FRANZ LUEF Abstract. Our exposition is inspired by S. Axler s approach to linear algebra and follows largely his exposition
More informationCONTROLLABILITY OF NONLINEAR DISCRETE SYSTEMS
Int. J. Appl. Math. Comput. Sci., 2002, Vol.2, No.2, 73 80 CONTROLLABILITY OF NONLINEAR DISCRETE SYSTEMS JERZY KLAMKA Institute of Automatic Control, Silesian University of Technology ul. Akademicka 6,
More informationA Necessary and Sufficient Condition for Linear Systems to Be Observable
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 13, Issue 4 Ver. II (Jul. Aug. 2017), PP 06-10 www.iosrjournals.org A Necessary and Sufficient Condition for Linear Systems
More informationIntroduction to Nonlinear Control Lecture # 4 Passivity
p. 1/6 Introduction to Nonlinear Control Lecture # 4 Passivity È p. 2/6 Memoryless Functions ¹ y È Ý Ù È È È È u (b) µ power inflow = uy Resistor is passive if uy 0 p. 3/6 y y y u u u (a) (b) (c) Passive
More informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
More informationLetting 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 information2.4 REALIZATION AND CANONICAL FORMS
Copyright F.L. Lewis 2008 All rights reserved Updated: Saturday, October 12, 2013 These notes are taken from F.L. Lewis, Applied Optimal Control and Estimation: Digital Design and Implementation, Prentice-Hall,
More informationRank Tests for the Observability of Discrete-Time Jump Linear Systems with Inputs
Rank Tests for the Observability of Discrete-Time Jump Linear Systems with Inputs Ehsan Elhamifar Mihály Petreczky René Vidal Center for Imaging Science, Johns Hopkins University, Baltimore MD 21218, USA
More informationChapter 1. Matrix Algebra
ST4233, Linear Models, Semester 1 2008-2009 Chapter 1. Matrix Algebra 1 Matrix and vector notation Definition 1.1 A matrix is a rectangular or square array of numbers of variables. We use uppercase boldface
More information