arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2109.13587math.AP
收藏

网络上的Lax–Oleinik公式

Lax--Oleinik formula on networks

Marco Pozza, Antonio Siconolfi

AI总结:

该研究将Lax-Oleinik公式从单顶点交汇点推广到一般几何网络的时变Hamilton-Jacobi方程,通过定义合适的作用泛函证明极小化子的存在性与Lipschitz连续性,得到依赖初值和顶点通量限制子的唯一解表示公式。

摘要:

我们针对定义在几何结构相当一般的网络上的时变Hamilton-Jacobi方程,在关于Hamilton量的标准假设下,给出了一类Lax-Oleinik型表示公式。该公式依赖于t=0时刻给定的初值以及顶点处的通量限制子,二者都必须被指定才能使问题存在唯一解。此前同方向的研究结果仅针对交汇点(即仅含单个顶点的网络)的情形。得到该结果的一个关键步骤是定义合适的作用泛函,并证明在给定时间内网络的两个固定点之间的极小化子的存在性以及Lipschitz连续性,尽管被积函数在顶点处缺乏凸性。

英文摘要:

We provide a Lax-Oleinik-type representation formula for solutions of time-dependent Hamilton-Jacobi equations, posed on a network with a rather general geometry, under standard assumptions on the Hamiltonians. It depends on a given initial datum at $t=0$ and a flux limiter at the vertices, which both have to be assigned in order the problem to be uniquely solved. Previous results in the same direction are solely in the frame of junction, namely network with a single vertex. An important step to get the result is to define a suitable action functional and prove existence as well as Lipschitz-continuity of minimizers between two fixed points of the network in a given time, despite the fact that the integrand lacks convexity at the vertices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