Discretization strategies for computing Conley indices and Morse decompositions of flows

From MaRDI portal
Publication:333770

DOI10.3934/JCD.2016001zbMATH Open1373.37043arXiv1511.04426OpenAlexW2963440743MaRDI QIDQ333770FDOQ333770


Authors: Frank Weilandt, Marian Mrozek, K. Mischaikow Edit this on Wikidata


Publication date: 31 October 2016

Published in: Journal of Computational Dynamics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1511.04426




Recommendations




Cites Work


Cited In (8)

Uses Software





This page was built for publication: Discretization strategies for computing Conley indices and Morse decompositions of flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333770)