arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2512.12752math.NAcs.NAmath.AP
收藏

牛顿方法用于均场博弈:数值研究

Newton Methods for Mean Field Games: A Numerical Study

Dipartimento di Matematica Guido Castelnuovo, Sapienza Università di Roma(罗马大学圭多·卡斯特卢诺瓦数学系);Faculty of Mathematics, University of Vienna(维也纳大学数学系)

Elisabetta Carlini, Ahmad Zorkot

AI总结:

本文研究了第二类均场博弈问题的数值解法,提出新的有限差分和半拉格朗日方案,验证了牛顿方法在无限维空间中的有效性与鲁棒性。

摘要:

我们通过在无限维空间中使用牛顿迭代法解决第二类均场博弈问题,该方法在[14]中被引入并严格证明了二次收敛性。基于这一理论框架,我们开发了新的数值离散化技术,包括有限差分和半拉格朗日方案,从而实现了无限维迭代的有效计算。所提出的方法在多个基准问题上进行了测试,数值实验展示了其鲁棒性、准确性和效率。还进行了两种方案与现有文献方法的比较分析,突显了基于牛顿法的求解器在MFG系统中的潜力。

英文摘要:

We address the numerical solution of second-order Mean Field Game problems through Newton iterations in infinite dimensions, introduced in [14], where quadratic convergence of the method was rigorously established. Building upon this theoretical framework, we develop new numerical discretization techniques, including both a finite difference and a semi-Lagrangian scheme, that enable an effective computational implementation of the infinite-dimensional iterations. The proposed methods are tested on several benchmark problems, and the resulting numerical experiments demonstrate their robustness, accuracy, and efficiency. A comparative analysis between the two schemes and existing approaches from the literature is also presented, highlighting the potential of Newton-based solvers for MFG systems.

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

↑