Skip Navigation

IMA Journal of Numerical Analysis 2001 21(3):751-767; doi:10.1093/imanum/21.3.751
© 2001 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Grüne, L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Persistence of attractors for one-step discretization of ordinary differential equations

Lars Grüne1

1 Fachbereich Mathematik, J.W. Goethe-Universität, Postfach 111932, 60054 Frankfurt am Main, Germany. Email: gruene@math.uni-frankfurt.de

We consider numerical one-step approximations of ordinary differential equations and present two results on the persistence of attractors appearing in the numerical system. First, we show that the upper limit of a sequence of numerical attractors for a sequence of vanishing time-steps is an attractor for the approximated system if and only if for all these time-steps the numerical one-step schemes admit attracting sets which approximate this upper limit set and attract with a uniform rate. Second, we show that if these numerical attractors themselves attract with a uniform rate, then they converge to some set if and only if this set is an attractor for the approximated system. In this case, we can also give an estimate for the rate of convergence depending on the rate of attraction and on the order of the numerical scheme.

Key Words: ordinary differential equation; numerical one-; step approximation; attractor; dynamical system


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.