Rigorous error bounds for RK methods in the proof of chaotic behaviour
chaotic behaviourConley indexdynamical systemsexplicit Runge-Kutta methodsiteration schemespendulumround-off errortruncation error
Index theory for dynamical systems, Morse-Conley indices (37B30) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Error bounds for numerical methods for ordinary differential equations (65L70) Numerical chaos (65P20)
The paper presents rigorous bounds on the truncation, the round-off and the global error for the numerical integration of ordinary differential equations by means of explicit Runge-Kutta methods. These are provided in the form of iteration schemes ready-made for applications. The Conley index is used to develop an elegant tool for analyzing dynamical systems by means of computers. In order to demonstrate how the findings fit into the framework of the Conley index theory, the dynamics of a pendulum with oscillating support is investigated using a computer-assisted analysis.
- A combinatorial procedure for finding isolating neighbourhoods and index pairs
- Chaos in the Lorenz equations: a computer-assisted proof
- scientific article; zbMATH DE number 4102107 (Why is no real title available?)
- scientific article; zbMATH DE number 3182507 (Why is no real title available?)
- Rigorous error analysis of numerical algorithms via symbolic computations
- Solving Ordinary Differential Equations I
- The Conley index for decompositions of isolated invariant sets
This page was built for publication: Rigorous error bounds for RK methods in the proof of chaotic behaviour
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964098)