Parallel Computation of Nearly Recurrent Components of Piecewise Constant Vector Fields

We describe a simple way to parallelize the algorithm for computing Morse decompositions and nearly recurrent sets for piecewise constant vector fields. In this chapter, we focus on the most computationally expensive component of the algorithm, namely refinement of the transition graph, which often takes up over 90 % of the running time.