Despite symmetric one-step methods applied to Hamiltonian dynamical systems fail in general to be symplectic, we show that symmetry implies, however, a relation which is close to symplecticity and that we called state dependent symplecticity. We introduce such definition for general maps and analyze it from an analytical viewpoint in one simpler case. Some numerical tests are instead reported as a support of this feature in relation with the good long time behaviour of the solutions generated by symmetric methods. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Lavernaro, F., & Pace, B. (2006). State dependent symplecticity of symmetric methods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3994 LNCS-IV, pp. 724–731). Springer Verlag. https://doi.org/10.1007/11758549_98
Mendeley helps you to discover research relevant for your work.