2022
DOI: 10.3934/jcd.2022002
|View full text |Cite
|
Sign up to set email alerts
|

Hamiltonian control of magnetic field lines: Computer assisted results proving the existence of KAM barriers

Abstract: <p style='text-indent:20px;'>We reconsider a control theory for Hamiltonian systems, that was introduced on the basis of KAM theory and applied to a model of magnetic field in previous articles. By a combination of Frequency Analysis and of a rigorous (Computer Assisted) KAM algorithm we prove that in the phase space of the magnetic field, due to the control term, a set of invariant tori appear, and it acts as a transport barrier. Our analysis, which is common (but often also limited) to Celestial Mechan… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
2

Relationship

3
4

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 24 publications
1
2
0
Order By: Relevance
“…Rather curiously, the best way to translate the algorithm constructing the Kolmogorov normal form in a computer-assisted proof requires to join the convergence scheme of linear type (in order to explicitly perform on a computer the largest possible number R I of preliminary steps) with that of quadratic type (that provides a statement of KAM theorem that is very suitable to rigorously complete the proof). This is one of the main conclusions discussed in a recent work (see [40]).…”
Section: On the Convergence Of The Algorithm Constructing The Kolmogo...supporting
confidence: 74%
“…Rather curiously, the best way to translate the algorithm constructing the Kolmogorov normal form in a computer-assisted proof requires to join the convergence scheme of linear type (in order to explicitly perform on a computer the largest possible number R I of preliminary steps) with that of quadratic type (that provides a statement of KAM theorem that is very suitable to rigorously complete the proof). This is one of the main conclusions discussed in a recent work (see [40]).…”
Section: On the Convergence Of The Algorithm Constructing The Kolmogo...supporting
confidence: 74%
“…For the time being, so-successful results have been obtained for benchmark systems (mappings with or without additional dissipative terms) that are quite interesting but intrinsically simple. On the other hand, the application of CAPs to realistic models of physical interest highlights that there is still a gap to fill in order to approach the numerical threshold (see, e.g., [4] and [34]; see also [6] for the rigorous evaluation of an effective stability time, with a similar kind of CAP technique). This is the reason for which we were looking for initial conditions that were not only corresponding to an invariant torus (that could have been found by applying, e.g., the frequency analysis; see [19]), but also quite far from its breakdown threshold (which is somehow depending on the physical parameters characterising a planetary systems).…”
Section: Discussionmentioning
confidence: 99%
“…In order to rigorously prove that the KAM algorithm is convergent, we adopt a rigorous approach based on a computer-assisted proof. For this purpose, we follow the method which has been described in Celletti et al (2000) and further developed in Valvo and Locatelli (2022), where a publicly available software package 10 is provided as supplementary material. Such a package is designed for doing just this kind of computer-assisted proof for Hamiltonian systems having two degrees of freedom.…”
Section: Computer-assisted Proofmentioning
confidence: 99%