Approximation of box dimension of attractors using the subdivision algorithm
From MaRDI portal
Recommendations
- An adaptive subdivision technique for the approximation of attractors and invariant measures
- Box dimension of fractal attractors and their numerical computation
- Calculation of dimensions of curves generated by subdivision schemes
- Provably convergent implementations of the subdivision algorithm for the computation of invariant objects
- scientific article; zbMATH DE number 841117
Cites work
- A subdivision algorithm for the computation of unstable manifolds and global attractors
- An equation for continuous chaos
- Deterministic Nonperiodic Flow
- Finding zeros by multilevel subdivision techniques
- Lower bounds for the Hausdorff dimension of attractors
- Maximum local Lyapunov dimension bounds the box dimension. Direct proof for invariant sets on Riemannian manifolds
- The double scroll
- The dynamics of the Hénon map
- The Lorenz attractor exists
Cited in
(8)- Provably convergent implementations of the subdivision algorithm for the computation of invariant objects
- Box dimension of fractal attractors and their numerical computation
- Application based construction and optimization of substitution boxes over 2D mixed chaotic maps
- Subdivision algorithm for optimal control
- A Set-Oriented Path Following Method for the Approximation of Parameter Dependent Attractors
- Box dimension of Neimark–Sacker bifurcation
- Optimal Transport for Parameter Identification of Chaotic Dynamics via Invariant Measures
- An adaptive subdivision technique for the approximation of attractors and invariant measures
This page was built for publication: Approximation of box dimension of attractors using the subdivision algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3377980)