Computational complexity of iterated maps on the interval
From MaRDI portal
(Redirected from Publication:449664)
Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 434853 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 44378 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746043 (Why is no real title available?)
- scientific article; zbMATH DE number 776267 (Why is no real title available?)
- scientific article; zbMATH DE number 843185 (Why is no real title available?)
- scientific article; zbMATH DE number 862514 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 2229941 (Why is no real title available?)
- Accuracy and Stability of Numerical Algorithms
- Concepts and results in chaotic dynamics. A short course
- Do numerical orbits of chaotic dynamical processes represent true orbits?
- Efficient exact computation of iterated maps
- Exact real arithmetic using centred intervals and bounded error terms
- Fast and parallel interval arithmetic
- Feasible real random access machines
- MPFR
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- On the abundance of aperiodic behaviour for maps on the interval
- Precise numerical computation
- Rigorous chaos verification in discrete dynamical systems
- Rigorous verification of trajectories for the computer simulation of dynamical systems
- Shadowing of physical trajectories in chaotic dynamics: Containment and refinement
- Significance arithmetic: The carrying algorithm
Cited in
(9)- The computational complexity of the Needing invariant of explosive maps of the interval
- Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
- On the complexity of fitted toral dynamics
- Computing with dynamical systems
- On the complexity of Anosov saddle transitions
- Efficient exact computation of iterated maps
- Computational complexity of iterated maps on the interval (extended abstract)
- scientific article; zbMATH DE number 3915627 (Why is no real title available?)
- Interval computing periodic orbits of maps using a piecewise approach
This page was built for publication: Computational complexity of iterated maps on the interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449664)
