Computational Complexity of Iterated Maps on the Interval

Details Computational Complexity of Iterated Maps on the Interval Computational Complexity of Iterated Maps on the Interval

2010-03-31

arxiv.org/abs/1003.6036v3

Computer Science

Numerical Analysis

Scientific paper

The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The correctness of the algorithm is shown and the computational complexity is analyzed. There are two main results. First, the computational complexity measure considered here is related to the Lyapunov exponent of the dynamical system under consideration. Second, the presented algorithm is optimal with regard to that complexity measure.

Affiliated with

Also associated with

No associations

Rating

Computational Complexity of Iterated Maps on the Interval 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, 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 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-580008