Lower and upper bounds for the largest Lyapunov exponent of matrices

From MaRDI portal
Publication:389726

DOI10.1016/J.LAA.2013.01.027zbMATH Open1281.65154arXiv1201.3218OpenAlexW2078126880MaRDI QIDQ389726FDOQ389726


Authors: Raphaël M. Jungers, Vladimir Yu. Protasov Edit this on Wikidata


Publication date: 21 January 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We introduce a new approach to evaluate the largest Lyapunov exponent of a family of nonnegative matrices. The method is based on using special positive homogeneous functionals on R+d, which gives iterative lower and upper bounds for the Lyapunov exponent. They improve previously known bounds and converge to the real value. The rate of convergence is estimated and the efficiency of the algorithm is demonstrated on several problems from applications (in functional analysis, combinatorics, and lan- guage theory) and on numerical examples with randomly generated matrices. The method computes the Lyapunov exponent with a prescribed accuracy in relatively high dimensions (up to 60). We generalize this approach to all matrices, not necessar- ily nonnegative, derive a new universal upper bound for the Lyapunov exponent, and show that such a lower bound, in general, does not exist.


Full work available at URL: https://arxiv.org/abs/1201.3218




Recommendations




Cites Work


Cited In (26)





This page was built for publication: Lower and upper bounds for the largest Lyapunov exponent of matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389726)