arXiv · 2402.14478
A KAM theorem of symplectic algorithms for nearly integrabel Hamiltonian systems
Abstract
In this paper we prove a KAM-like theorem of symplectic algorithms for nearly integrable Hamiltonian systems which generalises the result of \cite{r1} and \cite{r6} for the case of integrable systems.
Explore related subjects
Keep this discovery
Zaijiu Shang, Yang Xu. 2024-02-22. A KAM theorem of symplectic algorithms for nearly integrabel Hamiltonian systems. https://arxiv.org/abs/2402.14478
Cite the original work for its findings. Save a collection to share your selection of sources.