Averaging and computing normal forms with word series algorithms
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 and the coefficients are found with the help of simple recursions. Furthermore these coefficients are {\em universal} in the sense that they do not depend on the particular under consideration. In the second part of the contribution, we study problems of the form , where one knows how to integrate the "unperturbed" problem and is a perturbation satisfying appropriate hypotheses. It is shown how to explicitly rewrite the system in the "normal form" , where and are {\em commuting} vector fields and the flow of is conjugate to that of the unperturbed . In Hamiltonian problems the normal form directly leads to the explicit construction of formal invariants of motion. Again, , and the invariants are written as series consisting of known vector-valued maps and universal scalar coefficients that may be found recursively.
Cite
@article{arxiv.1512.03601,
title = {Averaging and computing normal forms with word series algorithms},
author = {A. Murua and J. M. Sanz-Serna},
journal= {arXiv preprint arXiv:1512.03601},
year = {2017}
}