arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.01840math.PR
收藏

倒向随机微分方程Picard迭代的收敛速度

On the speed of convergence of Picard iterations of backward stochastic differential equations

Martin Hutzenthaler, Thomas Kruse, Tuan Anh Nguyen

摘要:

具有全局Lipschitz连续非线性项的倒向随机微分方程的Picard迭代至少以指数速度收敛于解,这在科学文献中是一个公认的事实。在本文中,我们证明,这种收敛实际上是至少平方根阶乘快。我们证明了一个例子,没有更高的收敛速度是可能的一般。此外,如果非线性是$z$独立的,则收敛甚至是阶乘快速的。从而揭示了倒向随机微分方程Picard迭代收敛速度的相变。

英文摘要:

It is a well-established fact in the scientific literature that Picard iterations of backward stochastic differential equations with globally Lipschitz continuous nonlinearity converge at least exponentially fast to the solution. In this paper we prove that this convergence is in fact at least square-root factorially fast. We show for one example that no higher convergence speed is possible in general. Moreover, if the nonlinearity is $z$-independent, then the convergence is even factorially fast. Thus we reveal a phase transition in the speed of convergence of Picard iterations of backward stochastic differential equations.

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

↑