Sciweavers

Share
CORR
2010
Springer

Computational Complexity of Iterated Maps on the Interval

9 years 17 hour ago
Computational Complexity of Iterated Maps on the Interval
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.
Christoph Spandl
Added 24 Jan 2011
Updated 24 Jan 2011
Type Journal
Year 2010
Where CORR
Authors Christoph Spandl
Comments (0)
books