Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-8mjnm Total loading time: 0 Render date: 2024-03-29T06:44:03.966Z Has data issue: false hasContentIssue false

6 - Topological techniques for efficient rigorous computation in dynamics

Published online by Cambridge University Press:  21 May 2010

Konstantin Mischaikow
Affiliation:
Center for Dynamical Systems and Nonlinear Studies, Georgia Institute of Technology, Atlanta, GA 30332, USA
Arieh Iserles
Affiliation:
University of Cambridge
Get access

Summary

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.

Introduction

This paper is an expository article on using topological methods for the efficient, rigorous computation of dynamical systems. Of course, since its inception the computer has been used for the purpose of simulating nonlinear models. However, in recent years there has been a rapid development in numerical methods specifically designed to study these models from a dynamical systems point of view, that is, with a particular emphasis on the structures which capture the long-term or asymptotic states of the system. At the risk of greatly simplifying these results, this work has followed two themes: indirect methods and direct methods.

The indirect methods are most closely associated with simulations, and as such are extremely important because they tend to be the cheapest computationally. The emphasis is on developing numerical schemes whose solutions exhibit the same dynamics as the original system: for example, if one is given a Hamiltonian system, then it is reasonable to want a numerical method that preserves the integrals of the original system.

Type
Chapter
Information
Acta Numerica 2002 , pp. 435 - 478
Publisher: Cambridge University Press
Print publication year: 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.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×