Year: 1998
Journal of Computational Mathematics, Vol. 16 (1998), Iss. 1 : pp. 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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1998-JCM-9137
Journal of Computational Mathematics, Vol. 16 (1998), Iss. 1 : pp. 1–14
Published online: 1998-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 14
Keywords: Contact algorithms contact systems conic symplectic geometry generating functions.