Structural identifiability of linear mamillary compartmental systems

Size: px
Start display at page:

Download "Structural identifiability of linear mamillary compartmental systems"

Transcription

1 entrum voor Wiskunde en Informatica REPORTRAPPORT Structural identifiability of linear mamillary compartmental systems JM van den Hof Department of Operations Reasearch, Statistics, and System Theory S-R

2 Report S-R952 ISSN WI PO ox G Amsterdam The Netherlands WI is the National Research Institute for Mathematics and omputer Science WI is part of the Stichting Mathematisch entrum (SM), the Dutch foundation for promotion of mathematics and computer science and their applications SM is sponsored by the Netherlands Organization for Scientific Research (NWO) WI is a member of ERIM, the European Research onsortium for Informatics and Mathematics opyright Stichting Mathematisch entrum PO ox 9479, 9 G Amsterdam (NL) Kruislaan 43, 98 SJ Amsterdam (NL) Telephone Telefax

3 Structural Identiability of Linear Mamillary ompartmental Systems JM van den Hof WI, PO ox 9479, 9 G Amsterdam, The Netherlands Abstract In biology and mathematics compartmental systems are frequently used System identication of systems based on physical laws often involves parameter estimation efore parameter estimation can take place, we have to examine whether the parameters are structurally identiable In this paper we propose a test for the structural identiability of linear mamillary compartmental systems The method is based on the similarity transformation approach AMS Subject lassication (99): 933, 935 Keywords and Phrases: system identication, compartmental systems, structural identiability, positive linear systems, realization Note: This paper will appear in the Proceedings of the Third European ontrol onference, E95, Rome, September, 995 Introduction In this paper we shall investigate the structural identiability of a certain class of compartmental systems, the so-called mamillary systems The class of compartmental systems is a frequently used class of models in biology and mathematics Such a system consists of several compartments with more or less homogeneous concentrations of material The compartments interact by processes of transportation and diusion Linear compartmental systems consist of inputs, states, and outputs, which are positive, so these systems are in system theory called positive linear systems In many models we can use some prior knowledge on the system parameters, derived from physical laws and, in biological systems, from anatomical structure, biochemistry, and physiology We can incorporate this structure in a system and obtain a class of structured linear dynamic systems efore estimating the parameters, we have to examine whether the parameters are structurally identiable, ie, whether we can in principle determine the parameters uniquely from the data In much of the literature on identiability only local identiability is treated, see [9, 8] There are several methods to test local identiability, but only a few can test global identiability These include the Laplace transform approach, described in for example [, 8,, 5], the Taylor series expansion approach, in for example [8, 5], and the exhaustive modeling or similarity transformation approach, see for example [3, 7, 8,, 4] The last two approaches can also be applied, in an adapted version, to nonlinear systems, see [4, 9] In this paper we mean global structural identiability, when we speak about structural identiability The outline of this paper is as follows In section 2 the problem is formulated and the theorems we need are given In section 3 the results for a class of mamillary systems are given

4 2 2 Definitions and problem formulation In this section the problem is posed We shall use the notation and denitions given in [7, section 3], but we will consider the continuous-time case, which can easily be derived from the discrete-time version For linear dynamic systems of the form _x(t) = Ax(t) + u(t); x(t ) = x ; y(t) = x(t) + Du(t); (2) with A 2 R nn, 2 R nm, 2 R kn, D 2 R km, the impulse response function W is dened by W (t) = e At ; t > ; and will be extended at t = to W () = D It can completely be characterized by the Markov parameters, dened as follows: M() = D; M(j) = dj? dt j? W (t)j t= = A j? ; j = ; 2; : : : : We can view the Markov parameters M(); M(); M(2); : : : as a function M : NI! R km The set of Markov parameters M : NI! R km will be denoted by M(k; m) Let LP(n; m; k) = R nn R nm R kn R km consist of the elements (A; ; ; D), ie the system parameters, as dened above Dene the map that associates the system parameters of a linear dynamic system with the Markov parameters g : LP(n; m; k)! M(k; m) by g((a; ; ; D))(j) = D; j = ; A j? ; j > : (22) Structured linear dynamic systems are linear dynamic systems in which the system parameters A,,, and D are polynomial maps, dened on a parameter set P R r In this paper the initial condition x is assumed to be zero or known In practice x is often (partially) unknown This problem is much more complicated, and is treated in [2], together with structural identiability from the input-output observations A subclass of the linear dynamic systems is formed by the positive linear systems Positive linear systems are linear dynamic systems in which the state, input, and output space are X = R n +, U = R m +, Y = R k +, respectively A special class of structured positive linear dynamic systems is formed by the linear compartmental systems For a general text on this class of systems, see [] Linear compartmental systems are positive linear systems of the form (2), for which conservation of mass holds This corresponds with the following requirements on the matrices of continuous-time linear systems all elements of,, and D are nonnegative; for A = (a ij ) i;j=;:::;n, we have a ij ; i; j 2 f; : : : ; ng; i 6= j; a ii? nx a ji ; or nx j=;j6=i j= a ji ; i 2 f; : : : ; ng: The model studied in this paper belongs to this class of systems The problem in this paper is whether the parameters of a structured linear system are structurally identiable For the denition of this concept we refer to [7, section 4] Intuitively, structural

