Abstract
High order zonotopes, that is, bodies which are the finite sum of parallelepipeds, can be used to compute enclosures for the orbits of discrete dynamical systems. A Flush-When-Full (FWF) strategy on the summands effectively avoids the wrapping effect by wrapping small summands much more often than large ones. In a competitive analysis, different online FWF strategies are evaluated according to their performance relative to an optimal offline algorithm. Numerical experiments indicate that there is an optimal online FWF strategy which significantly outperforms previously employed strategies.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, N. E. Young, Competitive Paging Algorithms, J. Algorithms, 12, pp. 685–699, 1991.
J. Hale and H. Koçak, Dynamics and Bifurcations, Springer-Verlag, 1991.
W. Kühn, Rigorously Computed Orbits of Dynamical Systems without the Wrapping Effect, Computing, 61, pp. 47–67, 1998.
C. C. McGeoch, How to Stay Competitive, Amer. Math. Monthly, 101, pp. 897–901, 1994.
G. M. Ziegler, Lectures on Polytopes, Springer-Verlag, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kühn, W. (1999). Towards an optimal control of the wrapping effect. In: Csendes, T. (eds) Developments in Reliable Computing. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1247-7_4
Download citation
DOI: https://doi.org/10.1007/978-94-017-1247-7_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5350-3
Online ISBN: 978-94-017-1247-7
eBook Packages: Springer Book Archive