𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reachability of Affine Systems on Polytopes

✍ Scribed by Min WU; Gang-Feng YAN; Zhi-Yun LIN

Book ID
104453154
Publisher
Elsevier
Year
2009
Weight
428 KB
Volume
35
Category
Article
ISSN
1874-1029

No coin nor oath required. For personal study only.

✦ Synopsis

The paper studies reachability problem of autonomous affine systems on n-dimensional polytopes. Our goal is to obtain both the largest positive invariant set in the polytope and the backward reachable set (the attraction domain) of each facet. Special attention is paid to the largest stable invariant affine subspace. After presenting several useful properties of those sets, a partition procedure is given to determine the largest positive invariant set in the polytope and all the attraction domains of facets.

πŸ“œ SIMILAR VOLUMES

Counting Affine Roots of Polynomial Syst
Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes
✍ J.Maurice Rojas; Xiaoshen Wang πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 289 KB

We give a new upper bound on the number of isolated roots of a polynomial system. Unlike many previous bounds, our bound can also be restricted to different open subsets of affine space. Our methods give significantly sharper bounds than the classical Be Β΄zout theorems and further generalize the mix