Metadata only
Date
2019Type
- Working Paper
ETH Bibliography
yes
Altmetrics
Abstract
Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. Here we derive an analytical upper and lower bound for the maximal and minimal Lyapunov exponent, respectively. The bounds are tight in the commutative case and other scenarios. They can be expressed in terms of an optimization problem that only involves single matrices rather than large products. The upper bound for the maximal Lyapunov exponent can be evaluated efficiently via the theory of convex optimization. Show more
Publication status
publishedExternal links
Journal / series
arXivPages / Article No.
Publisher
Cornell UniversitySubject
Computer Science - Information Theory; Quantum Physics; Mathematical Physics; Mathematics - Dynamical SystemsOrganisational unit
03781 - Renner, Renato / Renner, Renato
Related publications and datasets
Is previous version of: http://hdl.handle.net/20.500.11850/460399
More
Show all metadata
ETH Bibliography
yes
Altmetrics