Numerical conservative solutions of the Hunter–Saxton equation

05/08/2020

∙

We derive a convergent (up to a subsequence) numerical method for conservative solutions of the Hunter–Saxton equation. The method is based on piecewise linear projections, followed by evolution along characteristics where the time step is chosen in order to prevent wave breaking. We find that the constraint Δ t ≤ C √(Δ x ) is sufficient, which is a milder restriction than the common CFL condition for conservation laws.

READ FULL TEXT

Numerical conservative solutions of the Hunter–Saxton equation

Conservative Physics-Informed Neural Networks for Non-Conservative Hyperbolic Conservation Laws Near Critical States

A new conservative discontinuous Galerkin method via implicit penalization for the generalized KdV equation

Lagrangian dual framework for conservative neural network solutions of kinetic equations

Conservative iterative methods for implicit discretizations of conservation laws

A numerical algorithm for α-dissipative solutions of the Hunter–Saxton equation

Fully Conservative Difference Schemes for the Rotation-Two-Component Camassa-Holm System with Smooth/Nonsmooth Initial Data

Locally conservative and flux consistent iterative methods

Numerical conservative solutions of the Hunter–Saxton equation

Related Research

Conservative Physics-Informed Neural Networks for Non-Conservative Hyperbolic Conservation Laws Near Critical States

A new conservative discontinuous Galerkin method via implicit penalization for the generalized KdV equation

Lagrangian dual framework for conservative neural network solutions of kinetic equations

Conservative iterative methods for implicit discretizations of conservation laws

A numerical algorithm for α-dissipative solutions of the Hunter–Saxton equation

Fully Conservative Difference Schemes for the Rotation-Two-Component Camassa-Holm System with Smooth/Nonsmooth Initial Data

Locally conservative and flux consistent iterative methods