In this paper we prove that an analog of the celebrated KAM theorem holds for symplectic algorithms, which Channel and Scovel (1990), Feng Kang (1991) and.
Feb 22, 2024 · Abstract:In this paper we prove a KAM-like theorem of symplectic algorithms for nearly integrable Hamiltonian systems which generalises the ...
In this chapter, we study problems as to whether and to what extent symplectic algorithms can simulate qualitatively and approximate quantitatively the periodic ...
Feb 22, 2024 · In this paper we prove a KAM-like theorem of symplectic algorithms for nearly integrable Hamiltonian systems which generalises the result of [1] ...
In this chapter, we study problems as to whether and to what extent symplectic algorithms can simulate qualitatively and approximate quantitatively the periodic ...
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 ...
In this paper we prove that an analog of the celebrated KAM theorem holds for symplectic algorithms, which Channel and Scovel (1990), Feng Kang (1991) and ...
In this paper we prove a KAM theorem in a geometric context different from those above. We consider “conformally symplectic” systems (maps and flows). A system ...
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 ...
The KAM Theorem, or Kolmogorov-Arnold-Moser Theorem, is a foundational result in dynamical systems that addresses the persistence of quasi-periodic motions ...
Missing: algorithms | Show results with:algorithms