Approximations of the Rate of Growth of Switched Linear Systems

The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This quantity appears in a number of application contexts, in particular it characterizes the growth rate of switched linear systems. The joint spectral radius is notoriously difficult to compute and to approximate. We introduce in this paper the first polynomial time approximations of guaranteed precision. We provide an approximation (p) over cap that is based on ellipsoid norms that can be computed by convex optimization and that is such that the joint spectral radius belongs to the interval [(p) over cap/ rootn (p) over cap] where n is the dimension of the matrices. We also provide a simple approximation for the special case where the entries of all the matrices are non-negative; in this case the approximation is proved to be within a factor at most m (m is the number of matrices) of the exact value.

[1]  G. Rota,et al.  A note on the joint spectral radius , 1960 .

[2]  H. Samelson.  Notes on Lie algebras , 1969 .

[3]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[4]  J. Tsitsiklis.  The Stability of the Products of a Finite Set of Matrices , 1987 .

[5]  Thomas M. Cover,et al.  Open Problems in Communication and Computation , 2011, Springer New York.

[6]  I. Daubechies,et al.  Sets of Matrices All Infinite Products of Which Converge , 1992 .

[7]  Yang Wang,et al.  Bounded semigroups of matrices , 1992 .

[8]  J. Lagarias,et al.  The finiteness conjecture for the generalized spectral radius of a set of matrices , 1995 .

[9]  L. Gurvits.  Stability of discrete linear inclusion , 1995 .

[10]  M. Maesumi.  An efficient lower bound for the generalized spectral radius , 1996 .

[11]  G. Gripenberg.  COMPUTING THE JOINT SPECTRAL RADIUS , 1996 .

[12]  John N. Tsitsiklis,et al.  The Lyapunov exponent and joint spectral radius of pairs of matrices are hard—when not impossible—to compute and to approximate , 1997, Math. Control. Signals Syst..

[13]  R. Howard.  The John Ellipsoid Theorem , 1997 .

[14]  E. Yaz.  Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[15]  A. Morse,et al.  Stability of switched systems: a Lie-algebraic condition ( , 1999 .

[16]  Clyde F. Martin,et al.  A Converse Lyapunov Theorem for a Class of Dynamical Systems which Undergo Switching , 1999, IEEE Transactions on Automatic Control.

[17]  J. Tsitsiklis,et al.  The boundedness of all products of a pair of matrices is undecidable , 2000 .

[18]  F. Wirth.  The generalized spectral radius and extremal norms , 2002 .

[19]  Pierre-Alexandre Bliman,et al.  Stability Analysis of Discrete-Time Switched Systems Through Lyapunov Functions with Nonminimal State , 2003, ADHS.