Fix an integer $s$. Let $f:[0,1)^s \to \mathbb R$ be an integrable function. Let $P\subset [0,1]^s$ be a finite point set. Quasi-Monte Carlo integration of $f$ by $P$ is the average value of $f$ over $P$ that approximates the integration of $f$ over the $s$-dimensional cube. Koksma-Hlawka inequality tells that, by a smart choice of $P$, one may expect that the error decreases roughly $O(N^{-1}(\log N)^s)$. For any $α\geq 1$, J.\ Dick gave a construction of point sets such that for $α$-smooth $f$, convergence rate $O(N^{-α}(\log N)^{sα})$ is assured. As a coarse version of his theory, M-Saito-Matoba introduced Walsh figure of Merit (WAFOM), which gives the convergence rate $O(N^{-C\log N/s})$. WAFOM is efficiently computable. By a brute-force search of low WAFOM point sets, we observe a convergence rate of order $N^{-α}$ with $α>1$, for several test integrands for $s=4$ and $8$.
The Mean Square Quasi-Monte Carlo Error for Digitally Shifted Digital Nets
Graduate School of Engineering, The University of Tokyo(东京大学大学院工学系研究科);Graduate School of Mathematical Sciences, The University of Tokyo(东京大学大学院数理科学研究科)
QMC integration based on arbitrary (t,m,s)-nets yields optimal convergence rates on several scales of function spaces
Institut für Mathematik, Universität Osnabrück(奥斯纳布吕克大学);School of Mathematics and Statistics, University of New South Wales(新南威尔士大学);Stuttgart Technology Center, Sony Semiconductor Solutions Europe(索尼半导体解决方案欧洲斯图加特技术中心);Mathematisches Institut, Friedrich-Schiller-Universität Jena(耶拿大学)
Uncertainty quantification using importance-sampled quasi-Monte Carlo with dimension-independent convergence rates
Institute of Fundamental and Transdisciplinary Research, Zhejiang University(浙江大学基础与交叉研究院);Department of Mathematical Sciences, Tsinghua University(清华大学数学科学系);School of Mathematics, South China University of Technology(华南理工大学数学学院)
Quasi-Monte Carlo point sets with small $t$-values and WAFOM
$(t, m, s)$ -网的$t$ -值是拟蒙特卡罗方法积分点集的重要判据,许多点集都是根据$t$ -值构造的,因为这导致小的积分误差界。最近,Matsumoto,Saito和Matoba提出了Walsh品质因数(WAFOM)作为一个快速计算的点集标准,确保高阶收敛的函数类非常高的光滑度。在本文中,我们考虑的点集的搜索算法,其$t$ -值和WAFOM都很小,以便有效地为更广泛的函数类。为此,我们用小的$t$ -值来固定数字$(t, m, s)$ -网(例如,Sobol或Niederreiter-Xing网),应用随机线性加扰,并根据WAFOM选择加扰的数字$(t, m, s)$网。实验结果表明,所得到的点集提高了光滑函数的收敛速度,并对非光滑函数具有鲁棒性。