5 3 identiability is whether we can uniquely determine the parameter values from the observations of inputs and outputs Structural identiability has been introduced by ellman and Astrom in [] Since then structural identiability of linear and nonlinear structured systems has been studied by many authors The similarity approach for the test of structural identiability is based on realization theory For time-invariant nite-dimensional linear systems the realization problem has been solved Hence equivalent conditions for structural identiability may be formulated For other classes of dynamic systems, such as positive linear systems, the realization problem is still open, so conditions for structural identiability may not be known For the realization of positive linear systems, see [2, 22] Theorem 2 onsider the structured linear dynamic system _x(t) = A(p)x(t) + (p)u(t); x(t ) = x ; y(t) = (p)x(t) + D(p)u(t); with parametrization (P; f), f : P! SLP (n; m; k), p 7! (A(p); (p); (p); D(p)) a This system is structurally minimal if and only if it is structurally reachable and structurally observable b Assume that the system is structurally minimal Then this parametrization is structurally identi- able from the Markov parameters if and only if for all p; q 2 P outside an algebraic set and T 2 R nn, nonsingular, the equations A(p) = T A(q)T? ; (p) = T (q); (p) = (q)t? ; D(p) = D(q); (23) imply that p = q Under the assumption stated and for all q 2 P outside an algebraic set, the system of equations (23) for the pair (p; T ) 2 P R nn ; with T nonsingular, has the unique solution (p; T ) = (q; I) Proof This result follows directly from the main result of realization theory for time-invariant nite-dimensional linear systems For references see [2, 2, 3, 6] Remark 22 A structured linear dynamic system is structurally reachable (structurally observable) if it is reachable (observable) for all p 2 P outside an algebraic set To obtain equations that are not too complex, we will rewrite condition (23) as follows: A(p)T = T A(q); (p) = T (q); (p)t = (q); D(p) = D(q): (24) Then we obtain polynomial equations that are linear in the elements of T, which are easier to handle For positive linear systems, ie, with input, state, and output positive, the conditions given in Theorem 2 are only sucient, not necessary Proposition 23 onsider the structured positive linear system _x(t) = A(p)x(t) + (p)u(t); x(t ) = x ; y(t) = (p)x(t) + D(p)u(t); with parametrization (P; f), f : P! SLP (n; m; k) The parametrization (P; f) is structurally identiable from the Markov parameters if the following conditions are satised: this system is structurally reachable and structurally observable in the sense of ordinary linear dynamic systems; 2 ondition (23) implies p = q for all p; q 2 P, outside an algebraic set, and T 2 R nn, nonsingular Proof If a linear dynamic system is structurally minimal as an ordinary linear system, it is denitely minimal as a positive linear system 2

6 4 3 A general mamillary system In this section we shall derive results on the structural identiability of a class of compartmental systems, in which there is a central compartment and only exchange between this central compartment and the other compartments In the literature this kind of system is called a mamillary system, and the central compartment the mother compartment In [5] also results on identiability of mamillary systems are given, but these only concern local identiability The reason that the system in this section is globally identiable, is that there is some prior knowledge about some parameter values We will study the following mamillary system, in which there is an input u in the mother compartment and we can take measurements in the mother compartment, as shown in Figure There is excretion to the environment from only one non-mother compartment, say, without loss of generality, from compartment x xn?2 hn?2 n?2 xj j hn? xn? hj n? input u y = xn h x exchange 2 h 2 with environment x 2 Figure : General mamillary model The model is given by the following dierential equations _x =?( + )x + h x n ; _x 2 =? 2 x 2 + h 2 x n ; _x 3 =? 3 x 3 + h 3 x n ; _x n? =? n?x n? + h n?x n ; _x n = n? X i= i x i? h n x n + u; in which x i denotes the concentration or amount of a substance in compartment i, i denotes the rate of exchange of the substance from compartment i into the mother compartment, is the excretion rate, and h i, for i = ; : : : ; n?, is the rate of exchange from the mother compartment

7 P n? into compartment i Finally, h n = h i= i The values of h ; h 2 ; : : : ; h n are assumed to be known, which is realistic: we have several examples for which this assumption holds We assume these values h i to be nonzero and mutually unequal The unknown parameters are ; 2 ; : : : ; n?, and If we write the system in the compact form of a structured linear system, we will obtain _x = A(p)x + (p)u; x(t ) = x ; y = (p)x;? T with x = x x 2 x n, p = ( ; 2 ; : : : ; n?; ),?? h? 2 h 2 A(p) =? n? h n? 2 n??h n A ; (p) = A ; (p) =? Formally, this system is parametrized by the parametrization (P; f), with P = f( ; 2 ; : : : ; n?; ) 2 R n + Rn g f(p) = (A(p); (p); (p)) for p 2 P: Theorem 3 The parametrization (P; f) of the structured linear dynamic system described above is structurally identiable from the Markov parameters as a positive linear system For the proof of Theorem 3 we need the following lemma Lemma 32 onsider the linear dynamic system 5 (3) _x = Ax + u; x(t ) = x ; y = x; (32) with x 2 R n, u 2 R, y 2 R, A = 2 2 n? n? A ; = 2 n? =? Then A ; i 6= ; i = ; : : : ; n? ; (A; ) is reachable if and only if i 6= j ; i; j = ; : : : ; n? ; i 6= j: i 6= ; i = ; : : : ; n? ; 2 (A; ) is observable if and only if i 6= j ; i; j = ; : : : ; n? ; i 6= j: Proof of Lemma 32 We will use the reachability condition of Hautus, []: (A; ) is reachable if and only if rank? I? A = n; for all 2 :

8 6 For (32) we have? rank I? A = rank = rank(d ) + ;??? 2? 2? n?? n??? 2? n?? A with D :=??? 2? 2 A 2 R(n?)n :? n?? n? (() For 6= i, i = ; : : : ; n?, we have rank(d ) = n? For = i, we have i 6= ; i = ; : : : ; n? ; j 6= i ; i; j = ; : : : ; n? ; j 6= i imply rank(d ) = n? : ()) Assume i = Then, for = i, the ith row of D is equal to zero, so rank(d ) < n? Assume i = j for some i; j = ; : : : ; n? ; i 6= j Then, for = i, the ith and the jth column of D are equal to zero, so rank(d ) < n? i 6= ; i = ; : : : ; n? ; It follows that (A; ) is reachable if and only if i 6= j ; i; j = ; : : : ; n? ; i 6= j: 2 This follows from the fact that (A; ) is observable if and only if (A T ; T ) is reachable 2 Remark 33 The system (32) is an example of a general input-output hierarchical system, dened by Davison [6] In that paper Davison proves that such a system is controllable and observable for almost all interconnection gains (in Lemma 32 the i and i ) and almost all output gain matrices (in Lemma 32 the i and ) ut this does not say anything about what happens if for example j = j for some j This can just be the exception which lies in the algebraic set, or the hyper-surface in [6] Proof of Theorem 3 For the problem of structural identiability we will look at this positive linear system as an ordinary linear system For Theorem 2, we rst have to check structural reachability and structural observability From Lemma 32 it follows that (A(p); (p)) is reachable if and only if 8 < : h i 6= ; i = ; 2; : : : ; n? ; i 6= j ; i; j = 2; 3; : : : ; n? ; i 6= j; + 6= i ; i = 2; 3; : : : ; n? ; and (A(p); (p)) is observable if and only if 8 < : i 6= ; i = ; 2; : : : ; n? ; i 6= j ; i; j = 2; 3; : : : ; n? ; i 6= j; + 6= i ; i = 2; 3; : : : ; n? ; It follows that the system will be structurally reachable and structurally observable, if we take for the algebraic set

