Approximation of box dimension of attractors using the subdivision algorithm

DOI10.1080/14689360500141772zbMath1087.37019OpenAlexW1966116851MaRDI QIDQ3377980

Peter Taraba, Stefan Siegmund

Publication date: 29 March 2006

Published in: Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/14689360500141772

zbMATH Keywords

convergence speedminimal coveringcovering of the attractor with boxesHénon, Lorenz, Rössler and Chua attractors

Mathematics Subject Classification ID

Attractors and repellers of smooth dynamical systems and their topological structure (37C70) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Dimension theory of smooth dynamical systems (37C45)

Related Items

Optimal Transport for Parameter Identification of Chaotic Dynamics via Invariant Measures ⋮ A Set-Oriented Path Following Method for the Approximation of Parameter Dependent Attractors ⋮ Subdivision algorithm for optimal control

Cites Work

• The dynamics of the Hénon map
• A subdivision algorithm for the computation of unstable manifolds and global attractors
• Maximum local Lyapunov dimension bounds the box dimension. Direct proof for invariant sets on Riemannian manifolds
• Lower bounds for the Hausdorff dimension of attractors
• An equation for continuous chaos
• The double scroll
• The Lorenz attractor exists
• Finding zeros by multilevel subdivision techniques
• Deterministic Nonperiodic Flow

This page was built for publication: Approximation of box dimension of attractors using the subdivision algorithm