Stable Attracting Sets in Dynamical Systems and in Their One-Step Discretizations

From MaRDI portal





Dynamical systems described by ordinary autonomous differential equations \[ (1)\quad \dot x=F(x) \] are considered. The problem to determine the longtime behaviour of these systems by numerical methods is investigated. As main result a theorem is given which states that for a compact, uniformly asymptotically stable attracting set of (1) an attracting set nearby can be obtained by one-step numerical methods of pth order \[ x_{n+1}=x_ n+h\quad F_ h(x_ n) \] if F and its first p derivatives are uniformly bounded in \(R^ n\). The proof is based on the existence of Lyapunov functions for differential equations of the given type.




Cited in
(78)








This page was built for publication: Stable Attracting Sets in Dynamical Systems and in Their One-Step Discretizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4720711)