Metraipolis › archive › dc_cff12ca29f1f
Euler discretizations, invariant faces and brackets for lower exponents of positive switched systems — arXiv:2611.00901
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00901
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:31:38.536Z
- SHA-256 of the archived text
1b9d5712ac46717be77788a8204d488f4e9e1f86821e89aa36e1b6cc79366d07- Stable URL of this page
https://metraipolis.com/documento/dc_cff12ca29f1f
How to cite
Euler discretizations, invariant faces and brackets for lower exponents of positive switched systems — arXiv:2611.00901 — arXiv (en), https://arxiv.org/abs/2611.00901 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cff12ca29f1f (Metraipolis archive dc_cff12ca29f1f, sha256 1b9d5712ac46717be77788a8204d488f4e9e1f86821e89aa36e1b6cc79366d07)
BibTeX
@misc{dccff12ca29f1f,
title = {Euler discretizations, invariant faces and brackets for lower exponents of positive switched systems — arXiv:2611.00901},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00901},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cff12ca29f1f; sha256 1b9d5712ac46717be77788a8204d488f4e9e1f86821e89aa36e1b6cc79366d07},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00901. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we prove that explicit and implicit Euler discretizations yield monotone brackets for the lower Lyapunov exponent of positive switched systems. We establish convergence of the implicit bound for every Metzler family. For the explicit bound, we derive convergence criteria in reducible systems from a face formula for the uniform lower exponent on an invariant cone. The formula takes the minimum of the rates on faces that meet the cone nontrivially and are preserved by at least one mode, using only their preserving modes. For individually irreducible modes, we prove O(h) discretization errors, where h is the step size, and show that this order is sharp in general. At interior two-mode chattering optima with an irreducible optimal mixture, we obtain one-sided first-order bounds. We also construct a three-mode example in which the explicit bound converges while finite polytope lower bounds remain capped strictly below the true exponent. We prove convergence of fixed-antinorm Gripenberg brackets under individual irreducibility as the step and tolerance decrease and the search depth increases appropriately. Finally, we obtain independently verified continuous-time brackets by exact rational checks, with lower bounds that remain valid at smaller steps. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2611.00901 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T11:04:22.217Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).