2020
DOI: 10.48550/arxiv.2006.05250
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

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

Wei Guo,
Juntao Huang,
Zhanjing Tao
et al.

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. Ada… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 39 publications
0
3
0
Order By: Relevance
“…Specifically, the second derivative term u xx is treated implicitly to avoid the severe CFL time constraint, while the nonlinear source f (|u| 2 )u is treated explicitly for efficiency. The adaptive procedure follows the technique developed in [20,21] to determine the space V that evolves dynamically over time.…”
Section: In Order To Efficiently Calculate the Nonlinear Termmentioning
confidence: 99%
See 2 more Smart Citations
“…Specifically, the second derivative term u xx is treated implicitly to avoid the severe CFL time constraint, while the nonlinear source f (|u| 2 )u is treated explicitly for efficiency. The adaptive procedure follows the technique developed in [20,21] to determine the space V that evolves dynamically over time.…”
Section: In Order To Efficiently Calculate the Nonlinear Termmentioning
confidence: 99%
“…It is also related to the adaptive mesh refinement (AMR) technique [2,4], which adjusts the computational grid adaptively to track small scale features of the underlying problems and improves computational efficiency. As a continuation of our previous research for adaptive multiresolution (also called adaptive sparse grid) DG methods [19,21,22,20], this paper develops an adaptive multiresolution ultra-weak DG solver for NLS equations (1.1) and the coupled NLS equations. First, the Alperts multiwavelets are employed as the DG bases in the weak formulation, and then the interpolatory multiwavelets are introduced for efficiently computing nonlinear source which has been successfully applied to nonlinear hyperbolic conservation laws [21] and Hamilton-Jacobi equations [20].…”
Section: Introductionmentioning
confidence: 98%
See 1 more Smart Citation