基于Padé逼近的辛算法及其稳定性分析

Analysis to the Symplectic Algorithm based on Padé Approximation and its Stability

本文以哈密顿系统中的Padé逼近理论为基础,利用关系chy=cos(iy),(i2=-1)对cosx用Padé有理逼近Rnm(x2)来构造隐式算法,并对构造的隐式辛算法的稳定性进行了分析。

This paper,based on Padé approximation,employs the relation to construct the implicit symplectic algorithm by rational approximationfor and analyzes the stability of the implicit symplectic algorithm.