arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0409389math.NAcs.NAmath.AP

多维Isaacs方程单调逼近格式的误差界

On error bounds for monotone approximation schemes for multi-dimensional Isaacs equations

Espen R. Jakobsen

AI总结:

针对非凸多维Isaacs方程,通过引入惩罚逼近和推广Krylov、Barles、Jakobsen的理论,首次建立了单调逼近格式的误差界。

摘要:

最近,Krylov、Barles和Jakobsen发展了估计Bellman方程(凸Isaacs方程)单调逼近格式误差的理论。本文考虑将该理论推广到一类非凸多维Isaacs方程。这是针对非凸多维完全非线性问题的首个此类结果。为了得到误差界,一个关键中间步骤是引入惩罚逼近。我们最终(i)提供了惩罚逼近的新误差界,扩展了Benssousan和Lions等人的早期结果;(ii)利用非常精确的先验界和Krylov、Barles、Jakobsen近期理论的轻微推广,获得了惩罚方程逼近格式的误差界。

英文摘要:

Recently, Krylov, Barles, and Jakobsen developed the theory for estimating errors of monotone approximation schemes for the Bellman equation (a convex Isaacs equation). In this paper we consider an extension of this theory to a class of non-convex multidimensional Isaacs equations. This is the first result of this kind for non-convex multidimensional fully non-linear problems. To get the error bound, a key intermediate step is to introduce a penalization approximation. We conclude by (i) providing new error bounds for penalization approximations extending earlier results by e.g. Benssousan and Lions, and (ii) obtaining error bounds for approximation schemes for the penalization equation using very precise a priori bounds and a slight generalization of the recent theory of Krylov, Barles, and Jakobsen.

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

↑