2021
DOI: 10.3233/asy-201599
|View full text |Cite
|
Sign up to set email alerts
|

Rate of convergence for periodic homogenization of convex Hamilton–Jacobi equations in one dimension

Abstract: In this paper we study the rate of convergence u ε −→ u as ε −→ 0 + in periodic homogenization of Hamilton-Jacobi equations. Here u ε and u are viscosity solutions to the oscillatory Hamilton-Jacobi equationand its effective equationrespectively. Assuming that the initial data u 0 is bounded and Lipschitz continuous, we provide a simple proof to get the optimal rate O(ε) for a class of Hamiltonians including the classical mechanics one with separable potentialwhere a(·) : R −→ (0, +∞) is continuously different… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 21 publications
0
8
0
Order By: Relevance
“…The main idea is to break γ 0 into N evenly spaced pieces with respect to time, where N needs to be determined appropriately. For each piece, we approximate its cost by fixing the first argument of L in (12). More precisely, for the kth piece where k = 0, 1, .…”
Section: Main Results and Proof Strategiesmentioning
confidence: 99%
See 1 more Smart Citation
“…The main idea is to break γ 0 into N evenly spaced pieces with respect to time, where N needs to be determined appropriately. For each piece, we approximate its cost by fixing the first argument of L in (12). More precisely, for the kth piece where k = 0, 1, .…”
Section: Main Results and Proof Strategiesmentioning
confidence: 99%
“…To our best knowledge, the most closely related previous research in this area is [12], where the approach in [8] was extended to attain the optimal rate of O(ϵ) in one dimension with further assumptions on H. In this study, we investigate this problem for dimensions n ⩾ 1 and prove that the convergence rate, in general, is O(t √ ϵ) for t ⩾ √ ϵ.…”
Section: Relevant Literaturementioning
confidence: 93%
“…To our best knowledge, the most closely related previous research in this area is [11], where the approach in [7] was extended to attain the optimal rate of O(ǫ) in one dimension with further assumptions on H. In this study, we investigate this problem for dimensions n ≥ 1 and prove that the convergence rate, in general, is O( √ ǫ) for t ≥ √ ǫ.…”
Section: Introductionmentioning
confidence: 94%
“…The argument in [3] can be easily adapted to (1.1) with α = 1 (see [20, Theorem 4.37]). We also refer to [10,18,22] for other development on this subject. In all works [4,10,15,18,21,22], the argument relies on the optimal control formula for u ε , and therefore it is seemingly rather challenging to obtain the optimal rate of convergence of (1.1) for 0 < α < 1, which remains completely open.…”
Section: Introductionmentioning
confidence: 99%