Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

An Algorithmic Approach to Chain Recurrence

  • Published:
Foundations of Computational Mathematics Aims and scope Submit manuscript

Abstract

In this paper we give a new definition of the chain recurrent set of a continuous map using finite spatial discretizations. This approach allows for an algorithmic construction of isolating blocks for the components of Morse decompositions which approximate the chain recurrent set arbitrarily closely as well as discrete approximations of Conley’s Lyapunov function. This is a natural framework in which to develop computational techniques for the analysis of qualitative dynamics including rigorous computer-assisted proofs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL 33434, USA

    W.D. Kalies

  2. Center for Dynamical Systems and Nonlinear Studies, Georgia Institute of Technology, Atlanta, GA 30332, USA

    K. Mischaikow

  3. Department of Mathematics, Vrije University Amsterdam, De Boelelaan 1081, 1081 HV, Amsterdam, The Netherlands

    R.C.A.M. VanderVorst

Authors
  1. W.D. Kalies
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Mischaikow
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R.C.A.M. VanderVorst
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to W.D. Kalies, K. Mischaikow or R.C.A.M. VanderVorst.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kalies, W., Mischaikow, K. & VanderVorst, R. An Algorithmic Approach to Chain Recurrence. Found Comput Math 5, 409–449 (2005). https://doi.org/10.1007/s10208-004-0163-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10208-004-0163-9

Search

Navigation