Rigorous error bounds for RK methods in the proof of chaotic behaviour (Q1964098): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-0427(99)00128-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087470518 / rank | |||
Normal rank | |||
Latest revision as of 12:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rigorous error bounds for RK methods in the proof of chaotic behaviour |
scientific article |
Statements
Rigorous error bounds for RK methods in the proof of chaotic behaviour (English)
0 references
20 July 2000
0 references
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.
0 references
explicit Runge-Kutta methods
0 references
truncation error
0 references
round-off error
0 references
chaotic behaviour
0 references
iteration schemes
0 references
Conley index
0 references
dynamical systems
0 references
pendulum
0 references
