Averaging and computing normal forms with word series algorithms
A. Murua, J.M. Sanz-Serna

TL;DR
This paper introduces a series-based method using word series algorithms for averaging and transforming periodically or quasiperiodically forced systems into simpler normal forms, enabling explicit solution relations and invariants.
Contribution
It develops a universal, recursive series technique for averaging and normal form transformations applicable to forced and perturbed systems, with explicit formulas and invariants.
Findings
Explicit series formulas for averaging transformations.
Universal coefficients independent of specific functions.
Construction of formal invariants in Hamiltonian systems.
Abstract
In the first part of the present work we consider periodically or quasiperiodically forced systems of the form , where , is a nonresonant vector of frequencies and is -periodic in each of the components of (i.e.\ ). We describe in detail a technique for explicitly finding a change of variables and an (autonomous) averaged system so that, formally, the solutions of the given system may be expressed in terms of the solutions of the averaged system by means of the relation . Here and are found as series whose terms consist of vector-valued maps weighted by suitable scalar coefficients. The maps are easily written down by combining the Fourier coefficients of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum chaos and dynamical systems · Mathematical Dynamics and Fractals · Advanced Differential Equations and Dynamical Systems
