The paper studies numerical methods that preserve a Lyapunov function of a dynamical system, i.e. numerical approximations whose energy decreases, just like in the original differential equation. With this aim, a discrete gradient method is implemented for numerical integration of a system of ordinary differential equations. In principle, this procedure yields first order methods, but the analysis paves the way to the design of higher-order methods. As a case in point, the proposed method is applied to the Duffing equation without external forcing, considering that in this case, preserving the Lyapunov function is more important than accuracy of particular trajectories. Results are validated by means of numerical experiments, where the discrete gradient method is compared to standard Runge-Kutta methods. As predicted by the theory, discrete gradient methods preserve the Lyapunov function, whereas conventional methods fail to do so, since either periodic solutions appear or the energy does not decrease. Besides, the discrete gradient method outperforms conventional schemes when these do preserve the Lyapunov function, in terms of computational cost, thus the proposed method is promising.
翻译:纸质研究保存动态系统的Lyapunov函数的数字方法,即能量下降的数值近似值,就像原始的差别方程一样。为了这个目的,对普通差别方程的数值集采用了离散梯度方法。原则上,这个程序产生第一顺序方法,但分析为设计较高等级方法铺平了道路。作为一个例子,拟议方法适用于Duffing方程,而没有外部强迫,考虑到在这种情况下,保存Lyapunov函数比特定轨迹的准确性更重要。结果通过数字实验手段验证,其中离散梯度方法与标准Runge-Kutta方法进行比较。根据理论预测,离散梯度方法保留了Lyapunov函数,而传统方法未能这样做,因为要么出现定期解决办法,要么能源不会减少。此外,离散梯度方法在计算成本方面确实维护了Lyapunov功能,因此拟议的方法很有希望。