Two-scale difference equations II. local regularity, infinite products of matrices and fractals
SIAM Journal on Mathematical Analysis
Generalized refinement equations and subdivision processes
Journal of Approximation Theory
SIAM Journal on Matrix Analysis and Applications
The density of ones in Pascal's rhombus
Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
Counting Overlap-Free Binary Words
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Convex Optimization
Computationally Efficient Approximations of the Joint Spectral Radius
SIAM Journal on Matrix Analysis and Applications
Structure of extremal trajectories of discrete linear systems and the finiteness conjecture
Automation and Remote Control
On the number of α-power-free binary words for 2
Theoretical Computer Science
Overlap-free words and spectra of matrices
Theoretical Computer Science
Finding Extremal Complex Polytope Norms for Families of Real Matrices
SIAM Journal on Matrix Analysis and Applications
Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices
SIAM Journal on Matrix Analysis and Applications
On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns
IEEE Transactions on Information Theory
Analysis of the joint spectral radius via lyapunov functions on path-complete graphs
Proceedings of the 14th international conference on Hybrid systems: computation and control
Fast Methods for Computing the $p$-Radius of Matrices
SIAM Journal on Scientific Computing
Computation of joint spectral radius for network model associated with rank-one matrix set
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
An experimental study of approximation algorithms for the joint spectral radius
Numerical Algorithms
| Hi-index | 0.00 |
We propose a new method to compute the joint spectral radius and the joint spectral subradius of a set of matrices. We first restrict our attention to matrices that leave a cone invariant. The accuracy of our algorithm, depending on geometric properties of the invariant cone, is estimated. We then extend our method to arbitrary sets of matrices by a lifting procedure, and we demonstrate the efficiency of the new algorithm by applying it to several problems in combinatorics, number theory, and discrete mathematics.