Persistence in sampled dynamical systems faster

We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior, and to recover the eigenspaces of the endomorphism on homology induced by the self-map. The chain maps are constructed using discrete Morse theory for Čech and Delaunay complexes, representing the requisite discrete gradient field implicitly in order to get fast algorithms.