On the asymptotic dynamics of 2D positive systems

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

Sang Gu Lee and Jeong Mo Yang

Section 1.7: Properties of the Leslie Matrix

1 Last time: least-squares problems

Intrinsic products and factorizations of matrices

Detailed Proof of The PerronFrobenius Theorem

Reachability of a class of discrete-time positive switched systems

On the spectral and combinatorial structure of 2D positive systems

P i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=

MATH 56A: STOCHASTIC PROCESSES CHAPTER 1

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series

ON KRONECKER PRODUCTS OF CHARACTERS OF THE SYMMETRIC GROUPS WITH FEW COMPONENTS

Chapter 1. Vectors, Matrices, and Linear Spaces

Prime and irreducible elements of the ring of integers modulo n

Applications of The Perron-Frobenius Theorem

From Satisfiability to Linear Algebra

Math 4310 Solutions to homework 1 Due 9/1/16

Chapter 2: Linear Independence and Bases

Reaching a Consensus in a Dynamically Changing Environment A Graphical Approach

MARKOV CHAIN MONTE CARLO

NORMS ON SPACE OF MATRICES

Key words. Strongly eventually nonnegative matrix, eventually nonnegative matrix, eventually r-cyclic matrix, Perron-Frobenius.

642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004

Spectral Properties of Matrix Polynomials in the Max Algebra

Classification of semisimple Lie algebras

Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing

32 Divisibility Theory in Integral Domains

A Questionable Distance-Regular Graph

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

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

SPECTRAL PROPERTIES AND NODAL SOLUTIONS FOR SECOND-ORDER, m-point, BOUNDARY VALUE PROBLEMS

Linear Algebra Practice Problems

Projective Schemes with Degenerate General Hyperplane Section II

Math 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby

Kernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman

On cardinality of Pareto spectra

The spectrum of a square matrix A, denoted σ(a), is the multiset of the eigenvalues

SPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS

MODULES OVER A PID. induces an isomorphism

Math 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook.

SYMMETRY RESULTS FOR PERTURBED PROBLEMS AND RELATED QUESTIONS. Massimo Grosi Filomena Pacella S. L. Yadava. 1. Introduction

Markov Chains Handout for Stat 110

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES

Markov Chains and Stochastic Sampling

In particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with

Statistics 992 Continuous-time Markov Chains Spring 2004

THE NUMERICAL EVALUATION OF THE MAXIMUM-LIKELIHOOD ESTIMATE OF A SUBSET OF MIXTURE PROPORTIONS*

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Perron Frobenius Theory

On families of anticommuting matrices

Characterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs. Sung Y. Song Iowa State University

THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS

Lines With Many Points On Both Sides

Nonnegative and spectral matrix theory Lecture notes

MATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by

MATH 2030: MATRICES. Example 0.2. Q:Define A 1 =, A. 3 4 A: We wish to find c 1, c 2, and c 3 such that. c 1 + c c

Lecture notes for Analysis of Algorithms : Markov decision processes

The Perron Frobenius theorem and the Hilbert metric

Lecture 5: Random Walks and Markov Chain

Statistics 150: Spring 2007

Vladimir Kirichenko and Makar Plakhotnyk

Section 3.9. Matrix Norm

1 Definition of the Riemann integral

Strictly nonnegative tensors and nonnegative tensor partition

Theoretical Computer Science. Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms

NONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction

0.1 Rational Canonical Forms

MATH 564/STAT 555 Applied Stochastic Processes Homework 2, September 18, 2015 Due September 30, 2015

A Generalized Eigenmode Algorithm for Reducible Regular Matrices over the Max-Plus Algebra

Connections between spectral properties of asymptotic mappings and solutions to wireless network problems

PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms

A linear algebra proof of the fundamental theorem of algebra

Subsequences of frames

Upper triangular matrices and Billiard Arrays

A linear algebra proof of the fundamental theorem of algebra

