An experimental study of approximation algorithms for the joint spectral radius
From MaRDI portal
dynamical systemsnumerical examplesalgorithmdiscrete-time systemsmatrix normjoint spectral radiusdefault methodgeneralized spectral radiusmatrix semigroupproduct of matrices
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Linear systems in control theory (93C05) Algebraic systems of matrices (15A30)
Recommendations
- Computationally Efficient Approximations of the Joint Spectral Radius
- JSR: a toolbox to compute the joint spectral radius
- Computing the joint spectral radius
- On the accuracy of the ellipsoid norm approximation of the joint spectral radius
- On the computational aspects of the theory of joint spectral radius
Cites work
- scientific article; zbMATH DE number 3155071 (Why is no real title available?)
- scientific article; zbMATH DE number 1284025 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 1166285 (Why is no real title available?)
- A relaxation scheme for computation of the joint spectral radius of matrix sets
- An Elementary Counterexample to the Finiteness Conjecture
- An efficient lower bound for the generalized spectral radius of a set of matrices
- An explicit counterexample to the Lagarias-Wang finiteness conjecture
- Approximation of the joint spectral radius using sum of squares
- Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture
- Balanced complex polytopes and related vector and matrix norms
- Bounded semigroups of matrices
- Computationally Efficient Approximations of the Joint Spectral Radius
- Computing the joint spectral radius
- Finding extremal complex polytope norms for families of real matrices
- Finiteness property of pairs of \(2\times 2\) sign-matrices via real extremal polytope norms
- Iterative building of Barabanov norms and computation of the joint spectral radius for matrix sets
- Joint spectral characteristics of matrices: a conic programming approach
- On accuracy of approximation of the spectral radius by the Gelfand formula
- On codes that avoid specified differences
- On the accuracy of the ellipsoid norm approximation of the joint spectral radius
- Overlap-free words and spectra of matrices
- Stability Criteria for Switched and Hybrid Systems
- Stability of discrete linear inclusion
- Structure of extremal trajectories of discrete linear systems and the finiteness conjecture
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
- The finiteness conjecture for the generalized spectral radius of a set of matrices
- The generalized spectral radius and extremal norms
- Two-Scale Difference Equations II. Local Regularity, Infinite Products of Matrices and Fractals
Cited in
(10)- JSR: a toolbox to compute the joint spectral radius
- Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard
- Hybrid Systems: Computation and Control
- On the joint spectral radius of matrices of order 2 with equal spectral radius
- Exact computation of joint spectral characteristics of linear operators
- Algorithm 1011: Improved invariant polytope algorithm and applications
- Consensus in asynchronous multiagent systems. III: Constructive stability and stabilizability
- Lifted polytope methods for computing the joint spectral radius
- Extremal matrix products and the finiteness property
- Computationally Efficient Approximations of the Joint Spectral Radius
This page was built for publication: An experimental study of approximation algorithms for the joint spectral radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q369454)
