A moment approach for entropy solutions to nonlinear hyperbolic PDEs
read the original abstract
We propose to solve polynomial hyperbolic partial differential equations (PDEs) with convex optimization. This approach is based on a very weak notion of solution of the nonlinear equation, namely the measure-valued (mv) solution, satisfying a linear equation in the space of Borel measures. The aim of this paper is, first, to provide the conditions that ensure the equivalence between the two formulations and, second, to introduce a method which approximates the infinite-dimensional linear problem by a hierarchy of convex, finite-dimensional, semidefinite programming problems. This result is then illustrated on the celebrated Burgers equation. We also compare our results with an existing numerical scheme, namely the Godunov scheme.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
The multidimensional truncated Moment Problem: Shape and Gaussian Mixture Reconstruction from Derivatives of Moments
Certain moment functionals on polynomials of degree 2d in n variables require at least binom(n+2d,n) - n*binom(n+d,n) + binom(n,2) Gaussians for representation but can be done with at most binom(n+2d,n)-1.
-
Duality of convex relaxations for constrained variational problems
Proves weak and strong duality between function-space and measure-space convex relaxations of constrained variational problems, establishing their equivalence for SDP hierarchy computations when data are polynomial.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.