9 7 n? n? S = n( ; 2 ; : : : ; n?; ) 2 R n j f( +? i ) i Y i=2 Y j=i+ o ( j? i )g = : Now we may check structural identiability by the similarity approach For p 2 R n, nd all ~p 2 R n and T 2 R nn, such that (p)t = (~p); (33) (p) = T (~p); (34) A(p)T = T A(~p): (35) From (33) and (34) it immediately follows that T has the following form: T = t t ;n? t n?; t n?;n? A (36) The rst row of (35) gives the following equations?( + )t =?t (~ + ); ~?( + )t k =?t k ~ k ; k = 2; 3; : : : ; n? ; (37) and h = P n? j= t jh j : (38) For i = 2; 3; : : : ; n?, the ith row of (35) gives the following equations? i t i =?t i (~ + ); ~? i t ik =?t ik ~ k ; k = 2; 3; : : : ; n? ; (39) and h i = P n? j= t ijh j : (3) Outside S, +, 2, 3 ; : : : ; n? are mutually unequal, so in every column of T there is at most one nonzero element Indeed, assume t ik and t jk, i 6= j, are both nonzero To make notation easier, we take i; j; k 2 f2; 3; : : : ; n? g, but for i; j; k 2 f; 2; : : : ; n? g the same reasoning holds Then (39) gives i t ik = t ik ~ k and j t jk = t jk ~ k, from which it follows that i = j ontradiction Moreover, from the non-singularity of T it follows that exactly one element in every row and every column of T is nonzero Assume t ij 6= for some i; j 2 f2; 3; : : : ; n? g Then it follows from (39),? i t ij =?t ij ~ j, that ~ j = i, and from the jth entry of the nth row of (35) that i t ij = ~ j So t ij = ut then (3) gives h i = h j, which, by assumption on the h i being dierent, is only possible if i = j onsequently we have t 22 = t 33 = = t n?;n? =, t ij = for i; j 2 f; 2; : : : ; n? g, i 6= j, and therefore t 6= Now (38) gives h = t h, which implies t = So T = I and ~p = p With Theorem 2 and Proposition 23 it follows that the parametrization is structurally identiable as a positive linear system 2 Assume there is not only excretion from compartment x to the environment, but also from a nonmother compartment, say, compartment x j, for some j 2 f2; 3; : : : ; n? g Then in the matrix A(p) the j; j-entry is? j? with unknown With Lemma 32 the system is structurally reachable and structurally observable, but the parametrization is not structurally identiable Indeed, T, with t = t jj =, t j = h =h j, t j = h j =h, and the other elements as above, satises (33), (34),

