@Article{JCM-16-97,
author = {Feng , Kang and Wang , Daoliu},
title = {Variations on a Theme by Euler},
journal = {Journal of Computational Mathematics},
year = {1998},
volume = {16},
number = {2},
pages = {97--106},
abstract = {<p style="text-align: justify;">The oldest and simplest difference scheme is the explicit Euler method. Usually, it is not symplectic for general Hamiltonian systems. It is interesting to ask: Under what conditions of Hamiltonians, the explicit Euler method becomes symplectic? In this paper, we give the class of Hamiltonians for which systems the explicit Euler method is symplectic. In fact, in these cases, the explicit Euler method is really the phase flow of the systems, therefore symplectic. Most of important Hamiltonian systems can be decomposed as the summation of these simple systems. Then composition of the Euler method acting on these systems yields a symplectic method, also explicit. These systems are called symplectically separable. Classical separable Hamiltonian systems are symplectically separable. Especially, we prove that any polynomial Hamiltonian is symplectically separable.</p>},
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/9144.html}
}