arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.06501math.NAcs.NA
收藏

光滑积分算子的最优阶拟蒙特卡洛规则的显式构造

An explicit construction of optimal order quasi-Monte Carlo rules for smooth integrands

The University of Tokyo(东京大学);The University of New South Wales(新南威尔士大学)

Takashi Goda, Kosuke Suzuki, Takehito Yoshiki

AI总结:

本文提出了一种显式构造最优阶拟蒙特卡洛规则的方法,通过利用再生核希尔伯特空间中光滑函数的瓦尔什系数的衰减性和稀疏性,实现了在该函数空间中最佳收敛性的QMC规则。

摘要:

在最近的一篇论文中,作者证明了存在一种拟蒙特卡洛(QMC)规则,能够在再生核希尔伯特空间中实现数值积分的最佳收敛速率。本文中,我们提供了这种最优阶QMC规则的显式构造。我们的方法是利用再生核的瓦尔什系数的衰减性和稀疏性,同时通过应用Dick提出的数字网的位交织组合,以及Chen和Skriganov提出的具有大最小汉明距离和Niederreiter-Rosenbloom-Tsfasman度量的数字网。据我们所知,我们的构造提供了第一个在该函数空间中实现最佳收敛性的QMC规则。

英文摘要:

In a recent paper by the authors, it is shown that there exists a quasi-Monte Carlo (QMC) rule which achieves the best possible rate of convergence for numerical integration in a reproducing kernel Hilbert space consisting of smooth functions. In this paper we provide an explicit construction of such an optimal order QMC rule. Our approach is to exploit both the decay and the sparsity of the Walsh coefficients of the reproducing kernel simultaneously. This can be done by applying digit interlacing composition due to Dick to digital nets with large minimum Hamming and Niederreiter-Rosenbloom-Tsfasman metrics due to Chen and Skriganov. To our best knowledge, our construction gives the first QMC rule which achieves the best possible convergence in this function space.

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

↑