通过 $p$-平均的博弈 $p$-Laplacian 的半拉格朗日格式
A semi-Lagrangian scheme for the game $p$-Laplacian via $p$-averaging
AI总结:
针对二维博弈 $p$-Laplacian,提出并分析了一种基于 $p$-平均的半拉格朗日逼近格式,证明了其在特定情况下收敛到粘性解,并通过数值实验验证了精度。
摘要:
我们在粘性解框架下提出并分析了一种二维博弈 $p$-Laplacian 的逼近格式。该逼近基于半拉格朗日格式,利用了 $p$-平均的思想。我们研究了该格式的性质,并证明了它在特定情况下收敛到博弈 $p$-Laplacian 的粘性解。我们还针对不同的 $p$ 值给出了该格式的数值实现;数值测试表明该格式是精确的。
英文摘要:
We present and analyze an approximation scheme for the two-dimensional game $p$-Laplacian in the framework of viscosity solutions. The approximation is based on a semi-Lagrangian scheme which exploits the idea of $p$-averages. We study the properties of the scheme and prove that it converges, in particular cases, to the viscosity solution of the game $p$-Laplacian. We also present a numerical implementation of the scheme for different values of $p$; the numerical tests show that the scheme is accurate.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。