Set arithmetic and the enclosing problem in dynamics
Volume 74 / 2000
Annales Polonici Mathematici 74 (2000), 237-259
DOI: 10.4064/ap-74-1-237-259
Abstract
We study the enclosing problem for discrete and continuous dynamical systems in the context of computer assisted proofs. We review and compare the existing methods and emphasize the importance of developing a suitable set arithmetic for efficient algorithms solving the enclosing problem.
