Computing geometric Lorenz attractors with arbitrary precision
From MaRDI portal
Publication:3130791
DOI10.1090/tran/7228MaRDI QIDQ3130791
No author found.
Publication date: 29 January 2018
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.04059
37A35: Entropy and other invariants, isomorphism, classification in ergodic theory
37D45: Strange attractors, chaotic dynamics of systems with hyperbolic behavior
03D78: Computation over the reals, computable analysis
Related Items
Computability of Differential Equations, Automatic generation of bounds for polynomial systems with application to the Lorenz system, Computability of topological entropy: from general systems to transformations on Cantor sets and the interval, The art of solving a large number of non-stiff, low-dimensional ordinary differential equation systems on GPUs and CPUs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Lorenz attractor is mixing
- A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- Structural stability of Lorenz attractors
- What are SRB measures, and which dynamical systems have them?
- Mathematical problems for the next century
- A rigorous ODE solver and Smale's 14th problem
- Computability, noncomputability, and hyperbolic systems
- Statistical properties of dynamical systems -- Simulation and abstract computation
- Computability theory of generalized functions
- Three-Dimensional Flows
- Singular-hyperbolic attractors are chaotic
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Non-computable Julia sets