Table of Contents
Fetching ...

Derivation of resonance-based schemes via normal forms

Yvain Bruned

TL;DR

The article develops a systematic derivation of resonance-based numerical schemes for dispersive PDEs by marrying Poincaré-Dulac normal form ideas with combinatorial Hopf-algebraic tools. It encodes oscillatory integrals from Duhamel expansions using Fourier decorated trees, an arborification map, and a forest formula derived from a Butcher-Connes-Kreimer coproduct to produce explicit, low-regularity schemes with provable local error bounds. The core innovation is the dominant/low phase splitting and a Taylor-expansion strategy applied to iterated integrals, enabling explicit coefficient formulas and a robust discretisation framework. Under a mild Assumption 1, these normal-form schemes are expected to share the local error behavior of prior low-regularity methods, bridging normal forms and resonance-based discretisations with explicit algebraic structure.

Abstract

In this work, we propose a systematic derivation of resonance-based schemes via normal forms. The main idea is to use an arborification map on decorated trees together with a Butcher-Connes-Kreimer type coproduct and lower-dominant parts decompositions of the Fourier operator coming from the nonlinear interactions. This new family of low regularity schemes has explicit formulae for its coefficients and its local error. Under a mild assumption, one could expect these schemes to have a similar local error as the low regularity schemes proposed in arXiv:2005.01649.

Derivation of resonance-based schemes via normal forms

TL;DR

The article develops a systematic derivation of resonance-based numerical schemes for dispersive PDEs by marrying Poincaré-Dulac normal form ideas with combinatorial Hopf-algebraic tools. It encodes oscillatory integrals from Duhamel expansions using Fourier decorated trees, an arborification map, and a forest formula derived from a Butcher-Connes-Kreimer coproduct to produce explicit, low-regularity schemes with provable local error bounds. The core innovation is the dominant/low phase splitting and a Taylor-expansion strategy applied to iterated integrals, enabling explicit coefficient formulas and a robust discretisation framework. Under a mild Assumption 1, these normal-form schemes are expected to share the local error behavior of prior low-regularity methods, bridging normal forms and resonance-based discretisations with explicit algebraic structure.

Abstract

In this work, we propose a systematic derivation of resonance-based schemes via normal forms. The main idea is to use an arborification map on decorated trees together with a Butcher-Connes-Kreimer type coproduct and lower-dominant parts decompositions of the Fourier operator coming from the nonlinear interactions. This new family of low regularity schemes has explicit formulae for its coefficients and its local error. Under a mild assumption, one could expect these schemes to have a similar local error as the low regularity schemes proposed in arXiv:2005.01649.

Paper Structure

This paper contains 5 sections, 10 theorems, 134 equations.

Key Result

Proposition 2.2

The tree series given by is the $k$th Fourier coefficient of the solution of $(dis)$ up to order $r$ which means that one has

Theorems & Definitions (26)

  • Remark 1.1
  • Remark 1.2
  • Remark 1.3
  • Remark 1.4
  • Definition 2.1
  • Proposition 2.2
  • Proposition 3.1
  • Proposition 3.2
  • Proposition 4.1
  • Definition 5.1
  • ...and 16 more