Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-22T17:17:02.371Z Has data issue: false hasContentIssue false
  • English
  • Français

Chain recurrence and discretisation

Published online by Cambridge University Press:  17 April 2009

Barnabas M. Garay  and
Josef Hofbauer
Barnabas M. Garay
Affiliation:
Department of Mathematics, University of Technology, H-1521 Budapest, Hungary
Josef Hofbauer
Affiliation:
Department of Mathematics, University Vienna, Strudlhofgasse 4, A-1090 Wien, Austria
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Upper and lower semicontinuity results for the chain recurrent set are shown to remain valid in numerical dynamics with constant stepsizes. It is also pointed out that the chain recurrent set contains numerical ω–limit sets for discretisations with a variable stepsize sequence approaching zero.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 55 , Issue 1 , February 1997 , pp. 63 - 71
Copyright
Copyright © Australian Mathematical Society 1997

References

[1]Akin, E., The general topology of dynamical systems (Amer. Math. Soc, Providence, R.I., 1993).Google Scholar
[2]Benaim, M. and Hirsch, M.W., ‘Asymptotic pseudotrajectories, chain recurrent flows and stochastic approximations’, (preprint).Google Scholar
[3]Beyn, W.J., ‘On invariant curves for one-step methods’, Numer. Math. 51 (1987), 103–122.CrossRefGoogle Scholar
[4]Brunovsky, P., Hofbauer, J. and Nagylaki, T., ‘Convergence of multilocus systems under weak epistasis or weak selection’, (preprint).Google Scholar
[5]Conley, C., Isolated invariant sets and the Morse index (Amer. Math. Soc. CBMS 38, Providence, R.I., 1978).CrossRefGoogle Scholar
[6]Franke, J.E. and Selgrade, J.F., ‘Hyperbolicity and chain recurrence’, J. Differential Equations 26 (1977), 27–36.CrossRefGoogle Scholar
[7]Garay, B.M., ‘Discretization and normal hyperbolicity’, Z. Angew. Math. Mech. 74 (1994), T 662–663.Google Scholar
[8]Garay, B. M., ‘On Cj–closeness between the solution flow and its numerical approximation’, J. Difference Eq. Appl. 2 (1996), 67–86.CrossRefGoogle Scholar
[9]Garay, B.M., ‘On structural stability of ordinary differential equations with respect to discretization methods’, Numer. Math. 72 (1996), 449–479.CrossRefGoogle Scholar
[10]Irwin, M.C., Smooth dynamical systems (Academic Press, New York, 1980).Google Scholar
[11]Kloeden, P. and Lorenz, J., ‘Stable attracting sets in dynamical systems and their one-step discretizations’, SIAM J. Numer. Anal. 23 (1986), 986–995.CrossRefGoogle Scholar
[12]Pugh, C., ‘An improved closing lemma and a general density theorem’, Amer. J. Math. 89 (1967), 1010–1021.CrossRefGoogle Scholar
[13]Stuart, A., ‘Numerical analysis of dynamical systems’, Acta Numerica 4 (1994), 467–572.CrossRefGoogle Scholar