Efficient exact computation of iterated maps
From MaRDI portal
Publication:1779563
DOI10.1016/j.jlap.2004.07.004zbMath1080.03041OpenAlexW2034556801MaRDI QIDQ1779563
Publication date: 1 June 2005
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2004.07.004
Constructive and recursive analysis (03F60) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)
Related Items (4)
Limit cycles and their period detection via numeric and symbolic hybrid computations ⋮ Computational complexity of iterated maps on the interval ⋮ From Coinductive Proofs to Exact Real Arithmetic ⋮ Exact real arithmetic using centred intervals and bounded error terms
Uses Software
Cites Work
- Periodic GMP matrices
- Incompleteness theorems for random reals
- Fast multiplication of large numbers
- Computable functionals
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Abstract versus concrete computation on metric partial algebras
- Computability and complexity in analysis. 4th international workshop, CCA 2000. Swansea, GB, September 17--19, 2000. Selected papers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient exact computation of iterated maps