Pith. sign in

REVIEW

An adaptive sparse grid local discontinuous Galerkin method for Hamilton-Jacobi equations in high dimensions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.05250 v1 pith:TQ52K5IE submitted 2020-05-29 math.NA cs.NA

An adaptive sparse grid local discontinuous Galerkin method for Hamilton-Jacobi equations in high dimensions

classification math.NA cs.NA
keywords dimensionsequationshighadaptivegridhamilton-jacobilocalmultiwavelets
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We are interested in numerically solving the Hamilton-Jacobi (HJ) equations, which arise in optimal control and many other applications. Oftentimes, such equations are posed in high dimensions, and this poses great numerical challenges. This work proposes a class of adaptive sparse grid (also called adaptive multiresolution) local discontinuous Galerkin (DG) methods for solving Hamilton-Jacobi equations in high dimensions. By using the sparse grid techniques, we can treat moderately high dimensional cases. Adaptivity is incorporated to capture kinks and other local structures of the solutions. Two classes of multiwavelets are used to achieve multiresolution, which are the orthonormal Alpert's multiwavelets and the interpolatory multiwavelets. Numerical tests in up to four dimensions are provided to validate the performance of the method.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.