Bounding the errors for convex dynamics on one or more polytopes
From MaRDI portal
Publication:3636596
DOI10.1063/1.2747053zbMATH Open1163.37378OpenAlexW2083917807WikidataQ51905030 ScholiaQ51905030MaRDI QIDQ3636596FDOQ3636596
Authors: Charles Tresser
Publication date: 1 July 2009
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.2747053
Cites Work
- Interval exchange transformations
- State Constraints in Convex Control Problems of Bolza
- The Chairman assignment problem
- Convex dynamics and applications
- Symbolic Dynamics II. Sturmian Trajectories
- Approximating a bandlimited function using very coarsely quantized data: a family of stable sigma-delta modulators of arbitrary order
- Fairness in Scheduling
- A decoding problem in dynamics and in number theory
- The optimality of the online greedy algorithm in carpool and chairman assignment problems
- On a distribution problem in finite and countable sets
- Dynamic of error diffusion on several polytopes
- Convex dynamics: properties of invariant sets
- Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
Cited In (4)
This page was built for publication: Bounding the errors for convex dynamics on one or more polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636596)