On connecting periodic trajectories with quasi-periodic paths

In this paper, we delve further into the Gluskabi raccordation problem introduced in. The problem involves the connection of any two trajectories with a particular behavior in such a way that this behavior persists during the transition. Specifically, we will consider connecting two periodic trajectories with quasi-periodic paths; we will compare the two approaches laid out in and show how they are related. One of the two methods has a frequency domain flavor while the other deals explicitly with the time domain trajectory. We also derive an algorithm to compute such trajectories.