Computational Complexity of Iterated Maps on the Interval (Extended Abstract)

Christoph Spandl

The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is chosen and a general algorithm is presented. The correctness of the algorithm is shown and the computational complexity is analyzed. As a main result, the computational complexity measure considered here is related to the Ljapunow exponent of the dynamical system under consideration.

In Xizhong Zheng and Ning Zhong: Proceedings Seventh International Conference on Computability and Complexity in Analysis (CCA 2010), Zhenjiang, China, 21-25th June 2010, Electronic Proceedings in Theoretical Computer Science 24, pp. 139–150.
Published: 3rd June 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.24.18 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org