Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-24T03:17:03.452Z Has data issue: false hasContentIssue false
  • English
  • Français

Topological techniques for efficient rigorous computation in dynamics

Published online by Cambridge University Press:  15 July 2003

Konstantin Mischaikow
Konstantin Mischaikow
Affiliation:
Center for Dynamical Systems and Nonlinear Studies, Georgia Institute of Technology, Atlanta, GA 30332, USA. E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We describe topological methods for the efficient, rigorous computation of dynamical systems. In particular, we indicate how Conley's Fundamental Decomposition Theorem is naturally related to combinatorial approximations of dynamical systems. Furthermore, we show that computations of Morse decompositions and isolating blocks can be performed efficiently. We conclude with examples indicating how these ideas can be applied to finite- and infinite-dimensional discrete and continuous dynamical systems.

Type
Research Article
Information
Acta Numerica , Volume 11 , January 2002 , pp. 435 - 477
Copyright
© Cambridge University Press 2002

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.)