An experimental study of approximation algorithms for the joint spectral radius
DOI10.1007/s11075-012-9661-zzbMath1276.65021OpenAlexW2117566669MaRDI QIDQ369454
Chia-Tche Chang, Blondel, Vincent D.
Publication date: 24 September 2013
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-012-9661-z
algorithmdiscrete-time systemsdynamical systemsnumerical examplesgeneralized spectral radiusjoint spectral radiusmatrix normdefault methodmatrix semigroupproduct of matrices
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Linear systems in control theory (93C05) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical computation of matrix norms, conditioning, scaling (65F35) Algebraic systems of matrices (15A30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An explicit counterexample to the Lagarias-Wang finiteness conjecture
- On accuracy of approximation of the spectral radius by the Gelfand formula
- Overlap-free words and spectra of matrices
- 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
- Finiteness property of pairs of \(2\times 2\) sign-matrices via real extremal polytope norms
- 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
- On the accuracy of the ellipsoid norm approximation of the joint spectral radius
- Stability of discrete linear inclusion
- Computing the joint spectral radius
- An efficient lower bound for the generalized spectral radius of a set of matrices
- Approximation of the joint spectral radius using sum of squares
- Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture
- Joint Spectral Characteristics of Matrices: A Conic Programming Approach
- A relaxation scheme for computation of the joint spectral radius of matrix sets
- Finding Extremal Complex Polytope Norms for Families of Real Matrices
- Two-Scale Difference Equations II. Local Regularity, Infinite Products of Matrices and Fractals
- An Elementary Counterexample to the Finiteness Conjecture
- On codes that avoid specified differences
- Computationally Efficient Approximations of the Joint Spectral Radius
- Stability Criteria for Switched and Hybrid Systems
This page was built for publication: An experimental study of approximation algorithms for the joint spectral radius
