Non-Sturmian sequences of matrices providing the maximum growth rate of matrix products
DOI10.1016/j.automatica.2022.110574zbMath1498.93299arXiv2112.00391OpenAlexW3215067509WikidataQ114204704 ScholiaQ114204704MaRDI QIDQ2081841
Publication date: 30 September 2022
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.00391
growth rateSturmian sequencesBarabanov normlinear switching systemsinfinite matrix productsPython program
Linear systems in control theory (93C05) Algebraic methods (93B25) Basic linear algebra (15A99) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Substitutions in dynamics, arithmetics and combinatorics
- Structure of extremal trajectories of discrete linear systems and the finiteness conjecture
- Iterative building of Barabanov norms and computation of the joint spectral radius for matrix sets
- Lyapunov indicator of discrete inclusions. I
- The Lyapunov indicator of discrete inclusions. II
- The Lyapunov indicator of discrete inclusions. III
- Algebraic unsolvability of problem of absolute stability of desynchronized systems
- Sets of matrices all infinite products of which converge
- Bounded semigroups of matrices
- The finiteness conjecture for the generalized spectral radius of a set of matrices
- The generalized spectral radius and extremal norms
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
- Undecidable problems for probabilistic automata of fixed dimension
- Coding rotations on intervals
- Indefinability in o-minimal structures of finite sets of matrices whose infinite products converge and are bounded or unbounded
- Efficient algorithms for deciding the type of growth of products of integer matrices
- Chaotic relaxation
- Double rotations
- Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture
- Stability of dynamical systems: A constructive approach
- A relaxation scheme for computation of the joint spectral radius of matrix sets
- On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns
- An Elementary Counterexample to the Finiteness Conjecture
- On codes that avoid specified differences
- Kneading theory and rotation intervals for a class of circle maps of degree one
- Rotation intervals for a class of maps of the real line into itself
- Invariant measures for interval translations and some other piecewise continuous maps
- A note on double rotations of infinite type
- Optimal Switching Sequence for Switched Linear Systems
- Stability Criteria for Switched and Hybrid Systems
- A survey of computational complexity results in systems and control
- Corrigendum/addendum to: Sets of matrices all infinite products of which converge
This page was built for publication: Non-Sturmian sequences of matrices providing the maximum growth rate of matrix products
