Numerical viscosity solutions to Hamilton-Jacobi equations via a Carleman estimate and the convexification method

by   Michael Klibanov, et al.

We propose a globally convergent numerical method, called the convexification, to numerically compute the viscosity solution to first-order Hamilton-Jacobi equations through the vanishing viscosity process where the viscosity parameter is a fixed small number. By convexification, we mean that we employ a suitable Carleman weight function to convexify the cost functional defined directly from the form of the Hamilton-Jacobi equation under consideration. The strict convexity of this functional is rigorously proved using a new Carleman estimate. We also prove that the unique minimizer of the this strictly convex functional can be reached by the gradient descent method. Moreover, we show that the minimizer well approximates the viscosity solution of the Hamilton-Jacobi equation as the noise contained in the boundary data tends to zero. Some interesting numerical illustrations are presented.



There are no comments yet.


page 17

page 18

page 20

page 21

page 22


Convexification-based globally convergent numerical method for a 1D coefficient inverse problem with experimental data

To compute the spatially distributed dielectric constant from the backsc...

A Carleman-based numerical method for quasilinear elliptic equations with over-determined boundary data and applications

We propose a new iterative scheme to compute the numerical solution to a...

Convexification for a 3D inverse scattering problem with the moving point source

For the first time, we develop in this paper the globally convergent con...

Axiomatic characterization of the χ^2 dissimilarity measure

We axiomatically characterize the χ^2 dissimilarity measure. To this end...

Dispersive shallow water wave modelling. Part II: Numerical simulation on a globally flat space

In this paper, we describe a numerical method to solve numerically the w...

Convexification for a 1D Hyperbolic Coefficient Inverse Problem with Single Measurement Data

A version of the convexification numerical method for a Coefficient Inve...

A continuation method for computing the multilinear Pagerank

The multilinear Pagerank model [Gleich, Lim and Yu, 2015] is a tensor-ba...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.