Hostname: page-component-6bf8c574d5-w79xw Total loading time: 0 Render date: 2025-02-16T17:23:20.103Z Has data issue: false hasContentIssue false
  • English
  • Français

Dynamical systems: stability and simulability

Published online by Cambridge University Press:  01 April 2007

MATHIEU HOYRUP
MATHIEU HOYRUP*
Affiliation:
LIENS, CNRS – ENS, 45 rue d'Ulm, F-75230 Paris cedex 05, France Email: [email protected]
Get access Rights & Permissions [Opens in a new window]

Extract

Computers are used extensively to simulate continuous dynamical systems. However, different conceptual and mathematical structures underlie discrete machines and continuous dynamics, so the question arises as to the ability of the computer to simulate or, more generally, to check the properties of a continuous system.

We discuss and compare two notions of stability for a continuous dynamical system, viz. shadowing and robustness, and relate them to both the practical and theoretical computability of the system. We first discuss what we can learn from the stability of a system, using a finite-precision machine. We then show, following the work in Collins (2005), that shadowing fails but robustness succeeds in ensuring the checkability of a reachability property.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 17 , Issue 2 , April 2007 , pp. 247 - 259
Copyright
Copyright © Cambridge University Press 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Alligood, K. T., Sauer, T. D. and Yorke, J. A (1996) Chaos: An Introduction to Dynamical Systems, Springer.CrossRefGoogle Scholar
Asarin, E. and Bouajjani, A (2001) Perturbed Turing Machines and Hybrid Systems. LICS'2001.CrossRefGoogle Scholar
Brattka, V. and Presser, G (2003) Computability on subsets of metric spaces. Theoretical Computer Science 305 43–76.CrossRefGoogle Scholar
Brattka, V. and Weihrauch, K (1999) Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science 219 65–93.CrossRefGoogle Scholar
Chow, S. N. and Palmer, K. J (1991) On the numerical computation of orbits of dynamical systems: the one-dimensional case. Dynamics and Differential Equations 3 361–380.CrossRefGoogle Scholar
Collins, P (2005) Continuity and computability of reachable sets. Theoretical Computer Science 341.CrossRefGoogle Scholar
Devaney, R (1989) An Introduction to Chaotic Dynamical Systems, Perseus Publishing Co. (HarperCollins).Google Scholar
Pour-El, M. and Richards, I (1989) Computability in Analysis and Physics, Springer-Verlag.CrossRefGoogle Scholar
Rojas, C (2006) Computability and Information in Models of Randomness and Chaos (to appear).Google Scholar
Weihrauch, K (2000) Computable Analysis, An Introduction, Springer-Verlag.CrossRefGoogle Scholar