Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEssential forward weak KAM solution for the convex Hamilton-Jacobi equation
288
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
For a convex, coercive continuous Hamiltonian on a compact closed Riemannian manifold $M$, we construct a unique forward weak KAM solution of [ H(x, d_x u)=c(H) ] by a vanishing discount approach, where $c(H)$ is the Ma~ne critical value. We also discuss the dynamical significance of such a special solution.
rate research
Read More
We consider the following evolutionary Hamilton-Jacobi equation with initial condition: begin{equation*} begin{cases} partial_tu(x,t)+H(x,u(x,t),partial_xu(x,t))=0, u(x,0)=phi(x), end{cases} end{equation*} where $phi(x)in C(M,mathbb{R})$. Under some assumptions on the convexity of $H(x,u,p)$ with respect to $p$ and the Osgood growth of $H(x,u,p)$ with respect to $u$, we establish an implicitly variational principle and provide an intrinsic relation between viscosity solutions and certain minimal characteristics. Moreover, we obtain a representation formula of the viscosity solution of the evolutionary Hamilton-Jacobi equation.
In this paper we compute all the smooth solutions to the Hamilton-Jacobi equation associated with the horocycle flow. This can be seen as the Euler-Lagrange flow (restricted to the energy level set $E^{-1}(frac 12)$) defined by the Tonelli Lagrangian $L:Tmathbb Hrightarrow mathbb R$ given by (hyperbolic) kinetic energy plus the standard magnetic potential. The method we use is to look at Lagrangian graphs that are contained in the level set ${H=frac 12}$, where $H:T^*mathbb Hrightarrow mathbb R$ denotes the Hamiltonian dual to $L$.
In quantitative genetics, viscosity solutions of Hamilton-Jacobi equations appear naturally in the asymptotic limit of selection-mutation models when the population variance vanishes. They have to be solved together with an unknown function I(t) that arises as the counterpart of a non-negativity constraint on the solution at each time. Although the uniqueness of viscosity solutions is known for many variants of Hamilton-Jacobi equations, the uniqueness for this particular type of constrained problem was not resolved, except in a few particular cases. Here, we provide a general answer to the uniqueness problem, based on three main assumptions: convexity of the Hamiltonian function H(I, x, p) with respect to p, monotonicity of H with respect to I, and BV regularity of I(t).
The well known phenomenon of exponential contraction for solutions to the viscous Hamilton-Jacobi equation in the space-periodic setting is based on the Markov mechanism. However, the corresponding Lyapunov exponent $lambda( u)$ characterizing the exponential rate of contraction depends on the viscosity $ u$. The Markov mechanism provides only a lower bound for $lambda( u)$ which vanishes in the limit $ u to 0$. At the same time, in the inviscid case $ u=0$ one also has exponential contraction based on a completely different dynamical mechanism. This mechanism is based on hyperbolicity of action-minimizing orbits for the related Lagrangian variational problem. In this paper we consider the discrete time case (kicked forcing), and establish a uniform lower bound for $lambda( u)$ which is valid for all $ ugeq 0$. The proof is based on a nontrivial interplay between the dynamical and Markov mechanisms for exponential contraction. We combine PDE methods with the ideas from the Weak KAM theory.
For the discounted Hamilton-Jacobi equation,$$lambda u+H(x,d_x u)=0, x in M, $$we construct $C^{1,1}$ subsolutions which are indeed solutions on the projected Aubry set. The smoothness of such subsolutions can be improved under additional hyperbolicity assumptions. As applications, we can use such subsolutions to identify the maximal global attractor of the associated conformally symplectic flow and to control the convergent speed of the Lax-Oleinik semigroups
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
