Rate of convergence for numerical -dissipative solutions of the Hunter-Saxton equation
arXiv:2411.07712 · doi:10.1007/s00211-025-01482-7
Abstract
We prove that -dissipative solutions to the Cauchy problem of the Hunter-Saxton equation, where , can be computed numerically with order in , provided there exist constants and such that the initial spatial derivative satisfies for all . The derived convergence rate is exemplified by a number of numerical experiments.
arXiv comment45 pages, 10 figures; Corrected some typos. An additional example and some more detailed calculations than the article
References in corpus (5)
- Global conservative solutions of the Camassa-Holm equation for initial data nonvanishing asymptotics
- Existence and Lipschitz stability for -dissipative solutions of the two-component Hunter-Saxton system
- Numerical conservative solutions of the Hunter--Saxton equation
- A Convergent Numerical Algorithm for -Dissipative Solutions of the Hunter-Saxton Equation
- A Lipschitz metric for -dissipative solutions to the Hunter-Saxton equation