Computationally efficient approximations of the joint spectral radius
Vincent Blondel, Yurii Nesterov
Abstract
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This quantity appears in a number of application contexts but is notoriously difficult to compute and to approximate. We introduce in this paper a procedure for approximating the joint spectral radius of a finite set of matrices with arbitrary high accuracy. Our approximation procedure is polynomial in the size of the matrices once the number of matrices and the desired accuracy are fixed.
Create a lesson
Related papers
Adjoint-Based Stochastic Analysis for Fatigue of Aeroelastic and Frictional Systems
Justin H. Porter
Asymptotic Analysis of Discrete-Time Self-Attention Dynamics in Transformers
Claudio Altafini
Dimension theory of group actions by circle diffeomorphisms I: Stationary measures
Weikun He, Yuxiang Jiao, Disheng Xu
Hausdorff Dimension and Flexibility for Attractors of Non-Uniformly Hyperbolic Flows
Elias Rego, Paulo Varandas
Finiteness of planar central configurations of five bodies for all positive masses
Tejasvi Singh Tomar
Khintchine dichotomy for images of self-similar measures and almost random walks
Liyang Shao