海词手机词典
  • We prove that symplectic algorithms may keep most of the invariant curves of Duffing equation when the time-step is small enough but non-symplectic algorithms cannot.

    播放读音 播放读音