arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.00620nlin.CDcond-mat.stat-mech
收藏

用五种辛和两种Runge-Kutta积分器比较非常光滑的细胞模型轨迹

Comparison of Very Smooth Cell-Model Trajectories Using Five Symplectic and Two Runge-Kutta Integrators

William Graham Hoover, Carol Griswold Hoover

摘要:

时间可逆辛方法,这是精确兼容的刘维尔的相体积守恒定理,经常被推荐用于哈密顿力学的计算模拟。缺乏能量漂移是这种方法的明显优点。但是所有的数值方法都容易受到李雅普诺夫不稳定性的影响,这严重限制了混沌解可以“准确”的最大时间。高阶方法的“优势”在典型的混沌哈密顿算子中迅速丧失。我们说明了这些困难的一个有用的可重复的测试情况下,二维单粒子细胞模型,特别光滑的力量。这个哈密顿问题是混沌的,发生在一个三维的恒定能量壳,混沌的最小维数。我们基准的问题与四倍精度的轨迹使用四阶Candy-Rozmus,五阶龙格库塔,八阶Schlier-Seiter-Teloy积分。我们比较最后,最准确的粒子轨迹,从六个双精度算法,四辛和两个龙格库塔。

英文摘要:

Time-reversible symplectic methods, which are precisely compatible with Liouville's phase-volume-conservation theorem, are often recommended for computational simulations of Hamiltonian mechanics. Lack of energy drift is an apparent advantage of such methods. But all numerical methods are susceptible to Lyapunov instability, which severely limits the maximum time for which chaotic solutions can be "accurate". The "advantages" of higher-order methods are lost rapidly for typical chaotic Hamiltonians. We illustrate these difficulties for a useful reproducible test case, the two-dimensional one-particle cell model with specially smooth forces. This Hamiltonian problem is chaotic and occurs on a three-dimensional constant-energy shell, the minimum dimension for chaos. We benchmark the problem with quadruple-precision trajectories using the fourth-order Candy-Rozmus, fifth-order Runge-Kutta, and eighth-order Schlier-Seiter-Teloy integrators. We compare the last, most-accurate particle trajectories to those from six double-precision algorithms, four symplectic and two Runge-Kutta.

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

↑