Papers
Topics
Authors
Recent
2000 character limit reached

Kolmogorov algorithm for isochronous Hamiltonian systems (2206.09711v1)

Published 20 Jun 2022 in math-ph and math.MP

Abstract: We present a Kolmogorov-like algorithm for the computation of a normal form in the neighborhood of an invariant torus in `isochronous' Hamiltonian systems, i.e., systems with Hamiltonians of the form $\mathcal{H}=\mathcal{H}_0+\varepsilon \mathcal{H}_1$ where $\mathcal{H}_0$ is the Hamiltonian of $N$ linear oscillators, and $\mathcal{H}_1$ is expandable as a polynomial series in the oscillators' canonical variables. This method can be regarded as a normal form analogue of a corresponding Lindstedt method for coupled oscillators. We comment on the possible use of the Lindstedt method itself under two distinct schemes, i.e., one producing series analogous to those of the Birkhoff normal form scheme, and another, analogous to the Kolomogorov normal form scheme in which we fix in advance the frequency of the torus.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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