Joint Spectral Characteristics of Matrices: A Conic Programming Approach
SIAM Journal on Matrix Analysis and Applications
Technical communique: A characterization of the generalized spectral radius with Kronecker powers
Automatica (Journal of IFAC)
Analysis of Discrete-Time Linear Switched Systems: A Variational Approach
SIAM Journal on Control and Optimization
An experimental study of approximation algorithms for the joint spectral radius
Numerical Algorithms
Hi-index | 0.01 |
In 1995 J.C. Lagarias and Y. Wang conjectured that the generalized spectral radius of a finite set of square matrices can be attained on a finite product of matrices. The first counterexample to this Finiteness Conjecture was given in 2002 by T. Bousch and J. Mairesse and their proof was based on measure-theoretical ideas. In 2003 V.D. Blondel, J. Theys and A.A. Vladimirov proposed another proof of a counterexample to the Finiteness Conjecture which extensively exploited combinatorial properties of permutations of products of positive matrices.In the control theory, so as in the general theory of dynamical systems, the notion of generalized spectral radius is used basically to describe the rate of growth or decrease of the trajectories generated by matrix products. In this context, the above mentioned methods are not enough satisfactory (from the point of view of the author, of course) since they give no description of the structure of the trajectories with the maximal growing rate (or minimal decreasing rate).In connection with this, in 2005 the author presented one more proof of the counterexample to the Finiteness Conjecture fulfilled in the spirit of the theory of dynamical systems. Unfortunately, the developed approach did not cover the class of matrices considered by Blondel, Theys and Vladimirov. The goal of the present paper is to compensate for this deficiency in the previous approach.