KAM iteration with nearly infinitely small steps in dynamical systems of polynomial character (Q620010): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3934/dcdss.2010.3.683 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2314213597 / rank | |||
Normal rank |
Latest revision as of 22:26, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | KAM iteration with nearly infinitely small steps in dynamical systems of polynomial character |
scientific article |
Statements
KAM iteration with nearly infinitely small steps in dynamical systems of polynomial character (English)
0 references
19 January 2011
0 references
The present paper is devoted to a new variant of the KAM theory obtained by adding an artificial parameter \(q\in (0, 1)\), which makes the steps of the KAM iteration infinitely small in the limit \(q\rightarrow 1\). This KAM procedure can be compared for \(q<1\) with a Riemann sum which tends for \(q\rightarrow 1\) to the corresponding Riemann integral. As a consequence, this limit has all advantages of an integration process compared with its preliminary stages. But there is a difference from integrals: the KAM iteration itself works only for \(q<1\); however, \(q\) can be chosen as near to \(1\) as we want, and the limit \(q\rightarrow 1\) exists for all involved parameters. The new technique of estimation differs completely from all what has appeared about KAM theory in the literature up to date.
0 references
KAM theory
0 references
artificial parameters
0 references
polynomial approximations
0 references
cut functions
0 references