4.4 Article

EFFICIENT COMPUTATION OF LYAPUNOV FUNCTIONS FOR MORSE DECOMPOSITIONS

Journal

DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS-SERIES B
Volume 20, Issue 8, Pages 2419-2451

Publisher

AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/dcdsb.2015.20.2419

Keywords

Lyapunov function; Morse decomposition; combinatorial dynamics; Conley's decomposition theorem; algorithms

Funding

  1. NSF [NFS-DMS-0914995, NSF-DMS-0915019, 1125174, 1248071]
  2. AFOSR
  3. DARPA
  4. Division Of Mathematical Sciences
  5. Direct For Mathematical & Physical Scien [1125174, 1248071] Funding Source: National Science Foundation

Ask authors/readers for more resources

We present an efficient algorithm for constructing piecewise constant Lyapunov functions for dynamics generated by a continuous nonlinear map defined on a compact metric space. We provide a memory efficient data structure for storing nonuniform grids on which the Lyapunov function is defined and give bounds on the complexity of the algorithm for both time and memory. We prove that if the diameters of the grid elements go to zero, then the sequence of piecewise constant Lyapunov functions generated by our algorithm converge to a continuous Lyapunov function for the dynamics generated the nonlinear map. We conclude by applying these techniques to two problems from population biology.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available