10 8 and (35) for a suitable ~p So it is necessary to restrict to only one non-mother compartment with excretion to the environment At the other hand, if there is besides from compartment x also excretion from the mother compartment, x n, to the environment, we obtain the following structured linear system, _x = A(p)x + (p)u; x(t ) = x ; y = (p)x; with x as above, p = ( ; 2 ; : : : ; n?; ; ), A(p) =?? h? 2 h 2? n? h n? A ; 2 n??h n? and (p) and (p) as above Formally, this system is parametrized by the parametrization (P ; f ), with P = f( ; 2 ; : : : ; n?; ; ) 2 R n+ + Rn+ g f (p) = (A(p); (p); (p)) for p 2 P : Theorem 34 The parametrization (P ; f ) of the structured linear dynamic system described above is structurally identiable from the Markov parameters as a positive linear system Proof ecause in Lemma 32 there exist no restrictions on, which is equivalent to?h n? in the case of the parametrization (P ; f ) above, the pair (A(p); (p)) will be reachable and (A(p); (p)) will be observable outside S dened in the proof of Theorem 3 Now we may check structural identiability by the similarity approach For p 2 R n+, nd all ~p 2 R n+ and T 2 R nn, such that (p)t = (~p); (3) (p) = T (~p); (32) A(p)T = T A(~p): (33) From (3) and (32) it immediately follows that T is of the form (36) Now the nth entry of the nth row of (33) gives?h n? =?h n? ~; so ~ = The remaining part of the proof is equivalent to the proof of Theorem onclusions For mamillary systems with input and observations in the mother compartment and excretion only from one non-mother compartment, it is shown that the unknown parameters are (globally) structurally identiable from the Markov parameters Also some results on structural reachability and structural observability are given References R ellman and K J Astrom On structural identiability Math iosciences, 7:329{339, 97 2 F M allier and A Desoer Linear System Theory Springer Texts in Electrical Engineering Springer-Verlag, New York, 99 3 M J hapman and K R Godfrey On structural equivalence and identiability constraint ordering In E Walter, editor, Identiability of parametric models, pages 32{4, Oxford, 987 Pergamon Press

11 9 4 M J happell, K R Godfrey, and S Vajda Global identiability of the parameters of nonlinear systems with specied inputs: A comparison of methods Math iosciences, 2:4{73, 99 5 obelli, A Lepschy, and G R Jacur Identiability results on some constrained compartmental systems Math iosciences, 47:73{95, E J Davison onnectability and structural controllability of composite systems Automatica, 3:9{23, K Glover and J Willems Parametrizations of linear dynamical systems: anonical forms and identiability IEEE Trans Automatic ontrol, 9:64{645, K R Godfrey and J J DiStefano III Identiability of model parameters In E Walter, editor, Identiability of parametric models, pages {2, Oxford, 987 Pergamon Press 9 M S Grewal and K Glover Identiability of linear and nonlinear dynamical systems IEEE Trans Automatic ontrol, 2:833{837, 976 M L J Hautus ontrollability and observability conditions of linear autonomous systems Indag Math, 3, 969 J A Jacquez ompartmental Analysis in iology and Medicine The University of Michigan Press, Ann Arbor, R E Kalman Mathematical description of linear dynamical systems Journal SIAM on ontrol, :52{92, R E Kalman, P L Falb, and M A Arbib Topics in mathematical systems theory McGraw-Hill ook o, New York, Y Lecourtier and A Raksanyi The testing of structural properties through symbolic computation In E Walter, editor, Identiability of parameter models, pages 75{84, Oxford, 987 Pergamon Press 5 J P Norton An investigation of the sources of nonuniqueness in deterministic identiability Math iosciences, 6:89{8, E D Sontag Mathematical ontrol Theory Number 6 in Texts in Applied Mathematics Springer-Verlag, erlin, 99 7 I G Sterlina and J H van Schuppen Structural identiability of dynamic systems operating under feedback with application to economic systems Report S-R943, WI, Amsterdam, S Vajda Deterministic identiability and algebraic invariants for polynomial systems IEEE Trans Automatic ontrol, 32:82{84, S Vajda, K R Godfrey, and H Rabitz Similarity transformation approach to identiability analysis of nonlinear compartmental models Math iosciences, 93:27{248, J M van den Hof Realization of positive linear systems Preprint, Submitted to a journal, J M van den Hof Structural identiability of linear compartmental systems Preprint, submitted to a journal, J M van den Hof and J H van Schuppen Realization of positive linear systems using polyhedral cones In Proceedings of the 33rd onference on Decision and ontrol, pages 3889{3893 IEEE, 994

System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den

System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den University of Groningen System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF)

More information

hapter 8 Simulation/Realization 8 Introduction Given an nth-order state-space description of the form x_ (t) = f (x(t) u(t) t) (state evolution equati

hapter 8 Simulation/Realization 8 Introduction Given an nth-order state-space description of the form x_ (t) = f (x(t) u(t) t) (state evolution equati Lectures on Dynamic Systems and ontrol Mohammed Dahleh Munther Dahleh George Verghese Department of Electrical Engineering and omputer Science Massachuasetts Institute of Technology c hapter 8 Simulation/Realization

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

BUMPLESS SWITCHING CONTROLLERS. William A. Wolovich and Alan B. Arehart 1. December 27, Abstract

BUMPLESS SWITCHING CONTROLLERS. William A. Wolovich and Alan B. Arehart 1. December 27, Abstract BUMPLESS SWITCHING CONTROLLERS William A. Wolovich and Alan B. Arehart 1 December 7, 1995 Abstract This paper outlines the design of bumpless switching controllers that can be used to stabilize MIMO plants

More information

Positive systems in the behavioral approach: main issues and recent results

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

REMARKS ON THE TIME-OPTIMAL CONTROL OF A CLASS OF HAMILTONIAN SYSTEMS. Eduardo D. Sontag. SYCON - Rutgers Center for Systems and Control

REMARKS ON THE TIME-OPTIMAL CONTROL OF A CLASS OF HAMILTONIAN SYSTEMS. Eduardo D. Sontag. SYCON - Rutgers Center for Systems and Control REMARKS ON THE TIME-OPTIMAL CONTROL OF A CLASS OF HAMILTONIAN SYSTEMS Eduardo D. Sontag SYCON - Rutgers Center for Systems and Control Department of Mathematics, Rutgers University, New Brunswick, NJ 08903

More information

Stability Theory for Nonnegative and Compartmental Dynamical Systems with Time Delay

Stability Theory for Nonnegative and Compartmental Dynamical Systems with Time Delay 1 Stability Theory for Nonnegative and Compartmental Dynamical Systems with Time Delay Wassim M. Haddad and VijaySekhar Chellaboina School of Aerospace Engineering, Georgia Institute of Technology, Atlanta,

More information

University of Minnesota. Michael Neumann. Department of Mathematics. University of Connecticut

University of Minnesota. Michael Neumann. Department of Mathematics. University of Connecticut ONVEXITY AND ONAVITY OF THE PERRON ROOT AND VETOR OF LESLIE MATRIES WITH APPLIATIONS TO A POPULATION MODEL Stephen J Kirkland Institute for Mathematics and its Applications University of Minnesota Minneapolis,

More information

Control for Coordination of Linear Systems

Control for Coordination of Linear Systems Control for Coordination of Linear Systems André C.M. Ran Department of Mathematics, Vrije Universiteit De Boelelaan 181a, 181 HV Amsterdam, The Netherlands Jan H. van Schuppen CWI, P.O. Box 9479, 19 GB

More information

Compartmental modeling

Compartmental modeling Compartmental modeling This is a very short summary of the notes from my two-hour lecture. These notes were not originally meant to be distributed, and so they are far from being complete. A comprehensive

More information

A basic canonical form of discrete-time compartmental systems

A basic canonical form of discrete-time compartmental systems Journal s Title, Vol x, 200x, no xx, xxx - xxx A basic canonical form of discrete-time compartmental systems Rafael Bru, Rafael Cantó, Beatriz Ricarte Institut de Matemàtica Multidisciplinar Universitat

More information

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica

More information

A note on coinduction and weak bisimilarity for while programs

A note on coinduction and weak bisimilarity for while programs Centrum voor Wiskunde en Informatica A note on coinduction and weak bisimilarity for while programs J.J.M.M. Rutten Software Engineering (SEN) SEN-R9826 October 31, 1998 Report SEN-R9826 ISSN 1386-369X

More information

460 HOLGER DETTE AND WILLIAM J STUDDEN order to examine how a given design behaves in the model g` with respect to the D-optimality criterion one uses

460 HOLGER DETTE AND WILLIAM J STUDDEN order to examine how a given design behaves in the model g` with respect to the D-optimality criterion one uses Statistica Sinica 5(1995), 459-473 OPTIMAL DESIGNS FOR POLYNOMIAL REGRESSION WHEN THE DEGREE IS NOT KNOWN Holger Dette and William J Studden Technische Universitat Dresden and Purdue University Abstract:

More information

REPORTRAPPORT. Centrum voor Wiskunde en Informatica. Asymptotics of zeros of incomplete gamma functions. N.M. Temme

REPORTRAPPORT. Centrum voor Wiskunde en Informatica. Asymptotics of zeros of incomplete gamma functions. N.M. Temme Centrum voor Wiskunde en Informatica REPORTRAPPORT Asymptotics of zeros of incomplete gamma functions N.M. Temme Department of Analysis, Algebra and Geometry AM-R9402 994 Asymptotics of Zeros of Incomplete

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

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra. DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1

More information

Stability of implicit-explicit linear multistep methods

Stability of implicit-explicit linear multistep methods Centrum voor Wiskunde en Informatica REPORTRAPPORT Stability of implicit-explicit linear multistep methods J. Frank, W.H. Hundsdorfer and J.G. Verwer Department of Numerical Mathematics NM-R963 1996 Report

More information

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition) Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational

More information

Spurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics

Spurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics

More information

A Stable Finite Dierence Ansatz for Higher Order Dierentiation of Non-Exact. Data. Bob Anderssen and Frank de Hoog,

A Stable Finite Dierence Ansatz for Higher Order Dierentiation of Non-Exact. Data. Bob Anderssen and Frank de Hoog, A Stable Finite Dierence Ansatz for Higher Order Dierentiation of Non-Exact Data Bob Anderssen and Frank de Hoog, CSIRO Division of Mathematics and Statistics, GPO Box 1965, Canberra, ACT 2601, Australia

More information

LOCALLY POSITIVE NONLINEAR SYSTEMS

LOCALLY POSITIVE NONLINEAR SYSTEMS Int. J. Appl. Math. Comput. Sci. 3 Vol. 3 No. 4 55 59 LOCALLY POSITIVE NONLINEAR SYSTEMS TADEUSZ KACZOREK Institute of Control Industrial Electronics Warsaw University of Technology ul. Koszykowa 75 66

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

University of California Department of Mechanical Engineering ECE230A/ME243A Linear Systems Fall 1999 (B. Bamieh ) Lecture 3: Simulation/Realization 1

University of California Department of Mechanical Engineering ECE230A/ME243A Linear Systems Fall 1999 (B. Bamieh ) Lecture 3: Simulation/Realization 1 University of alifornia Department of Mechanical Engineering EE/ME Linear Systems Fall 999 ( amieh ) Lecture : Simulation/Realization Given an nthorder statespace description of the form _x(t) f (x(t)

More information

A dynamic model of mobile source air pollution and its properties

A dynamic model of mobile source air pollution and its properties Environmental Health Risk IV 4 A dynamic model of mobile source air pollution and its properties V. Rumchev & L. Caccetta Department of Mathematics and Statistics, Curtin University of Technology, Australia

More information

Math Camp Notes: Linear Algebra II

Math Camp Notes: Linear Algebra II Math Camp Notes: Linear Algebra II Eigenvalues Let A be a square matrix. An eigenvalue is a number λ which when subtracted from the diagonal elements of the matrix A creates a singular matrix. In other

More information

Stability of interval positive continuous-time linear systems

Stability of interval positive continuous-time linear systems BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 66, No. 1, 2018 DOI: 10.24425/119056 Stability of interval positive continuous-time linear systems T. KACZOREK Białystok University of

More information

Rank-one LMIs and Lyapunov's Inequality. Gjerrit Meinsma 4. Abstract. We describe a new proof of the well-known Lyapunov's matrix inequality about

Rank-one LMIs and Lyapunov's Inequality. Gjerrit Meinsma 4. Abstract. We describe a new proof of the well-known Lyapunov's matrix inequality about Rank-one LMIs and Lyapunov's Inequality Didier Henrion 1;; Gjerrit Meinsma Abstract We describe a new proof of the well-known Lyapunov's matrix inequality about the location of the eigenvalues of a matrix

More information

C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a

C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a Modelling, Analysis and Simulation Modelling, Analysis and Simulation Bilinear forms for the recovery-based discontinuous Galerkin method

More information

In: Proc. BENELEARN-98, 8th Belgian-Dutch Conference on Machine Learning, pp 9-46, 998 Linear Quadratic Regulation using Reinforcement Learning Stephan ten Hagen? and Ben Krose Department of Mathematics,

More information

Model reduction for linear systems by balancing

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

Positive and Monotone Systems

Positive and Monotone Systems History of Control, 2012, Lund May 29, 2012 Outline. 1 Positive Systems Definition Fathers Occurrence Example Publications. 2 Monotone Systems Definition Early days Publications Positive System A continuous

More information

Contents. 6 Systems of First-Order Linear Dierential Equations. 6.1 General Theory of (First-Order) Linear Systems

Contents. 6 Systems of First-Order Linear Dierential Equations. 6.1 General Theory of (First-Order) Linear Systems Dierential Equations (part 3): Systems of First-Order Dierential Equations (by Evan Dummit, 26, v 2) Contents 6 Systems of First-Order Linear Dierential Equations 6 General Theory of (First-Order) Linear

More information

Null controllable region of LTI discrete-time systems with input saturation

Null controllable region of LTI discrete-time systems with input saturation Automatica 38 (2002) 2009 2013 www.elsevier.com/locate/automatica Technical Communique Null controllable region of LTI discrete-time systems with input saturation Tingshu Hu a;, Daniel E. Miller b,liqiu

More information

Elementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),

Elementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q), Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes

More information

Matrix factorization and minimal state space realization in the max-plus algebra

Matrix factorization and minimal state space realization in the max-plus algebra KULeuven Department of Electrical Engineering (ESAT) SISTA Technical report 96-69 Matrix factorization and minimal state space realization in the max-plus algebra B De Schutter and B De Moor If you want

More information

Review of Controllability Results of Dynamical System

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

Calculus and linear algebra for biomedical engineering Week 3: Matrices, linear systems of equations, and the Gauss algorithm

Calculus and linear algebra for biomedical engineering Week 3: Matrices, linear systems of equations, and the Gauss algorithm Calculus and linear algebra for biomedical engineering Week 3: Matrices, linear systems of equations, and the Gauss algorithm Hartmut Führ fuehr@matha.rwth-aachen.de Lehrstuhl A für Mathematik, RWTH Aachen

More information

Memoryless output feedback nullification and canonical forms, for time varying systems

Memoryless output feedback nullification and canonical forms, for time varying systems Memoryless output feedback nullification and canonical forms, for time varying systems Gera Weiss May 19, 2005 Abstract We study the possibility of nullifying time-varying systems with memoryless output

More information

Lecture 9. Systems of Two First Order Linear ODEs

Lecture 9. Systems of Two First Order Linear ODEs Math 245 - Mathematics of Physics and Engineering I Lecture 9. Systems of Two First Order Linear ODEs January 30, 2012 Konstantin Zuev (USC) Math 245, Lecture 9 January 30, 2012 1 / 15 Agenda General Form

More information

Lecture 2: Review of Prerequisites. Table of contents

Lecture 2: Review of Prerequisites. Table of contents Math 348 Fall 217 Lecture 2: Review of Prerequisites Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams. In this

More information

De Nugis Groebnerialium 5: Noether, Macaulay, Jordan

De Nugis Groebnerialium 5: Noether, Macaulay, Jordan De Nugis Groebnerialium 5: Noether, Macaulay, Jordan ACA 2018 Santiago de Compostela Re-reading Macaulay References Macaulay F. S., On the Resolution of a given Modular System into Primary Systems including

More information

Math 314 Lecture Notes Section 006 Fall 2006

Math 314 Lecture Notes Section 006 Fall 2006 Math 314 Lecture Notes Section 006 Fall 2006 CHAPTER 1 Linear Systems of Equations First Day: (1) Welcome (2) Pass out information sheets (3) Take roll (4) Open up home page and have students do same

More information

Linear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)

Linear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02) Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 206, v 202) Contents 2 Matrices and Systems of Linear Equations 2 Systems of Linear Equations 2 Elimination, Matrix Formulation

More information

a11 a A = : a 21 a 22

a11 a A = : a 21 a 22 Matrices The study of linear systems is facilitated by introducing matrices. Matrix theory provides a convenient language and notation to express many of the ideas concisely, and complicated formulas are

More information

System identification with information theoretic criteria

System identification with information theoretic criteria Centrum voor Wiskunde en Informatica REPORTRAPPORT System identification with information theoretic criteria A.A. Stoorvogel and J.H. van Schuppen Department of Operations Reasearch, Statistics, and System

More information

Centrum voor Wiskunde en Informatica

Centrum voor Wiskunde en Informatica Centrum voor Wiskunde en Informatica Modelling, Analysis and Simulation Modelling, Analysis and Simulation Two-point Taylor expansions of analytic functions J.L. Lópe, N.M. Temme REPORT MAS-R0 APRIL 30,

More information

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2

More information

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................

More information

The iterative convex minorant algorithm for nonparametric estimation

The iterative convex minorant algorithm for nonparametric estimation The iterative convex minorant algorithm for nonparametric estimation Report 95-05 Geurt Jongbloed Technische Universiteit Delft Delft University of Technology Faculteit der Technische Wiskunde en Informatica

More information

ECON0702: Mathematical Methods in Economics

ECON0702: Mathematical Methods in Economics ECON0702: Mathematical Methods in Economics Yulei Luo SEF of HKU January 12, 2009 Luo, Y. (SEF of HKU) MME January 12, 2009 1 / 35 Course Outline Economics: The study of the choices people (consumers,

More information

Average Reward Parameters

Average Reward Parameters Simulation-Based Optimization of Markov Reward Processes: Implementation Issues Peter Marbach 2 John N. Tsitsiklis 3 Abstract We consider discrete time, nite state space Markov reward processes which depend

More information

Linear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains

Linear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains Linear Algebra: Linear Systems and Matrices - Quadratic Forms and Deniteness - Eigenvalues and Markov Chains Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 3, 3 Systems

More information

5 Eigenvalues and Diagonalization

5 Eigenvalues and Diagonalization Linear Algebra (part 5): Eigenvalues and Diagonalization (by Evan Dummit, 27, v 5) Contents 5 Eigenvalues and Diagonalization 5 Eigenvalues, Eigenvectors, and The Characteristic Polynomial 5 Eigenvalues

More information

Linear Algebra, 4th day, Thursday 7/1/04 REU Info:

Linear Algebra, 4th day, Thursday 7/1/04 REU Info: Linear Algebra, 4th day, Thursday 7/1/04 REU 004. Info http//people.cs.uchicago.edu/laci/reu04. Instructor Laszlo Babai Scribe Nick Gurski 1 Linear maps We shall study the notion of maps between vector

More information

CS 246 Review of Linear Algebra 01/17/19

CS 246 Review of Linear Algebra 01/17/19 1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector

More information

On at systems behaviors and observable image representations

On at systems behaviors and observable image representations Available online at www.sciencedirect.com Systems & Control Letters 51 (2004) 51 55 www.elsevier.com/locate/sysconle On at systems behaviors and observable image representations H.L. Trentelman Institute

More information

Linear systems the finite dimensional case

Linear systems the finite dimensional case Linear systems the finite dimensional case Johann Baumeister Goethe University, Frankfurt, Germany Rio de Janeiro / October 2017 Outline Controlled and observed systems Stability Observability Controllablity

More information

EIGENVALUES AND EIGENVECTORS 3

EIGENVALUES AND EIGENVECTORS 3 EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices

More information

Chapter 4 No. 4.0 Answer True or False to the following. Give reasons for your answers.

Chapter 4 No. 4.0 Answer True or False to the following. Give reasons for your answers. MATH 434/534 Theoretical Assignment 3 Solution Chapter 4 No 40 Answer True or False to the following Give reasons for your answers If a backward stable algorithm is applied to a computational problem,

More information

Chapter Two Elements of Linear Algebra

Chapter Two Elements of Linear Algebra Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to

More information

Linear Feedback Observable Systems and Stabilizability

Linear Feedback Observable Systems and Stabilizability IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 13, Issue 3 Ver. V (May - June 2017), PP 43-48 www.iosrjournals.org Linear Feedback Observable Systems and Stabilizability

More information

Quadratic and Copositive Lyapunov Functions and the Stability of Positive Switched Linear Systems

Quadratic and Copositive Lyapunov Functions and the Stability of Positive Switched Linear Systems Proceedings of the 2007 American Control Conference Marriott Marquis Hotel at Times Square New York City, USA, July 11-13, 2007 WeA20.1 Quadratic and Copositive Lyapunov Functions and the Stability of

More information

Reachability of a class of discrete-time positive switched systems

Reachability of a class of discrete-time positive switched systems Reachability of a class of discrete-time positive switched systems Ettore Fornasini and Maria Elena Valcher Abstract In this paper, monomial reachability and reachability of a special class of discrete-time

More information

A TOUR OF LINEAR ALGEBRA FOR JDEP 384H

A TOUR OF LINEAR ALGEBRA FOR JDEP 384H A TOUR OF LINEAR ALGEBRA FOR JDEP 384H Contents Solving Systems 1 Matrix Arithmetic 3 The Basic Rules of Matrix Arithmetic 4 Norms and Dot Products 5 Norms 5 Dot Products 6 Linear Programming 7 Eigenvectors

More information

1 Matrices and Systems of Linear Equations

1 Matrices and Systems of Linear Equations Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 207, v 260) Contents Matrices and Systems of Linear Equations Systems of Linear Equations Elimination, Matrix Formulation

More information

Observations on the Stability Properties of Cooperative Systems

Observations on the Stability Properties of Cooperative Systems 1 Observations on the Stability Properties of Cooperative Systems Oliver Mason and Mark Verwoerd Abstract We extend two fundamental properties of positive linear time-invariant (LTI) systems to homogeneous

More information

Design of abstract domains using first-order logic

Design of abstract domains using first-order logic Centrum voor Wiskunde en Informatica REPORTRAPPORT Design of abstract domains using first-order logic E. Marchiori Computer Science/Department of Interactive Systems CS-R9633 1996 Report CS-R9633 ISSN

More information

Computing Linearly Conjugate Weakly Reversible Kinetic Structures Using Optimization and Graph Theory

Computing Linearly Conjugate Weakly Reversible Kinetic Structures Using Optimization and Graph Theory MATH ommunications in Mathematical and in omputer hemistry MATH ommun. Math. omput. hem. 74 (2015) 481-504 ISSN 0340-6253 omputing Linearly onjugate Weakly Reversible Kinetic Structures Using Optimization

More information

H 2 Suboptimal Estimation and Control for Nonnegative

H 2 Suboptimal Estimation and Control for Nonnegative Proceedings of the 2007 American Control Conference Marriott Marquis Hotel at Times Square New York City, USA, July 11-13, 2007 FrC20.3 H 2 Suboptimal Estimation and Control for Nonnegative Dynamical Systems

More information

EXTERNALLY AND INTERNALLY POSITIVE TIME-VARYING LINEAR SYSTEMS

EXTERNALLY AND INTERNALLY POSITIVE TIME-VARYING LINEAR SYSTEMS Int. J. Appl. Math. Comput. Sci., 1, Vol.11, No.4, 957 964 EXTERNALLY AND INTERNALLY POSITIVE TIME-VARYING LINEAR SYSTEMS Tadeusz KACZOREK The notions of externally and internally positive time-varying

More information

Linear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey

Linear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey Copyright 2005, W.R. Winfrey Topics Preliminaries Systems of Linear Equations Matrices Algebraic Properties of Matrix Operations Special Types of Matrices and Partitioned Matrices Matrix Transformations

More information

Special Classes of Fuzzy Integer Programming Models with All-Dierent Constraints

Special Classes of Fuzzy Integer Programming Models with All-Dierent Constraints Transaction E: Industrial Engineering Vol. 16, No. 1, pp. 1{10 c Sharif University of Technology, June 2009 Special Classes of Fuzzy Integer Programming Models with All-Dierent Constraints Abstract. K.

More information

QUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE. Denitizable operators in Krein spaces have spectral properties similar to those

QUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE. Denitizable operators in Krein spaces have spectral properties similar to those QUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE BRANKO CURGUS and BRANKO NAJMAN Denitizable operators in Krein spaces have spectral properties similar to those of selfadjoint operators in Hilbert spaces.

More information

Homogeneous Linear Systems and Their General Solutions

Homogeneous Linear Systems and Their General Solutions 37 Homogeneous Linear Systems and Their General Solutions We are now going to restrict our attention further to the standard first-order systems of differential equations that are linear, with particular

More information

Supervisory Control of Petri Nets with. Uncontrollable/Unobservable Transitions. John O. Moody and Panos J. Antsaklis

Supervisory Control of Petri Nets with. Uncontrollable/Unobservable Transitions. John O. Moody and Panos J. Antsaklis Supervisory Control of Petri Nets with Uncontrollable/Unobservable Transitions John O. Moody and Panos J. Antsaklis Department of Electrical Engineering University of Notre Dame, Notre Dame, IN 46556 USA

More information

Ole Christensen 3. October 20, Abstract. We point out some connections between the existing theories for

Ole Christensen 3. October 20, Abstract. We point out some connections between the existing theories for Frames and pseudo-inverses. Ole Christensen 3 October 20, 1994 Abstract We point out some connections between the existing theories for frames and pseudo-inverses. In particular, using the pseudo-inverse

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

A Control Methodology for Constrained Linear Systems Based on Positive Invariance of Polyhedra

A Control Methodology for Constrained Linear Systems Based on Positive Invariance of Polyhedra A Control Methodology for Constrained Linear Systems Based on Positive Invariance of Polyhedra Jean-Claude HENNET LAAS-CNRS Toulouse, France Co-workers: Marina VASSILAKI University of Patras, GREECE Jean-Paul

More information

growth rates of perturbed time-varying linear systems, [14]. For this setup it is also necessary to study discrete-time systems with a transition map

growth rates of perturbed time-varying linear systems, [14]. For this setup it is also necessary to study discrete-time systems with a transition map Remarks on universal nonsingular controls for discrete-time systems Eduardo D. Sontag a and Fabian R. Wirth b;1 a Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, b sontag@hilbert.rutgers.edu

More 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

arxiv: v1 [math.ra] 11 Aug 2014

arxiv: v1 [math.ra] 11 Aug 2014 Double B-tensors and quasi-double B-tensors Chaoqian Li, Yaotang Li arxiv:1408.2299v1 [math.ra] 11 Aug 2014 a School of Mathematics and Statistics, Yunnan University, Kunming, Yunnan, P. R. China 650091

More information

Some New Results on Lyapunov-Type Diagonal Stability

Some New Results on Lyapunov-Type Diagonal Stability Some New Results on Lyapunov-Type Diagonal Stability Mehmet Gumus (Joint work with Dr. Jianhong Xu) Department of Mathematics Southern Illinois University Carbondale 12/01/2016 mgumus@siu.edu (SIUC) Lyapunov-Type

More information

Network Reconstruction from Intrinsic Noise: Non-Minimum-Phase Systems

Network Reconstruction from Intrinsic Noise: Non-Minimum-Phase Systems Preprints of the 19th World Congress he International Federation of Automatic Control Network Reconstruction from Intrinsic Noise: Non-Minimum-Phase Systems David Hayden, Ye Yuan Jorge Goncalves Department

More information

Notes on Iterated Expectations Stephen Morris February 2002

Notes on Iterated Expectations Stephen Morris February 2002 Notes on Iterated Expectations Stephen Morris February 2002 1. Introduction Consider the following sequence of numbers. Individual 1's expectation of random variable X; individual 2's expectation of individual

More information

Row and Column Representatives in Qualitative Analysis of Arbitrary Switching Positive Systems

Row and Column Representatives in Qualitative Analysis of Arbitrary Switching Positive Systems ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY Volume 19, Numbers 1-2, 2016, 127 136 Row and Column Representatives in Qualitative Analysis of Arbitrary Switching Positive Systems Octavian PASTRAVANU,

More information

The following can also be obtained from this WWW address: the papers [8, 9], more examples, comments on the implementation and a short description of

The following can also be obtained from this WWW address: the papers [8, 9], more examples, comments on the implementation and a short description of An algorithm for computing the Weierstrass normal form Mark van Hoeij Department of mathematics University of Nijmegen 6525 ED Nijmegen The Netherlands e-mail: hoeij@sci.kun.nl April 9, 1995 Abstract This

More information

DESCRIPTOR FRACTIONAL LINEAR SYSTEMS WITH REGULAR PENCILS

DESCRIPTOR FRACTIONAL LINEAR SYSTEMS WITH REGULAR PENCILS Int. J. Appl. Math. Comput. Sci., 3, Vol. 3, No., 39 35 DOI:.478/amcs-3-3 DESCRIPTOR FRACTIONAL LINEAR SYSTEMS WITH REGULAR PENCILS TADEUSZ KACZOREK Faculty of Electrical Engineering Białystok Technical

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

ECON2285: Mathematical Economics

ECON2285: Mathematical Economics ECON2285: Mathematical Economics Yulei Luo FBE, HKU September 2, 2018 Luo, Y. (FBE, HKU) ME September 2, 2018 1 / 35 Course Outline Economics: The study of the choices people (consumers, firm managers,

More information

Matrix Multiplication

Matrix Multiplication 228 hapter Three Maps etween Spaces IV2 Matrix Multiplication After representing addition and scalar multiplication of linear maps in the prior subsection, the natural next operation to consider is function

More information

Linear Algebra: Matrix Eigenvalue Problems

Linear Algebra: Matrix Eigenvalue Problems CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given

More information

Review of Basic Concepts in Linear Algebra

Review of Basic Concepts in Linear Algebra Review of Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University September 7, 2017 Math 565 Linear Algebra Review September 7, 2017 1 / 40 Numerical Linear Algebra

More information

On the convergence of normal forms for analytic control systems

On the convergence of normal forms for analytic control systems Chapter 1 On the convergence of normal forms for analytic control systems Wei Kang Department of Mathematics, Naval Postgraduate School Monterey, CA 93943 wkang@nps.navy.mil Arthur J. Krener Department

More information

ECON 186 Class Notes: Linear Algebra

ECON 186 Class Notes: Linear Algebra ECON 86 Class Notes: Linear Algebra Jijian Fan Jijian Fan ECON 86 / 27 Singularity and Rank As discussed previously, squareness is a necessary condition for a matrix to be nonsingular (have an inverse).

More information

arxiv: v1 [cs.sy] 2 Apr 2019

arxiv: v1 [cs.sy] 2 Apr 2019 On the Existence of a Fixed Spectrum for a Multi-channel Linear System: A Matroid Theory Approach F Liu 1 and A S Morse 1 arxiv:190401499v1 [cssy] 2 Apr 2019 Abstract Conditions for the existence of a

More information

Matrix Algebra: Summary

Matrix Algebra: Summary May, 27 Appendix E Matrix Algebra: Summary ontents E. Vectors and Matrtices.......................... 2 E.. Notation.................................. 2 E..2 Special Types of Vectors.........................

More information

13. Systems of Linear Equations 1

13. Systems of Linear Equations 1 13. Systems of Linear Equations 1 Systems of linear equations One of the primary goals of a first course in linear algebra is to impress upon the student how powerful matrix methods are in solving systems

More information

ON IDENTIFIABILITY OF NONLINEAR ODE MODELS AND APPLICATIONS IN VIRAL DYNAMICS

ON IDENTIFIABILITY OF NONLINEAR ODE MODELS AND APPLICATIONS IN VIRAL DYNAMICS ON IDENTIFIABILITY OF NONLINEAR ODE MODELS AND APPLICATIONS IN VIRAL DYNAMICS HONGYU MIAO, XIAOHUA XIA, ALAN S. PERELSON, AND HULIN WU Abstract. Ordinary differential equations (ODE) are a powerful tool

More information

Realization theory for systems biology

Realization theory for systems biology Realization theory for systems biology Mihály Petreczky CNRS Ecole Central Lille, France February 3, 2016 Outline Control theory and its role in biology. Realization problem: an abstract formulation. Realization

More information