Rigorous error bounds for RK methods in the proof of chaotic behaviour
DOI10.1016/S0377-0427(99)00128-4zbMATH Open0941.65130OpenAlexW2087470518MaRDI QIDQ1964098FDOQ1964098
Authors: Arno Berger
Publication date: 20 July 2000
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(99)00128-4
Recommendations
dynamical systemsConley indextruncation errorchaotic behaviourpendulumexplicit Runge-Kutta methodsround-off erroriteration schemes
Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Numerical chaos (65P20) Index theory for dynamical systems, Morse-Conley indices (37B30) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Error bounds for numerical methods for ordinary differential equations (65L70) Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15)
Cites Work
- Solving Ordinary Differential Equations I
- A combinatorial procedure for finding isolating neighbourhoods and index pairs
- Title not available (Why is that?)
- Chaos in the Lorenz equations: a computer-assisted proof
- The Conley index for decompositions of isolated invariant sets
- Rigorous error analysis of numerical algorithms via symbolic computations
- Title not available (Why is that?)
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)