arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.05003math.DSphysics.class-ph
收藏

高维环面不变流形高阶展开的数值计算

Numerical computation of high-order expansions of invariant manifolds of high-dimensional tori

Universitat de Barcelona(巴塞罗那大学);Barcelona Expert Center (BEC)(巴塞罗那卓越中心);Institute of Marine Sciences (ICM)(海洋科学研究所);Consejo Superior de Investigaciones Científicas (CSIC)(西班牙国家研究委员会)

Joan Gimeno, Àngel Jorba, Begoña Nicolás, Estrella Olmedo

AI总结:

该研究提出一种计算频闪庞加莱映射中可约不变环面及其稳定/不稳定流形的两步数值方法,计算量低、并行度高,可高效处理需大量傅里叶模式的高维环面,并通过准周期受迫ODE的5维以内环面算例验证了并行效率。

摘要:

本文提出了一种在频闪庞加莱映射中计算可约不变环面及其稳定、不稳定流形的方法。该方法分为两个步骤:第一步,通过二次收敛格式计算环面的傅里叶级数、其弗洛凯变换以及弗洛凯矩阵;若环面存在稳定和/或不稳定方向,则在第二步中计算对应不变流形的泰勒-傅里叶展开,直至达到指定阶数。本文还讨论了环面高度不稳定、需采用多重打靶策略计算环面的情况。若流形的泰勒展开阶数固定,N为傅里叶模式数量,则整个计算过程(含环面与流形)的计算量以O(N log N)的量级增长,内存需求为O(N)量级,这使得该算法非常适合计算需要大量傅里叶模式的高维环面。此外,该算法具有极高的并行度。本文包含多个算例,计算了准周期受迫常微分方程的不变环面(维数最高达5维),所有计算均在并行计算机上完成,文中还讨论了算法相对于处理器数量的效率。

英文摘要:

In this paper we present a procedure to compute reducible invariant tori and their stable and unstable manifolds in stroboscopic Poincaré maps. The method has two steps. In the first step we compute, by means of a quadratically convergent scheme, the Fourier series of the torus, its Floquet transformation, and its Floquet matrix. If the torus has stable and/or unstable directions, in the second step we compute the Taylor-Fourier expansions of the corresponding invariant manifolds up to a given order. The paper also discusses the case in which the torus is highly unstable so that a multiple shooting strategy is needed to compute the torus. If the order of the Taylor expansion of the manifolds is fixed and N is the number of Fourier modes, the whole computational effort (torus and manifolds) increases as O(N log N) q and the memory required behaves as O(N). This makes the algorithm very suitable to compute high-dimensional tori for which a huge number of Fourier modes are needed. Besides, the algorithm has a very high degree of parallelism. The paper includes examples where we compute invariant tori (of dimensions up to 5) of quasi-periodically forced ODEs. The computations are run in a parallel computer and its efficiency with respect to the number of processors is also discussed.

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

↑