Recent advances in a rigorous computation of Poincaré maps (Q2137186)

The paper is devoted to present a computational algorithm for computing rigorously Poincaré maps associated with the solution of ordinary differential equations. The algorithm (programmed in C++) has been incorporated in the free software package CAPD::DynSys, also developed by the authors. The idea of the procedure is to enclose in an efficient way the Poincaré sections near a periodic orbit, taking advantage of the representation of subsets of \(\mathbb{R}^n\) by the underlying (rigorous) solver used for integrating the differential equation. By suitably choosing the coordinates of the section it is possible to reduce the overestimation in the computation of Poincaré maps. The advantages of the algorithm are illustrated by a collection of numerical examples. The title of the paper is somehow misleading, in the sense that it is not a review of recent techniques in the field, other than the original algorithm itself.