Papers
Topics
Authors
Recent
Search
2000 character limit reached

A KAM theorem of symplectic algorithms for nearly integrabel Hamiltonian systems

Published 22 Feb 2024 in math.DS | (2402.14478v1)

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.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (2)

  1. Zaijiu Shang 
  2. Yang Xu 

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up