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

具有小$t$ -值和WAFOM的拟蒙特卡罗方法点集

Quasi-Monte Carlo point sets with small $t$-values and WAFOM

Shin Harase

摘要:

$(t, m, s)$ -网的$t$ -值是拟蒙特卡罗方法积分点集的重要判据,许多点集都是根据$t$ -值构造的,因为这导致小的积分误差界。最近,Matsumoto,Saito和Matoba提出了Walsh品质因数(WAFOM)作为一个快速计算的点集标准,确保高阶收敛的函数类非常高的光滑度。在本文中,我们考虑的点集的搜索算法,其$t$ -值和WAFOM都很小,以便有效地为更广泛的函数类。为此,我们用小的$t$ -值来固定数字$(t, m, s)$ -网(例如,Sobol或Niederreiter-Xing网),应用随机线性加扰,并根据WAFOM选择加扰的数字$(t, m, s)$网。实验结果表明,所得到的点集提高了光滑函数的收敛速度,并对非光滑函数具有鲁棒性。

英文摘要:

The $t$-value of a $(t, m, s)$-net is an important criterion of point sets for quasi-Monte Carlo integration, and many point sets are constructed in terms of the $t$-values, as this leads to small integration error bounds. Recently, Matsumoto, Saito, and Matoba proposed the Walsh figure of merit (WAFOM) as a quickly computable criterion of point sets that ensures higher order convergence for function classes of very high smoothness. In this paper, we consider a search algorithm for point sets whose $t$-value and WAFOM are both small, so as to be effective for a wider range of function classes. For this, we fix digital $(t, m, s)$-nets with small $t$-values (e.g., Sobol' or Niederreiter--Xing nets) in advance, apply random linear scrambling, and select scrambled digital $(t, m, s)$-nets in terms of WAFOM. Experiments show that the resulting point sets improve the rates of convergence for smooth functions and are robust for non-smooth functions.

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

↑