Provably convergent implementations of the subdivision algorithm for the computation of invariant objects
DOI10.1007/s00211-018-0997-8zbMath1411.37064arXiv1708.03980OpenAlexW2963070946WikidataQ129159298 ScholiaQ129159298MaRDI QIDQ1740507
Publication date: 30 April 2019
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.03980
Numerical methods for initial value problems involving ordinary differential equations (65L05) Error bounds for numerical methods for ordinary differential equations (65L70) Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Dynamical systems in numerical analysis (37N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation of attractors of nonautonomous dynamical systems
- Almost-invariant sets and invariant manifolds - connecting probabilistic and geometric descriptions of coherent structures in flows
- On target for Venus -- set oriented computation of energy efficient low thrust trajectories
- Computation of nonautonomous invariant and inertial manifolds
- A subdivision algorithm for the computation of unstable manifolds and global attractors
- Covering Pareto sets by multilevel subdivision techniques
- Global optimization using a dynamical systems approach
- A set oriented approach to optimal feedback stabilization
- A Set-Oriented Numerical Approach for Dynamical Systems with Parameter Uncertainty
- New methods in celestial mechanics and mission design
- Topological techniques for efficient rigorous computation in dynamics
- On the Approximation of Complicated Dynamical Behavior
- A dynamical systems model of price bubbles and cycles
This page was built for publication: Provably convergent implementations of the subdivision algorithm for the computation of invariant objects
