⌘+K

Pulse Explore Clubs Researchers Journals

Home Clubs Explore

February 22, 2024Open Access

A KAM theorem of symplectic algorithms for nearly integrabel Hamiltonian systems

Zaijiu Shang Yang Xu

View Full Paper

Ask AI

Bookmark

Share

Abstract

In this paper we prove a KAM-like theorem of symplectic algorithms for nearly integrable Hamiltonian systems which generalises the result of {r1} and {r6} for the case of integrable systems.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Shang et al. (2024) studied this question.

synapsesocial.com/papers/68e781fab6db6435876f54f7 https://doi.org/10.48550/arxiv.2402.14478

View Full Paper

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Singular KAM theory for convex Hamiltonian systems2025
2Towards continuity: Universal frequency-preserving KAM persistence and remaining regularity in nearly non-integrable Hamiltonian systems2024 · 4 citations
3The elliptical invariant tori of nearly integrable Hamiltonian system through symplectic algorithms2024
4A Potpourri of Structured Krylov Subspace Methods: Approximated Exponential Integrators, Symplectic Model Order Reduction for Hamiltonian Systems, Krylov-Lagrangian Subspaces of Skew-Hamiltonian Matrices2025
5Mechanical Proving the Symplecticity of Partitioned Runge--Kutta Methods for Determinate and Stochastic Hamiltonian Systems2025