Bounding the errors for convex dynamics on one or more polytopes
We discuss the greedy algorithm for approximating a sequence of inputs in a family of polytopes lying in affine spaces by an output sequence made of vertices of the respective polytopes. More precisely, we consider here the case when the greed of the algorithm is dictated by the Euclidean norms of t...
Gespeichert in:
| Veröffentlicht in: | Chaos (Woodbury, N.Y.) N.Y.), 2007-09, Vol.17 (3), p.033110-033110-12 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!