文章基本信息

标题：Computational Complexity of Iterated Maps on the Interval (Extended Abstract)
本地全文：下载
作者：Christoph Spandl
期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2010
卷号：24
页码：139-150
DOI：10.4204/EPTCS.24.18
出版社：Open Publishing Association
摘要：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.