arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.06086math.DScs.NAmath.NA
收藏

平面内ODE系统状态相关时滞扰动的周期轨道和等时线的数值计算

Numerical computation of periodic orbits and isochrons for state-dependent delay perturbation of an ODE in the plane

Joan Gimeno, Jiaqi Yang, Rafael de la Llave

摘要:

我们提出的算法和实现计算极限环和他们的等时线的状态依赖延迟方程(SDDE的),这是从一个平面微分方程与极限环扰动。注意SDDE的解空间是无限维的。我们计算一个两个参数家庭的解决方案的SDDE收敛到的解决方案的常微分方程的扰动到零的极限环附近。我们使用的方法制定的函数方程之间的周期函数(或函数收敛指数周期)。该函数方程表示该函数解SDDE。因此,我们考虑具有所需形状的函数空间,并要求它们是解,而不是演化初始数据并找到某种形状的解。这些不变性方程的数学理论是在一个配套文件中开发的,它开发了“后验”定理。他们表明,如果有一个充分的近似解(相对于一些明确的条件数),那么有一个真正的解决方案接近的近似。由于数值方法产生近似解,并提供条件数的估计,我们可以确保我们考虑的数值解近似真解。在本文中,我们选择了一个系统的方法来近似函数的一组有限的数字(泰勒-傅里叶级数),并开发了一个工具包的算法,实现运营商-特别是组合-进入理论。我们还提出了几个实施结果,并提出了一些代表性的情况下,运行的算法及其实施的结果。

英文摘要:

We present algorithms and their implementation to compute limit cycles and their isochrons for state-dependent delay equations (SDDE's) which are perturbed from a planar differential equation with a limit cycle. Note that the space of solutions of an SDDE is infinite dimensional. We compute a two parameter family of solutions of the SDDE which converge to the solutions of the ODE as the perturbation goes to zero in a neighborhood of the limit cycle. The method we use formulates functional equations among periodic functions (or functions converging exponentially to periodic). The functional equations express that the functions solve the SDDE. Therefore, rather than evolving initial data and finding solutions of a certain shape, we consider spaces of functions with the desired shape and require that they are solutions. The mathematical theory of these invariance equations is developed in a companion paper, which develops "a posteriori" theorems. They show that, if there is a sufficiently approximate solution (with respect to some explicit condition numbers), then there is a true solution close to the approximate one. Since the numerical methods produce an approximate solution, and provide estimates of the condition numbers, we can make sure that the numerical solutions we consider approximate true solutions. In this paper, we choose a systematic way to approximate functions by a finite set of numbers (Taylor-Fourier series) and develop a toolkit of algorithms that implement the operators -- notably composition -- that enter into the theory. We also present several implementation results and present the results of running the algorithms and their implementation in some representative cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