2009
DOI: 10.1137/080743019
|View full text |Cite
|
Sign up to set email alerts
|

Homogenization of Metric Hamilton–Jacobi Equations

Abstract: Abstract. In this work we provide a novel approach to homogenization for a class of static Hamilton-Jacobi (HJ) equations, which we call metric HJ equations. We relate the solutions of the HJ equations to the distance function in a corresponding Riemannian or Finslerian metric. The metric approach allows us to conclude that the homogenized equation also induces a metric. The advantage of the method is that we can solve just one auxiliary equation to recover the homogenized HamiltonianH(p). This is significant … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
41
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 32 publications
(41 citation statements)
references
References 19 publications
0
41
0
Order By: Relevance
“…and the algorithm continues to produce a minimizer. Periodic homogenization has been well studied, and there are many algorithms to produce the effective Hamiltonian; see, for example, [18] or [36]. Our contribution here is that the algorithm works even if .0; ; !/ takes an uncountable number of values; i.e., the period is infinite.…”
Section: Define the Setsmentioning
confidence: 99%
See 1 more Smart Citation
“…and the algorithm continues to produce a minimizer. Periodic homogenization has been well studied, and there are many algorithms to produce the effective Hamiltonian; see, for example, [18] or [36]. Our contribution here is that the algorithm works even if .0; ; !/ takes an uncountable number of values; i.e., the period is infinite.…”
Section: Define the Setsmentioning
confidence: 99%
“…Periodicity only forces the additional constraint P(A i ) = 1/n, and except for this, the problem is nearly unchanged. Periodic homogenization has been well-studied and there are many algorithms to produce the effective Hamiltonian; see for example, Gomes and Oberman [17] or Oberman et al [31].…”
Section: Define the Setsmentioning
confidence: 99%
“…There are several approaches to reducing the computational cost of numerically solving Eikonal equations. For certain periodic functions r ǫ , one approach is homogenization [16,18]. The goal of homogenization is to derive an effective function, r, that accurately describes the effective properties of r ǫ in the solution.…”
mentioning
confidence: 99%
“…However, this essential Hamiltonian H E is not necessarily Lipschitz continuous, which is a significant difficulty. There are some works [5,19] dealing with the homogenization of metric Hamilton-Jacobi equations where the Hamiltonians are continuous and coercive. But when the Hamiltonians become discontinuous, this problem remains a difficult issue.…”
Section: {ϕ(X(t ) Y (T ))}mentioning
confidence: 99%
“…But when the Hamiltonians become discontinuous, this problem remains a difficult issue. In [19], an algorithm has been introduced to solve the piecewise-periodic problems numerically where the Hamiltonians are not continuous, but there is no general theoretical result for this method.…”
Section: {ϕ(X(t ) Y (T ))}mentioning
confidence: 99%