Poincaré Maps with the Theory of Functional Connections
A. K. de Almeida, Daniele Mortari
TL;DR
This work shows that Poincaré maps can be constructed with high precision using the Theory of Functional Connections (TFC), by embedding constraints directly into constrained functionals that represent system trajectories. The approach formulates surface-crossing problems as both IVPs and BVPs, achieving linear convergence to Taylor expansions via carefully chosen support functions and enabling exact intersections with surfaces of section without external interpolation or adaptive-step integration. The IVP formulation yields efficient, high-accuracy surface crossings, while the BVP formulation permits exact periodic and recurrence analyses, demonstrated in the CRTBP and in non-autonomous four-body settings, including time-discretized (stroboscopic) maps. Collectively, the method provides a powerful, computationally efficient alternative for constructing Poincaré maps, computing periodic orbits, and analyzing complex astrodynamical dynamical structures with machine-level accuracy at modest cost.
Abstract
Poincaré maps play a fundamental role in nonlinear dynamics and chaos theory, offering a means to reduce the dimensionality of continuous dynamical systems by tracking the intersections of trajectories with lower-dimensional section surfaces. Traditional approaches typically rely on numerical integration and interpolation to detect these crossings, which can lead to inaccuracies and computational inefficiencies. This work presents a novel methodology for constructing Poincaré maps based on the Theory of Functional Connections (TFC). The constrained functionals produced by TFC yield continuous and differentiable representations of system trajectories that exactly satisfy prescribed constraints. The computation of Poincaré maps is formulated as either an initial value problem (IVP) or a boundary value problem (BVP). For IVPs, initial conditions are embedded into the functional, and the intersection time with a specified section surface is determined. We demonstrate linear convergence to the Taylor series, thereby enabling accurate interpolation without resorting to numerical integration or external optimization. For BVPs, periodicity conditions are encoded to identify periodic orbits in a Three-Body Problem context. Furthermore, by enforcing periodic constraints, we show how to construct first recurrence maps. The methodology is also extended to non-autonomous systems, demonstrated through applications to a Four-Body Problem. The proposed approach achieves machine-level accuracy with modest computational effort, eliminating the need for variable transformations or iterative integration schemes with adaptive step-sizing. The results illustrate that TFC offers a powerful and efficient alternative framework for constructing Poincaré maps, computing periodic orbits, and analyzing complex dynamical systems, particularly in astrodynamical contexts.
