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

一种具有小增益系数的多项式格子规则构造

A Construction of Polynomial Lattice Rules with Small Gain Coefficients

Jan Baldeaux, Josef Dick

AI总结:

本文通过分量分量方法构造了具有小增益系数的多项式格子规则,并证明其方差衰减率接近最优。

摘要:

本文中,我们使用分量分量方法构造了在某种意义上具有小增益系数的多项式格子规则。由Owen引入的增益系数指示了该方法相对于蒙特卡洛方法的改进程度。我们证明,基于分量分量构造的加扰多项式格子规则的估计量方差以$N^{-(2\alpha+1)+\delta}$的速率衰减(对所有$\delta>0$),假设所考虑的函数具有有界的$\alpha$阶分数变差,其中$N$表示求积点的数量。对于Korobov多项式格子规则也得到了类似的结果。还证明了这些规则对于本文考虑的函数空间几乎是最优的。此外,我们讨论了分量分量方法的实现,并展示了如何降低相关的计算成本。最后,我们给出了比较加扰多项式格子规则和加扰数字网的数值结果。

英文摘要:

In this paper we construct polynomial lattice rules which have, in some sense, small gain coefficients using a component-by-component approach. The gain coefficients, as introduced by Owen, indicate to what degree the method improves upon Monte Carlo. We show that the variance of an estimator based on a scrambled polynomial lattice rule constructed component-by-component decays at a rate of $N^{-(2α+ 1) +δ}$, for all $δ>0$, assuming that the function under consideration has bounded fractional variation of order $α$ and where $N$ denotes the number of quadrature points. An analogous result is obtained for Korobov polynomial lattice rules. It is also established that these rules are almost optimal for the function space considered in this paper. Furthermore, we discuss the implementation of the component-by-component approach and show how to reduce the computational cost associated with it. Finally, we present numerical results comparing scrambled polynomial lattice rules and scrambled digital nets.

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

↑