A numerical view on α-dissipative solutions of the Hunter-Saxton equation

Abstract

We propose a new numerical method for $\alpha$-dissipative solutions of the Hunter-Saxton equation, where $\alpha$ 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\ge 0$.

arXiv comment42 pages, 5 figures; Some minor changes to the text and corrected some typos

References in corpus (6)

• Existence and Lipschitz stability for $\alpha$-dissipative solutions of the two-component Hunter-Saxton system
• Numerical conservative solutions of the Hunter--Saxton equation
• Lipschitz Stability for the Hunter-Saxton Equation
• On the equivalence of Eulerian and Lagrangian variables for the two-component Camassa-Holm system
• A Convergent Numerical Algorithm for $\alpha$-Dissipative Solutions of the Hunter-Saxton Equation
• A Lipschitz metric for $\alpha$-dissipative solutions to the Hunter-Saxton equation