Rigorous error bounds for RK methods in the proof of chaotic behaviour (Q1964098): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Q1182354 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Dana Petcu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Ordinary Differential Equations I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5719651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chaos in the Lorenz equations: a computer-assisted proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous error analysis of numerical algorithms via symbolic computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Conley index for decompositions of isolated invariant sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial procedure for finding isolating neighbourhoods and index pairs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:47, 29 May 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
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references