A numerical view on α-dissipative solutions of the Hunter-Saxton equation
Thomas Christiansen, Katrin Grunert
TL;DR
The paper advances numerical treatment of α-dissipative Hunter–Saxton solutions by integrating a projection-based Lagrangian discretization with a generalized method of characteristics and an energy-removal iteration; a nonuniform, finite sequence of breaking times {τ_k^*} is extracted to manage clustered wave-breaking events and minimize unnecessary recomputation. It provides a rigorous convergence theory: convergence of the projected initial data, convergence of the Lagrangian solution X_{Δx}(t) to X(t) for all t in [0,T], and, via the M-map, convergence of the Eulerian solution (u_{Δx}, μ_{Δx}, ν_{Δx}) to (u, μ, ν). The numerical results on multipeakon and cusp-like data illustrate substantial computational gains from the minimal-time stepping and confirm accurate capture of wave breaking and energy dissipation across α ∈ [0,1). The framework thus offers a robust, convergent, and efficient approach for simulating α-dissipative HS dynamics in both theoretical and applied contexts.
Abstract
We propose a new numerical method for $α$-dissipative solutions of the Hunter-Saxton equation, where $α$ belongs to $W^{1, \infty}(\mathbb{R}, [0, 1))$. The method combines a projection operator with a generalized method of characteristics and an iteration scheme, which is based on enforcing minimal time steps whenever breaking times cluster. Numerical examples illustrate that these minimal time steps increase the efficiency of the algorithm substantially. Moreover, convergence of the wave profile is shown in $C([0, T], L^{\infty}(\mathbb{R}))$ for any finite $T \geq 0$.
