Volume 16, Issue 1
Contact Algorithms for Contact Dynamical Systems
DOI:

J. Comp. Math., 16 (1998), pp. 1-14

Published online: 1998-02

Preview Full PDF 547 2143
Export citation

Cited by

• Abstract

In this paper, we develop a general way to construct contact algorithms for contact dynamical systems. Such an algorithm requires the corresponding step-transition map preserve the contact structure of the underlying contact phase space. The constructions are based on the correspondence between the contact geometry of ${\bf R}^{2n+1}$ and the conic symplectic one of ${\bf R}^{2n+2}$ and therefore, the algorithms are derived naturally from the symplectic algorithms of Hamiltonian systems.

• Keywords

Contact algorithms contact systems conic symplectic geometry generating functions

@Article{JCM-16-1, author = {}, title = {Contact Algorithms for Contact Dynamical Systems}, journal = {Journal of Computational Mathematics}, year = {1998}, volume = {16}, number = {1}, pages = {1--14}, abstract = { In this paper, we develop a general way to construct contact algorithms for contact dynamical systems. Such an algorithm requires the corresponding step-transition map preserve the contact structure of the underlying contact phase space. The constructions are based on the correspondence between the contact geometry of ${\bf R}^{2n+1}$ and the conic symplectic one of ${\bf R}^{2n+2}$ and therefore, the algorithms are derived naturally from the symplectic algorithms of Hamiltonian systems. }, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9137.html} }
TY - JOUR T1 - Contact Algorithms for Contact Dynamical Systems JO - Journal of Computational Mathematics VL - 1 SP - 1 EP - 14 PY - 1998 DA - 1998/02 SN - 16 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9137.html KW - Contact algorithms KW - contact systems KW - conic symplectic geometry KW - generating functions AB - In this paper, we develop a general way to construct contact algorithms for contact dynamical systems. Such an algorithm requires the corresponding step-transition map preserve the contact structure of the underlying contact phase space. The constructions are based on the correspondence between the contact geometry of ${\bf R}^{2n+1}$ and the conic symplectic one of ${\bf R}^{2n+2}$ and therefore, the algorithms are derived naturally from the symplectic algorithms of Hamiltonian systems.