AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (561.7 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Kolmogorov algorithm for isochronous Hamiltonian systems

Rita Mastroianni( )Christos Efthymiopoulos
Dipartimento di Matematica "Tullio Levi-Civita", Università degli Studi di Padova, Via Trieste 63, 35121 Padova, Italy
Show Author Information

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 H=H0+εH1 where H0 is the Hamiltonian of N linear oscillators, and H1 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.

References

【1】
【1】
 
 
Mathematics in Engineering
Pages 1-35

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Mastroianni R, Efthymiopoulos C. Kolmogorov algorithm for isochronous Hamiltonian systems. Mathematics in Engineering, 2023, 5(2): 1-35. https://doi.org/10.3934/mine.2023035

10

Views

1

Downloads

0

Crossref

1

Web of Science

1

Scopus

Received: 30 October 2021
Revised: 22 March 2022
Accepted: 09 May 2022
Published: 15 April 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)