The finiteness conjecture for the generalized spectral radius of a set of matrices

@article{Lagarias1995TheFC,
title={The finiteness conjecture for the generalized spectral radius of a set of matrices},
author={Jeffrey C. Lagarias and Yang Wang},
journal={Linear Algebra and its Applications},
year={1995},
volume={214},
pages={17-42}
}
• Published 1995
• Mathematics
• Linear Algebra and its Applications
The generalized spectral radius\g9(∑) of a set ∑ of n × n matrices is \g9(∑) = lim supk→∞\g9k(∑)1k, where \g9k(∑) = sup{ϱ(A1A2…Ak): each Ai ∈ ∑}. The joint spectral radius\g9(∑) is \g9(∑) = lim supk→∞\g9k(∑)1k, where \g9k(∑) = sup{∥A1 … Ak∥:each Ai ∈ ∑}. It is known that \g9(∑) = \g9(∑) holds for any finite set ∑ of n × n matrices. The finiteness conjecture asserts that for any finite set ∑ of real n × n matrices there exists a finite k such that \g9(∑) = \g9(∑) = \g9k(∑)1k. The normed…
203 Citations
The generalized spectral-radius theorem: An analytic-geometric proof
Abstract Let ∑ be a bounded set of complex matrices, ∑ m = {A 1 ... A m : A i ∈ ∑} . The generalized spectral-radius theorem states that ϱ(∑) =ρ^(∑) , where ϱ(∑) and ρ^(σ) are defined as follows:
Asymptotic Stability and Generalized Gelfand Spectral Radius Formula
• Mathematics
• 1997
Let ∑ be a set of n × n complex matrices. For m = 1, 2, …, let ∑m be the set of all products of matrices in ∑ of length m. Denote by ∑′ the multiplicative semigroup generated by ∑. ∑ is said to be
An efficient lower bound for the generalized spectral radius
The generalized spectral radius (GSR) is a fundamental concept in studying the regularity of compactly supported wavelets. Here we describe an efficient method for estimating a lower bound for the
Joint spectral radius, Sturmian measures and the finiteness conjecture
• Mathematics
Ergodic Theory and Dynamical Systems
• 2017
The joint spectral radius of a pair of $2\times 2$ real matrices $(A_{0},A_{1})\in M_{2}(\mathbb{R})^{2}$ is defined to be $r(A_{0},A_{1})=\limsup _{n\rightarrow \infty }\max \{\Vert A_{i_{1}}\cdots Simultaneous Schur stability Let Σ be a set of n × n complex matrices. Denote by ℒ(∑) the multiplicative semi-group generated by Σ. For an n × n complex matrix A, the spectrum of A and spectral radius of A are denoted by σ(A) Computationally Efficient Approximations of the Joint Spectral Radius • Mathematics, Computer Science SIAM J. Matrix Anal. Appl. • 2005 A procedure for approximating the joint spectral radius of a finite set of matrices with arbitrary high accuracy based on semidefinite liftings and it is proved that a widely used approximation based on common quadratic Lyapunov functions (or on ellipsoid norms) has relative accuracy$1/\sqrt m$, where$m$is the number ofMatrices and$n$is their size. Rank one matrices do not contribute to the failure of the finiteness property The joint spectral radius of a bounded set of d times d real or complex matrices is defined to be the maximum exponential rate of growth of products of matrices drawn from that set. A set of matrices Generic properties of the lower spectral radius for some low-rank pairs of matrices The lower spectral radius of a set of$d \times d$matrices is defined to be the minimum possible exponential growth rate of long products of matrices drawn from that set. When considered as a Mathematical Proceedings of the Cambridge Philosophical Society The joint spectral radius of a bounded set of d × d real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of Ergodic properties of matrix equilibrium states • Ian D. Morris • Mathematics Ergodic Theory and Dynamical Systems • 2017 Given a finite irreducible set of real$d\times d$matrices$A_{1},\ldots ,A_{M}$and a real parameter$s>0$, there exists a unique shift-invariant equilibrium state on$\{1,\ldots