arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.08334math.NAcs.NA
收藏

多维Zakai方程稀疏网格多级估计器分析

Analysis of sparse grid multilevel estimators for multi-dimensional Zakai equations

Mathematical Institute, University of Oxford(牛津大学数学研究所)

Christoph Reisinger, Zhenru Wang

AI总结:

本文研究了多维Zakai方程解的期望函数的估计器的精度和计算复杂性,采用Milstein方案进行时间积分,结合交替方向隐式(ADI)分解的空间有限差分离散化,结合稀疏网格组合技术与多级蒙特卡洛采样(MLMC)。在二维情况下,通过详细的傅里叶分析发现,对于根均方误差(RMSE)ε,MLMC在稀疏网格上的最优复杂度为O(ε^{-2}),而MLMC在正则网格上为O(ε^{-2}(logε)^2),标准MC在稀疏网格上为O(ε^{-7/2}(|logε|)^{5/2}),而MC在正则网格上为O(ε^{-4})。数值测试验证了这些发现。我们讨论了高维情况,但未给出详细证明,表明MLMC在稀疏网格上始终具有最优复杂度,标准MC在稀疏网格上具有与维度无关的固定复杂度(除了对数项),而MLMC和MC在正则网格上的成本随维度呈指数增长。

摘要:

在本文中,我们分析了多维抛物线随机偏微分方程(SPDE)的解的期望函数的估计器的精度和计算复杂性。这里,我们使用Milstein方案进行时间积分,并结合交替方向隐式(ADI)分解的空间有限差分离散化,结合稀疏网格组合技术与多级蒙特卡洛采样(MLMC)。在二维情况下,通过详细的傅里叶分析发现,对于根均方误差(RMSE)ε,MLMC在稀疏网格上的最优复杂度为O(ε^{-2}),而MLMC在正则网格上为O(ε^{-2}(logε)^2),标准MC在稀疏网格上为O(ε^{-7/2}(|logε|)^{5/2}),而MC在正则网格上为O(ε^{-4})。数值测试验证了这些发现。我们讨论了高维情况,但未给出详细证明,表明MLMC在稀疏网格上始终具有最优复杂度,标准MC在稀疏网格上具有与维度无关的固定复杂度(除了对数项),而MLMC和MC在正则网格上的成本随维度呈指数增长。

英文摘要:

In this article, we analyse the accuracy and computational complexity of estimators for expected functionals of the solution to multi-dimensional parabolic stochastic partial differential equations (SPDE) of Zakai-type. Here, we use the Milstein scheme for time integration and an alternating direction implicit (ADI) splitting of the spatial finite difference discretisation, coupled with the sparse grid combination technique and multilevel Monte Carlo sampling (MLMC). In the two-dimensional case, we find by detailed Fourier analysis that for a root-mean-square error (RMSE) $\varepsilon$, MLMC on sparse grids has the optimal complexity $O(\varepsilon^{-2})$, whereas MLMC on regular grids has $O(\varepsilon^{-2}(\log\varepsilon)^2)$, standard MC on sparse grids $O(\varepsilon^{-7/2}(|\log\varepsilon|)^{5/2})$, and MC on regular grids $O(\varepsilon^{-4})$. Numerical tests confirm these findings empirically. We give a discussion of the higher-dimensional setting without detailed proofs, which suggests that MLMC on sparse grids always leads to the optimal complexity, standard MC on sparse grids has a fixed complexity order independent of the dimension (up to a logarithmic term), whereas the cost of MLMC and MC on regular grids increases exponentially with the dimension.

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

↑