Discretization strategies for computing Conley indices and Morse decompositions of flows

preprint2015arXivOpen access

Abstract

Conley indices and Morse decompositions of flows can be found by using algorithms which rigorously analyze discrete dynamical systems. This usually involves integrating a time discretization of the flow using interval arithmetic. We compare the old idea of fixing a time step as a parameters to a time step continuously varying in phase space. We present an example where this second strategy necessarily yields better numerical outputs and prove that our outputs yield a valid Morse decomposition of the given flow.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.