Computational complexity of iterated maps on the interval
From MaRDI portal
Publication:449664
DOI10.1016/j.matcom.2012.02.003zbMath1286.37066arXiv1003.6036OpenAlexW1562871781MaRDI QIDQ449664
Publication date: 31 August 2012
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.6036
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concepts and results in chaotic dynamics. A short course
- Do numerical orbits of chaotic dynamical processes represent true orbits?
- On the abundance of aperiodic behaviour for maps on the interval
- Feasible real random access machines
- Fast and parallel interval arithmetic
- Rigorous chaos verification in discrete dynamical systems
- Efficient exact computation of iterated maps
- Precise numerical computation
- Significance arithmetic: The carrying algorithm
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- Exact real arithmetic using centred intervals and bounded error terms
- MPFR
- Rigorous verification of trajectories for the computer simulation of dynamical systems
- Shadowing of physical trajectories in chaotic dynamics: Containment and refinement
- Accuracy and Stability of Numerical Algorithms