Bounding the errors for convex dynamics on one or more polytopes.

@article{Tresser2007BoundingTE,
  title={Bounding the errors for convex dynamics on one or more polytopes.},
  author={C. Tresser},
  journal={Chaos},
  year={2007},
  volume={17 3},
  pages={033110}
}
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 the successive cumulative errors. This algorithm can be interpreted as a time-dependent dynamical system in the vector space, where the errors live, or as a time-dependent dynamical system in an… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…