English

Averaging and computing normal forms with word series algorithms

Dynamical Systems 2017-02-09 v2 Classical Analysis and ODEs Numerical Analysis

Abstract

In the first part of the present work we consider periodically or quasiperiodically forced systems of the form (d/dt)x=ϵf(x,tω)(d/dt)x = \epsilon f(x,t \omega ), where ϵ1\epsilon\ll 1, ωRd\omega\in\mathbb{R}^d is a nonresonant vector of frequencies and f(x,θ)f(x,\theta) is 2π2\pi-periodic in each of the dd components of θ\theta (i.e.\ θTd\theta\in\mathbb{T}^d). We describe in detail a technique for explicitly finding a change of variables x=u(X,θ;ϵ)x = u(X,\theta;\epsilon) and an (autonomous) averaged system (d/dt)X=ϵF(X;ϵ)(d/dt) X = \epsilon F(X;\epsilon) 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 x(t)=u(X(t),tω;ϵ)x(t) = u(X(t),t\omega;\epsilon). Here uu and FF 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 ff 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 ff under consideration. In the second part of the contribution, we study problems of the form (d/dt)x=g(x)+f(x)(d/dt) x = g(x)+f(x), where one knows how to integrate the "unperturbed" problem (d/dt)x=g(x)(d/dt)x = g(x) and ff is a perturbation satisfying appropriate hypotheses. It is shown how to explicitly rewrite the system in the "normal form" (d/dt)x=gˉ(x)+fˉ(x)(d/dt) x = \bar g(x)+\bar f(x), where gˉ\bar g and fˉ\bar f are {\em commuting} vector fields and the flow of (d/dt)x=gˉ(x)(d/dt) x = \bar g(x) is conjugate to that of the unperturbed (d/dt)x=g(x)(d/dt)x = g(x). In Hamiltonian problems the normal form directly leads to the explicit construction of formal invariants of motion. Again, gˉ\bar g, fˉ\bar f and the invariants are written as series consisting of known vector-valued maps and universal scalar coefficients that may be found recursively.

Keywords

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}
}
R2 v1 2026-06-22T12:07:12.801Z