English

Taylor-Fourier approximation

Numerical Analysis 2025-02-13 v2 Numerical Analysis

Abstract

In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as non-autonomous systems with a (2π/ω)(2\pi/\omega)-periodic dependence on tt. The proposed approximate solutions are given in closed form as functions X(ωt,t)X(\omega t,t), where X(θ,t)X(\theta,t) is (i) a truncated Fourier series in θ\theta for fixed tt and (ii) a truncated Taylor series in tt for fixed θ\theta, which motivates the name of the method. These approximations are uniformly accurate in ω\omega, meaning that their accuracy does not degrade as ω\omega \to \infty. In addition, Taylor-Fourier approximations enable the computation of high-order averaging equations for the original semi-linear system, as well as related maps that are particularly useful in the highly oscillatory regime (i.e., for sufficiently large ω\omega). The main goal of this paper is to develop an efficient procedure for computing such approximations by combining truncated power series arithmetic with the Fast Fourier Transform (FFT). We present numerical experiments that illustrate the effectiveness of the proposed method, including applications to the nonlinear Schr\"odinger equation with non-smooth initial data and a perturbed Kepler problem from satellite orbit dynamics.

Keywords

Cite

@article{arxiv.2406.03124,
  title  = {Taylor-Fourier approximation},
  author = {M. P. Calvo and J. Makazaga and A. Murua},
  journal= {arXiv preprint arXiv:2406.03124},
  year   = {2025}
}
R2 v1 2026-06-28T16:54:18.332Z