Bounding the escape time of a linear dynamical system over a compact semialgebraic set
We study the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets. We establish a uniform upper bound on the number of iterations it takes for every orbit of a rational matrix to escape a compact semialgebraic set defined over rational data. Our bound is doubly e...
| Päätekijät: | , , , , |
|---|---|
| Aineistotyyppi: | Conference item |
| Kieli: | English |
| Julkaistu: |
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2022
|
| Aiheet: |