Asymptotic analysis for Hamilton-Jacobi equations with large drift term
Taiga Kumagai

TL;DR
This paper studies the asymptotic behavior of solutions to Hamilton-Jacobi equations with large drift terms, showing convergence to solutions of ODE systems on a graph, even with degenerate critical points.
Contribution
It generalizes previous results to Hamiltonians with degenerate critical points, allowing for more complex graph structures in the limit.
Findings
Solutions converge to ODE systems on a graph as drift becomes large.
The limit graph can have multiple segments meeting at a node.
The analysis includes Hamiltonians with degenerate critical points.
Abstract
We investigate the asymptotic behavior of solutions of Hamilton-Jacobi equations with large drift term in an open subset of two-dimensional Euclidean space. When the drift is given by of a Hamiltonian , with , we establish the convergence, as , of solutions of the Hamilton-Jacobi equations and identify the limit of the solutions as the solution of systems of ordinary differential equations on a graph. This result generalizes the previous one obtained by the author to the case where the Hamiltonian admits a degenerate critical point and, as a consequence, the graph may have segments more than four at a node.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Modeling in Engineering · Mathematical Biology Tumor Growth · Nonlinear Partial Differential Equations
Asymptotic analysis for Hamilton-Jacobi equations with large drift term
Taiga Kumagai
Abstract
We investigate the asymptotic behavior of solutions of Hamilton-Jacobi equations with large drift term in an open subset of two-dimensional Euclidean space. When the drift is given by of a Hamiltonian , with , we establish the convergence, as , of solutions of the Hamilton-Jacobi equations and identify the limit of the solutions as the solution of systems of ordinary differential equations on a graph. This result generalizes the previous one obtained by the author to the case where the Hamiltonian admits a degenerate critical point and, as a consequence, the graph may have segments more than four at a node.
Key Words and Phrases. Singular perturbation, Hamilton-Jacobi equations, Large drift, Graphs.
2010 Mathematics Subject Classification Numbers. 35B40, 49L25.
1 Introduction
We consider the boundary value problem for the Hamilton-Jacobi equation
[TABLE]
and investigate the asymptotic behavior, as , of the solution to ().
In the above and henceforth, is a small positive parameter, is a positive constant, is an open subset of with boundary , and are given functions, is a given vector field, is the unknown, and and denote, respectively, the gradient of and the Euclidean inner product of . We give the vector field as a Hamilton vector field, that is, for a given Hamiltonian ,
[TABLE]
where the subscript indicates the differentiation with respect to the variable .
We are interested in the Hamiltonian flow with one degree of freedom
[TABLE]
and with its perturbed system
[TABLE]
where . Rescaling the time from to in (1.1), we obtain
[TABLE]
The first equation of () is the dynamic programming equation for the optimal control problem. As is well-known, the viscosity solution of () is identified with the value function of the optimal control problem, where the state equation, the discount factor, the pay-off at the exit time, and the running cost are given, respectively, by (1.2), , , and the function , defined by
[TABLE]
Thus, the investigation of the asymptotic behavior, as , of the solutions of () may be regarded in a broad sense as analyzing the behavior, as , of the solutions of (1.2), with “optimal” .
In a spirit similar to the above, but with a stochastic perturbation in place of a “perturbation by optimal control”, Freidlin and Wentzell in [FW] has initiated the study of a stochastic perturbation for (HS) and established a convergence theorem for the solutions of the linear second-order uniformly elliptic partial differential equation (pde, for short)
[TABLE]
with a continuous function on . Here, a similarity of the elliptic pde above to the pde in () is that and in () correspond, respectively, to and in (1.3). Regarding the stochastic perturbation, Ishii and Souganidis in [IS] has established a convergence theorem similar to that in [FW], by a pure pde-techniques, which covers a fairly general linear second-order degenerate elliptic pdes.
Motivated by the developments ([FW, IS]) in stochastic perturbations for (HS), the author in [K] has recently established a convergence result for Hamilton-Jacobi equations () by using viscosity solution techniques such as the perturbed test function method and representations of solutions as value functions in optimal control. A typical Hamiltonian studied in [FW, IS, K] is given by
[TABLE]
whose graph has the shape of the so-called double-well potential, and it has three non-degenerate critical points at , and . In this case, the limiting functions in the convergence results either in stochastic perturbation or in perturbation by optimal control are characterized by systems of odes on graphs with one node and three edges, where, roughly speaking, one of the edges corresponds to one of the potential wells, another to the other potential well and the last to a finite tube above the potential wells.
Our main contribution in this article is to prove a convergence theorem when the Hamiltonian has degenerate critical points. The result is stated as Theorem 2.5 below, where the graph on which the limit function is defined has one node and arbitrarily many edges depending on the Hamiltonian.
A simple example of such Hamiltonians is given by
[TABLE]
We emphasize that most work on stochastic perturbation of Hamiltonian flows has studied the case where Hamiltonian has only non-degenerate critical points.
Now, we mention that related problems have been considered in the context of Hamilton-Jacobi equations on networks or graphs. In particular, the convergence results of approximated solutions by fattening networks or graphs were established in [AT] for Hamilton-Jacobi equations in optimal control and in [LS] for non-convex Hamilton-Jacobi equations.
An interesting point of the result in [K] is that we have to treat a non-coercive Hamiltonian (that is, ) in (), while very few authors have studied Hamilton-Jacobi equation with non-coercive Hamiltonian on networks or graphs. This difficulty due to lack of coercivity is resolved by taking the advantage that the Hamiltonian in () is coercive in the direction orthogonal to . See [K] for details.
The graphs considered in Hamilton-Jacobi equations on networks or graphs, in general, have many number of segments at a node. However, in perturbation analysis of Hamiltonian flows as discussed above, when Hamiltonian has only non-degenerate critical points, the number of segments at a node of graph is at most “four” (see, for example, [F]) because, in this case, can be represented only by
[TABLE]
in a neighborhood of a saddle point, which is corresponding to a node on .
The argument in [K] depends heavily on the formula (1.4), which allows us to use an explicit formula of the solution of (HS) in a neighborhood of a saddle point. This is a main crucial point to establish our convergence theorem since it is impossible to find a convenient explicit formula of solutions of (HS) for general Hamiltonian with degenerate critical points. The idea to overcome the difficulty above is to use geometric integral formulas for some quantities of the flow (HS) instead of solving (HS) explicitly.
This paper is organized as follows. In the next section, we first present the assumptions on Hamiltonian , typical examples of , and the domain . After these, we describe a basic existence and uniqueness proposition for () as well as the assumptions on the function throughout this paper, and we finally state the main result (see Theorem 2.5). In Section 3 divided into two parts, we study some properties of functions in the odes in the limiting problem and subsolutions to the odes. Section 4 is devoted to the proof of Theorem 2.5 along the argument in [K]. In Section 5, we present a sufficient condition, similar to that in [K], on the boundary data for the odes on the graph for which (G5) and (G6) hold.
Finally, we give a few of our notations.
Notation
For , we denote by the open disc centered at the origin with radius . For , we write .
2 Preliminaries and Main result
2.1 The Hamiltonian
Let . We assume the following assumptions on the Hamiltonian throughout this paper.
- (H1)
and .
- (H2)
has exactly critical points , with , and attains local minimum at and .
Here and henceforth, we write
[TABLE]
For example, in the case where , the graph of the Hamiltonian satisfying (H1) and (H2) is shaped like Fig. 2 below.
The number in (H2) coincides with number of segments at a node of a graph arising in the limiting process.
To simplify the notation, we assume without loss of generality that
[TABLE]
We remark that, under assumptions (H1) and (H2), in the case where , the origin is just a degenerate critical point of the Hamiltonian , while, in the case where , it may be a non-degenerate one.
- (H3)
There exist constants and , and a neighborhood of the origin such that, for any ,
[TABLE]
We note that assumption (H3) implies, by replacing by a larger number if necessary, that
[TABLE]
and
[TABLE]
- (H4)
There exist constants such that and
[TABLE]
Combining (H4) with (2.1), we see that , and with (2.2), we get the relation
[TABLE]
for some .
The following examples show that conditions (H3) and (H4) are satisfied for wide range of Hamiltonians .
Example 2.1**.**
Consider two Hamiltonians
[TABLE]
It is obvious that and satisfy (H1). By simple computations, we see that and satisfy (H3) and (H4) with, respectively, and . Both of the number of critical points are three, which consists of the origin; a saddle point, and, respectively, and ; local minimum points. That is, (H2) holds with . The origin is a degenerate critical point of , while it is a non-degenerate one of . The graphs of and are shaped like Fig. 1. **
Example 2.2**.**
Next, consider the Hamiltonian
[TABLE]
It is easy to check that satisfies (H1)–(H4) with and . The critical points of are the origin; a degenerate saddle point, and , , and ; local minimum points. The graph of is shaped like Fig. 2. To understand the shape of well, we remark that can be represented in polar coordinates by
[TABLE]
that is, the zero-level set of is the curve expressed by . Indeed, if , where denotes the imaginary unit, then
[TABLE]
Example 2.3**.**
More generally, the Hamiltonian
[TABLE]
satisfies (H1)–(H4) with provided . Here denotes the largest integer less than or equal to . Similarly to in Example 2.2, we see that the zero-level set of is the curve expressed by through the representation in polar coordinates by
[TABLE]
where
[TABLE]
The critical points of are the origin and
[TABLE]
which are, respectively, corresponding to a saddle point and local minimum points of . **
2.2 The domain
Under assumptions (H1) and (H2), for any , the open set is connected, and the open set consists of connected components such that .
We choose the real numbers
[TABLE]
and set the intervals
[TABLE]
We put the open sets
[TABLE]
and their “outer” boundaries
[TABLE]
Finally, we introduce as the open connected set
[TABLE]
with the boundary
[TABLE]
For example, the shapes of corresponding to in Figs. 1 and 2 are, respectively, depicted in Figs. 3 and 4.
By (H1), the initial value problem (HS) admits a unique global in time solution such that
[TABLE]
As is well known, is a first integral for the system (HS), that is,
[TABLE]
For and , we define the loops by
[TABLE]
If we identify all points belonging to a loop , we obtain a graph consisting of segments parametrized by . For example, the graph corresponding to in Fig. 4 is shown in Fig. 5.
It is not hard to check the following facts: if and , then, for any , the map is periodic and
[TABLE]
If , then, for any ,
[TABLE]
and
[TABLE]
Moreover,
[TABLE]
and
[TABLE]
2.3 The Hamilton-Jacobi equation
We put the following assumptions (G1)–(G5) on and throughout this paper.
- (G1)
.
- (G2)
There exists a modulus such that
[TABLE]
- (G3)
For each , the function is convex on .
- (G4)
is coercive, that is,
[TABLE]
Assumption (G2) is a standard requirement to that the comparison principle should hold for (). Under assumptions (G1), (G3), and (G4), there exist such that
[TABLE]
The following condition has the same role as compatibility conditions described in [L], which are used to ensure the continuity up to boundary of the value functions in optimal control. That is, it guarantees the continuity up to the boundary of the function of the form (2.5) below and, hence, gives us the uniqueness of viscosity solutions of (). In what follows, we write for the solution to (1.2).
- (G5)
There exists such that the family is uniformly bounded on and that, for any ,
[TABLE]
for all , , and , where the conditions
[TABLE]
are satisfied, that is, is a visiting time at of the trajectory constrained in .
We state here a basic existence and uniqueness proposition for ().
Proposition 2.4**.**
For , we define the function by
[TABLE]
where is a visiting time in of constrained in , that is, is a nonnegative number such that
[TABLE]
Then is the unique viscosity solution of () and continuous on , and satisfies on . Furthermore the family is uniformly bounded on .
Noting that (2.1) implies, in particular, that for all , we can prove this proposition along the same lines as the proof of [K, Proposition 2.3], so we skip it here.
Thanks to this proposition, we may define hereafter by (2.5). Since the family is uniformly bounded on , the half relaxed-limits, as , of
[TABLE]
are well-defined and bounded on .
If for some , a boundary layer happens in the limiting process of sending . In order that any boundary layer does not occur, in addition to (G1)–(G5), we henceforth assume the following.
- (G6)
There exist constants such that for all and .
It is obvious that this leads to
[TABLE]
Our asymptotic analysis of () is based on rather implicit (or ad hoc) assumptions (G5) and (G6), which are indeed convenient for our arguments below. However, it is not clear which and satisfy (G5) and (G6). Thus, it is important to know when (G5) and (G6) hold. In [K], for , the author gave a fairly general sufficient condition on the data , for which (G5) and (G6) hold. In Section 5, for more general , we will present a similar condition to that in [K].
2.4 Main result
We introduce some notation which are needed to state our main result.
For and , let denote the length of , that is,
[TABLE]
Here denotes the line element. Obviously, are positive and bounded.
Recall that, if and , then the map is periodic for any . Note that the minimal periods are independent of choice of . Hence, we can write for the minimal period of the trajectory of the system (HS) on . Noting that , the minimal period has the form
[TABLE]
which shows, in view of (H2), that
[TABLE]
For , define the function by
[TABLE]
where is fixed arbitrarily. We note here that the second formula above reveals that is the mean value of the function along the curve on the loop .
We then state our main result.
Theorem 2.5**.**
There exist viscosity solutions , with , of
[TABLE]
such that , , and, as ,
[TABLE]
That is, if we define by
[TABLE]
then, as ,
[TABLE]
We will give the proof of this theorem in Section 4.
3 The limiting problem
3.1 The minimal periods and the length
In this subsection, we show an integrability of and behavior of near the origin without any explicit formula of , which is a crucial difference from [K].
For this, we need the following lemma, which we refer to [FW, Lemma 1.1, Section 8].
Lemma 3.1**.**
Let and be such that . Set . If , then
[TABLE]
and, moreover, for any ,
[TABLE]
Lemma 3.2**.**
For all , .
Proof.
Together with (2.6) and (2.7), Lemma 3.1, with and with , yields respectively
[TABLE]
and
[TABLE]
where and denote the Hessian matrix of and the matrix for , respectively, which imply that . ∎
The behavior of near is the subject of
Lemma 3.3**.**
For all , as .
Here, and are the constants from, respectively, (H3) and (H4). We henceforth write for the length of a given curve .
Proof.
Fix any and . Choose so that . By replacing if necessary so that is small enough, we may assume that .
Set . By (2.3), we compute that
[TABLE]
from which we conclude that as . ∎
We remark that since , this lemma assures that
[TABLE]
This integrability ensures the continuity of solutions of () up to (See Lemma 3.7).
Lemma 3.4**.**
Let be a constant such that . Then, there exists a constant , independent of , such that, for any ,
[TABLE]
Proof.
Fix any , , and . If , then . So, we assume henceforth that and, for the time being, that .
Set and . Let . Green’s theorem yields
[TABLE]
where is the outer normal vector on . Note that and that on and on .
Now, setting , we have
[TABLE]
Here, we have
[TABLE]
On the other hand, we compute that
[TABLE]
where denotes the identity matrix of size two and is defined by
[TABLE]
Since , by (H3), we have
[TABLE]
and, hence, by (H4),
[TABLE]
Since , from the inequality above, we get
[TABLE]
Now, (3.2)–(3.4) together yield
[TABLE]
Here, we have used the fact that . Arguments for the other parallel the above. The proof is complete. ∎
3.2 The Hamiltonians in ()
We state here some properties of the functions .
Lemma 3.5**.**
For any , , and
[TABLE]
that is, is locally coercive in the sense that, for any compact interval of ,
[TABLE]
Here, and are the constants from (2.4).
Proof.
Combining the definition of with Lemma 3.2 yields the continuity of , and with (2.4) yields (3.5). ∎
Lemma 3.6**.**
We have
[TABLE]
Proof.
Fix any . We begin by noting that, due to the continuity and the coercivity of , there exist such that for all and
[TABLE]
for all . Combining this with (H4) yields
[TABLE]
for all , and
[TABLE]
for some .
Fix any and . Using (3.8), we get
[TABLE]
Fix any and set
[TABLE]
where is the constant from (H4). If , then, by (H4),
[TABLE]
that is, . Hence, we have
[TABLE]
Choose and so that and that if , then
[TABLE]
If and , then , and, hence, by Lemma 3.4, there exists a constant , independent of , such that
[TABLE]
Using (3.7) if and, otherwise, combining (3.7) with (3.10) and (3.11), we can compute, as the proof of [K, Lemma 6.5], that
[TABLE]
while (3.9) yields
[TABLE]
These two together complete the proof. ∎
3.3 Properties of viscosity subsolutions of ()
For , let (resp., or ) be the set of all viscosity subsolutions (resp., viscosity supersolutions or viscosity solutions ) of ().
Lemma 3.7**.**
Let and . Then is uniformly continuous in , and, hence, it can be extended uniquely to as a continuous function on .
Proof.
The proof is along the same lines as that of [K, Lemma 3.2]. By (3.5), we have
[TABLE]
in the viscosity sense and, hence, in the almost everywhere sense. Gronwall’s inequality yields, for any ,
[TABLE]
Recalling that , inequality (3.14) shows a boundedness of in and, moreover,
[TABLE]
yields the uniformly continuity of in . ∎
Thanks to this lemma, we may assume that any is a function in . To make this notationally explicit, we write for . This also applies to since .
The following two lemmas are direct consequences of, respectively, (3.15) and (3.14).
Lemma 3.8**.**
Let and . Assume that is uniformly bounded on . Then is equi-continuous on .
Lemma 3.9**.**
Let and . Then there exists a constant , independent of , such that
[TABLE]
Lemma 3.10**.**
Let and . Then, we have .
Proof.
Fix . Since , we have
[TABLE]
Using Lemma 3.6, we conclude that . ∎
Lemma 3.11**.**
Let and . Set and
[TABLE]
Then there exists such that
[TABLE]
The proof of this lemma is along the same lines as that of [K, Lemma 6.8] with help of formula (3.12) and Lemma 3.10, so we omit giving it here.
An important remark on is that if , then for any constant . From this remark, the sets of all satisfying are non-empty, and, hence, by Lemmas 3.8 and 3.9, these are uniformly bounded and equi-continuous on . The functions are thus well-defined as continuous functions on and, according to Perron’s method, these are solutions of ().
4 Proof of Theorem 2.5
Note that the stability of viscosity solutions yields
[TABLE]
in the viscosity sense, which show that and are, respectively, nondecreasing and nonincreasing along the trajectory , and, hence, they are constant on the loop , .
The relations
[TABLE]
define functions in . It is easy to check that and are, respectively, upper and lower semicontinuous in .
Theorem 4.1**.**
For all , and .
We can prove this theorem by using the same perturbed test function as that of [K, Theorem 3.6], so we skip the proof.
Thanks to this theorem and Lemma 3.7, we may assume that for all . Moreover, by (G6), we have
[TABLE]
In view of Theorem 4.1 and (4.1), to prove Theorem 2.5, it is enough to show that
[TABLE]
for some . Indeed, if (4.2) is satisfied, by the semicontinuity of , we have
[TABLE]
Thus, by the comparison principle applied to (), we see that in for all . Hence, setting on , we find that , , and . Thus, we have on . Furthermore, by the definition of the half-relaxed limits and (4.2), we have
[TABLE]
from which we conclude that, as ,
[TABLE]
The proof of (4.2) can be done as an obvious combination of the two lemmas below.
Lemma 4.2**.**
Set . Then
[TABLE]
Lemma 4.3**.**
Set . Then
[TABLE]
In order to prove these lemmas, we need Lemmas 4.4 and 4.5 below.
To state Lemmas 4.4 and 4.5, we set and, for , define the neighborhood of the curve by
[TABLE]
Lemma 4.4**.**
For any , there exist and such that
[TABLE]
Proof.
Fix any . Set the function by . Note that, for any neighborhood of , there is such that .
We fix for each . Choose so that and
[TABLE]
Choose so that
[TABLE]
Also, we choose so that
[TABLE]
and
[TABLE]
For , let be the solution of the problem
[TABLE]
and note that
[TABLE]
We write for and . For and , we set
[TABLE]
Note that the sets
[TABLE]
with , are mutually disjoint, and we choose so that , with , are mutually disjoint.
Moreover, we may assume that
[TABLE]
[TABLE]
and
[TABLE]
For , set
[TABLE]
and note that . Also, for , set
[TABLE]
and
[TABLE]
Note that
[TABLE]
Let be a standard mollification kernel, with . For , set
[TABLE]
and
[TABLE]
Note that
[TABLE]
[TABLE]
and
[TABLE]
Note also that ,
[TABLE]
and
[TABLE]
We show that is a diffeomorphism. Obviously, by the definition of , is a mapping and surjective. To see that is injective, let be such that . Note that
[TABLE]
If , we see by the standard ode theory that . If , then or . The latter case is impossible since and . Thus, we have and conclude that is bijective. We write for and note that
[TABLE]
Differentiating yields
[TABLE]
This combined with (4.4) reveals
[TABLE]
The Inverse Function Theorem guarantees that is a diffeomorphism.
Note that the Inverse Function Theorem implies that is a neighborhood of . Since
[TABLE]
it follows that the set is a neighborhood of and, hence,
[TABLE]
is a neighborhood of . Thus, we may choose so that
[TABLE]
Set
[TABLE]
It is clear that . We define by
[TABLE]
Since , with , are mutually disjoint, the function is well-defined.
Let . If
[TABLE]
then in a neighborhood (e.g. ) of , , and
[TABLE]
Otherwise, we have
[TABLE]
Choose so that and set . Since , we see that . If , then there exists a neighborhood of such that
[TABLE]
and
[TABLE]
Since in , we see that in , and, hence, we get (4.5). If , then is of class in a neighborhood (e.g. ) of and
[TABLE]
Writing and differentiating the above, we get
[TABLE]
and
[TABLE]
This concludes the proof. ∎
Proof of Lemma 4.2.
We argue by contradiction. Thus, set and suppose that . Using Lemmas 3.11 and 4.4 and arguing as in the proof of [K, Lemma 3.8], we obtain a contradiction. ∎
Here, we note that the initial value problems
[TABLE]
where is the constant from (2.4), admit unique solutions in the maximal interval where , and the maximality means that either
[TABLE]
and either
[TABLE]
Lemma 4.5**.**
Let , , and . If are such that and for all , then
[TABLE]
Also inequality (4.5) holds with , , and being replaced by , , and .
Here, is the constant from (2.3).
Proof.
We can prove this lemma by using (2.3) and replacing the function in [K, Lemma 5.1] by for . ∎
Proof of Lemma 4.3.
We obtain (4.3) by using (2.4) and Lemma 4.5 as well as the dynamic programming principle as in the proof of [K, Lemma 3.7]. ∎
5 The boundary data for the limiting problem
In this section, we present a sufficient condition on the data for which (G5) and (G6) hold.
Here, we only state the theorems concerning the sufficient condition and refer to [K, Section 7] for the proofs.
For , we write for the set of such that the set
[TABLE]
is nonempty.
We note that for some . Indeed, in view of the remark after Lemma 3.11, if and , then . Also, if satisfies
[TABLE]
then and , while if satisfies
[TABLE]
then . Thus, we see that .
For , , and , we define
[TABLE]
and, we have and . By Lemma 3.9, we see that
[TABLE]
Also, we write for the set of such that
[TABLE]
and, for , , and , we define
[TABLE]
Similarly to the above, we see that and that and .
Theorem 5.1**.**
Let . The problem
[TABLE]
has a viscosity solution if and only if
[TABLE]
Here, we set
[TABLE]
and
[TABLE]
The following theorem gives a sufficient condition for which (G5) and (G6) hold.
Theorem 5.2**.**
For any , (G5) and (G6) hold for some boundary data .
Acknowledgments
The author would like to thank Prof. Hitoshi Ishii for many helpful comments and discussions about the asymptotic problem for Hamilton-Jacobi equations treated here.
Funding
The research has been supported by a Waseda University Grand for Special Research Projects: 2017S-070.
References
(T. Kumagai) Department of Mathematics, Faculty of Education and Integrated Arts and Sciences, Waseda University, 1-6-1 Nishi-Waseda, Shinjuku-ku, Tokyo, 169-8050, Japan
E-mail: [email protected]
