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

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

2010-06-02

arxiv.org/abs/1006.0404v1

EPTCS 24, 2010, pp. 139-150

Computer Science

Mathematical Software

Scientific paper

10.4204/EPTCS.24.18

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.

Affiliated with

Also associated with

No associations

Rating

Computational Complexity of Iterated Maps on the Interval (Extended Abstract) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational Complexity of Iterated Maps on the Interval (Extended Abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Complexity of Iterated Maps on the Interval (Extended Abstract) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512960