Bounding the errors for convex dynamics on one or more polytopes
From MaRDI portal
Publication:3636596
DOI10.1063/1.2747053zbMath1163.37378OpenAlexW2083917807WikidataQ51905030 ScholiaQ51905030MaRDI QIDQ3636596
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
Related Items (3)
Error diffusion on acute simplices: invariant tiles ⋮ Convex dynamics with constant input ⋮ On Sloane’s Persistence Problem
Cites Work
- The Chairman assignment problem
- Approximating a bandlimited function using very coarsely quantized data: a family of stable sigma-delta modulators of arbitrary order
- Dynamic of error diffusion on several polytopes
- On a distribution problem in finite and countable sets
- The optimality of the online greedy algorithm in carpool and chairman assignment problems
- Fairness in Scheduling
- A decoding problem in dynamics and in number theory
- Convex dynamics: properties of invariant sets
- State Constraints in Convex Control Problems of Bolza
- Convex dynamics and applications
- Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
- Symbolic Dynamics II. Sturmian Trajectories
- Interval exchange transformations
This page was built for publication: Bounding the errors for convex dynamics on one or more polytopes