The initial involution patterns of permutations

An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace

LAYERED NETWORKS, THE DISCRETE LAPLACIAN, AND A CONTINUED FRACTION IDENTITY

MATHEMATICS 217 NOTES

The Cayley-Hamilton Theorem and the Jordan Decomposition

Infinite-Dimensional Triangularization

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.

The doubly negative matrix completion problem

What is A + B? What is A B? What is AB? What is BA? What is A 2? and B = QUESTION 2. What is the reduced row echelon matrix of A =

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

arxiv: v3 [math.ra] 10 Jun 2016

1 Last time: inverses

arxiv:math/ v1 [math.oa] 9 May 2005

JORDAN AND RATIONAL CANONICAL FORMS

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR

A Tropical Extremal Problem with Nonlinear Objective Function and Linear Inequality Constraints

Unmixed Graphs that are Domains

1 Directional Derivatives and Differentiability

Recall the convention that, for us, all vectors are column vectors.

Least Squares Based Self-Tuning Control Systems: Supplementary Notes

Typical Problem: Compute.

THE EIGENVALUE PROBLEM

Modeling and Stability Analysis of a Communication Network System

Thus, the integral closure A i of A in F i is a finitely generated (and torsion-free) A-module. It is not a priori clear if the A i s are locally

Transcription:

On the asymptotic dynamics of 2D positive systems Ettore Fornasini and Maria Elena Valcher Dipartimento di Elettronica ed Informatica, Univ. di Padova via Gradenigo 6a, 353 Padova, ITALY e-mail: meme@paola.dei.unipd.it Introduction A 2D positive system is a 2D system [] in which the value of the state variables is always nonnegative. The positivity constraint arises quite naturally when modelling real systems, whose state variables represent quantities that are intrinsically nonnegative, such as pressures, concentrations, population levels, etc.. In this contribution we consider homogeneous positive 2D systems, described by the equation: x(h +, k + ) = A x(h, k + ) + B x(h +, k), (.) where the doubly indexed local state sequence x(, ) takes values in the positive cone R n + := {x R n : x i 0, i =, 2,..., n}, A and B are nonnegative n n matrices, and the initial conditions are assigned by specifying the nonnegative values of the local states on the separation set C 0 := {(i, i) : i Z}. Our aim is to explore how some properties of nonnegative matrix pairs (A, B) influence the asymptotic behaviour of the associated homogeneous 2D systems. More precisely, in section 2 we analyse under which conditions on the initial local states and on the pair (A, B) the states x(h, k) eventually become strictly positive, while in section 3 a couple of results on the convergence towards a constant asymptotic distribution is presented. Some proofs are rather long and, for sake of brevity, will be omitted. The interested reader is referred to [2] and [3]. Before proceeding, it is convenient to introduce some notation. If M = [m ij ] is a matrix (in particular, a vector), we write M 0 (M strictly positive), if m ij > 0 for all i, j; M > 0 (M positive), if m ij 0 for all i, j, and m hk > 0 for at least one pair (h, k); M 0 (M nonnegative), if m ij 0 for all i, j. The Hurwitz products of two square matrices A and B are inductively defined as A i 0 B = A i, A 0 j B = B j and, when i and j are both greater than zero, A i j B = A(A i j B) + B(A i j B). One easily sees that A i j B = w(a, B), where the summation is extended to all matrix products that include the factors A and B, i and j times respectively. Assuming zero initial conditions on C 0, except at (0, 0), it is clear that x(h, k), h, k 0, is given by x(h, k) = A h k B x(0, 0). 2 Strictly positive asymptotic dynamics An issue that arises quite naturally when considering the asymptotic behaviour of positive systems is that of guaranteeing that the states eventually become strictly positive vectors.

For D positive systems x(h + ) = A x(h), x(0) > 0, the primitivity [4] of the system matrix A is necessary and sufficient for x(h) beeing strictly positive when h is large enough. For 2D systems described as in (.), we say that the state evolution eventually becomes strictly positive if there exists a positive integer T such that x(h, k) 0 for all (h, k), h + k T. Clearly it s impossible that every nonzero initial global state X 0 = {x(i, i) : i Z} produces a strictly positive asymptotic dynamics. Actually, when X 0 includes only a finite number of nonzero states, the support of the free evolution is included in a quarter plane causal cone of Z Z. As a consequence, we have to take into account not only the properties of the matrix pair (A, B), but also the zero-pattern of X 0, and we will confine our attention to global states which satisfy the following condition: there exists an integer M such that M x(i + h, i h) > 0, i Z. (2.) h= In other words, the maximal distance between two consecutive positive states on the separation set C 0 is upper bounded by M. In the sequel we will provide a set of sufficient conditions on the pair (A, B) guaranteeing a strictly positive asymptotic dynamics for all initial global states satisfying (2.). Proposition 2. Suppose that A > 0 and B > 0 are n n positive matrices and there exists (i, j) such that A i j B is primitive. Then, for each initial global state satisfying (2.), there exists an integer T 0 such that x(h, k) 0 whenever h + k T. Proof If A i j B is primitive, then (A i j B) p 0 for some p > 0, and therefore A pi pj B (A i j B) p 0. So in the sequel we will assume that there exists (h, k) such that A h k B is strictly positive. If we suppose x(0, 0) > 0, we have x(h, k) (A h k B) x(0, 0) 0, and, as A and B are nonzero matrices, both x(h +, k) and x(h, k + ) are nonzero vectors. Consequently, if M denotes the maximal distance between two consecutive nonzero local states on C 0, the maximal distance on the separation set C h+k+ = {(i, j) : i+j = h+k+} is not greater than M. An inductive argument shows that all local states on C (M )(h+k+) are nonzero, and, recalling that A h k B 0, we see that all local states on C M(h+k+) are strictly positive. Consequently, we can choose T = M(h + k + ) Remark The existence of a primitive Hurwitz product A i j B implies that, for a suitable p > 0, (A i j B) p, and hence (A + B) (i+j)p, are strictly positive. Therefore A + B is primitive. The converse in general is not true, as shown by the following example. The pair of irreducible matrices 0 0 0 0 A = 0 0 B = 0 0 (2.2) 0 0 0 0 has a primitive sum. However, as B = A 2, the Hurwitz products are expressed as A h k B = ) A h+2k, and hence are not primitive. ( h+k h Corollary 2.2 If A > 0 and B > 0 are n n matrices and there exists a primitive matrix product w(a, B) = A h B k A hr B kr, then for all initial global states satisfying (2.) the asymptotic behaviour of system (.) is strictly positive. 2

Proof If h +h 2 +...+h r = i and k +k 2 +...+k r = j, then A i too, and we can resort to Proposition 2. j B w(a, B) is primitive In order to apply Corollary 2.2 above, in some cases it is enough to have at disposal a quite poor information on the zero pattern of A and B. For instance, it s sufficient to know that A is primitive and B > 0, or, when dealing with a pair of irreducible matrices, it is enough to check whether their imprimitivity indexes are coprime, as shown by the following proposition. Proposition 2.3 [2] Assume that A and B are irreducible matrices with imprimitivity indexes h A and h B. If g.c.d.(h A, h B ) =, then there exists a primitive matrix product w(a, B) 3 Further aspects of the asymptotic dynamics The problems that will be addressed in this section concern some aspects of the twodimensional dynamics which entail a finer analysis of its asymptotic behaviour. Indeed our interest here does not merely concentrate on nonzero patterns; it involves also the values of the local state and a qualitative description of the vectors distribution along the separation sets C t = {(i, j) : i + j = t} as t goes to infinity. The first problem is that concerning the zeroing of state oscillations on the separation sets C t, t +, when scalar positive systems are considered. Definition : A scalar (nonnecessarily nonnegative) global state X 0 = {x(i, i) : i Z} has (finite) mean value µ if, given any ε > 0, there exists a positive integer N(ε) such that, for all ν N(ε) and h Z ν h+ν i=h x(i, i) µ < ε. (3.) It is not difficult to prove that if X 0 has a (finite) mean value µ, then X 0 is bounded, i.e. there exists a positive integer M such that x(i, i) < M, i Z, and X t = {x(i, j), i+j = t} has mean value (A + B) t µ. Given a scalar global state X 0 with mean value µ 0, the oscillation rate of X 0 is defined as osc(x 0 ) := sup i,j Z x(i, i) x(j, j) (3.2) µ Proposition 3. [2] Consider an homogeneous 2D system (.) with n = (scalar local states) and A, B > 0. Assume moreover that the initial global state X 0 has mean value µ > 0. Then the oscillation rate, osc(x t ), goes to zero as t goes to infinity If we drop the hypothesis that (.) is a scalar system, the qualitative description of the asymptotic dynamics is by far more interesting, and more difficult. The results so far available deal with two rather restrictive classes of positive 2D systems, that is 2D Markov chains and 2D systems with commutative A and B [3]. Further research will lead, it is hoped, to more comprehensive theorems. For sake of brevity, we discuss only some aspects of commutative 2D systems. Lemma 3.2 [2] Let A > 0 and B > 0 be n n commutative matrices, whose sum A + B is irreducible. Then A and B have a strictly positive common eigenvector v Av = r A v, Bv = r B v (3.3) 3

and r A, r B are the spectral radii of A and B, respectively Lemma 3.3 [3] Suppose that in system (.) A, B and the initial global state X 0 satisfy the following assumptions: (i) A and B are positive commuting matrices (ii) A and B have a strictly positive common dominant eigenvector v (iii) There exists l and L, both positive, such that 0 < l[... ] T x(i, i) L[... ] T, i Z. (3.4) Then lim h+k + x(h, k) x(h, k) = v v Proposition 3.4 Suppose that in system (.) a) A and B are primitive commuting matrices b) there exist an integer M > 0 and two positive real numbers r and R such that r [... M ] x(i + h, i h) R, h= i Z Then lim h+k + x(h, k)/ x(h, k) = v/ v where v 0 is a common eigenvector of A and B. Proof As A + B is irreducible, by Lemma 3.2 there exists v 0 that satisfies equations (3.3). The primitivity assumption guarantees that v is a dominant eigenvector of both A and B. Thus conditions (i) and (ii) of Lemma 3.3 are fulfilled. On the other hand, when N is large enough, all matrices A ν N ν B, 0 ν N, are strictly positive. So, denoting by s N and S N their minimum and maximum entries s N := min ν min h,k [A ν N ν B] hk > 0, S N := max ν max h,k [A ν N ν B] hk > 0 respectively, and assuming N M, we have x j (i + N, i) s N and x j (i + N, i) S N N ν=0 N ν=0 [... ]x(i + N ν, i N + ν) s N r j =, 2,..., n [... ]x(i + N ν, i N + ν) S N NR j =, 2,..., n. Therefore, for large values of N, X N fulfills condition (iii) of Lemma 3.3, with l = s N r and L = S N NR, and the proof is complete 4 References. E.Fornasini, G.Marchesini, (978), Doubly indexed dynamical systems: state space models and structural properties, Math. Sys. Theory, vol.2, pp. 59-72 4

2. M.E.Valcher, E.Fornasini, (993) State models and asymptotic behaviour of 2D positive systems, to appear in IMA Journal 3. E.Fornasini, G.Marchesini, (993), Properties of pairs of matrices and state models for 2D systems. Pt.: state dynamics and geometry of the pairs, in Multivariate Analysis: Future Directions, C.R.Rao ed., Elsevier Sci.Publ. 4. H.Minc, (988), Nonnegative matrices, J.Wiley Publ. 5