Walsh Figure of Merit for Digital Nets: An Easy Measure for Higher Order Convergent QMC

preprint2015arXivOpen access

Abstract

Fix an integer ss. Let f:[0,1)s→Rf:[0,1)^s \to \mathbb R be an integrable function. Let P⊂[0,1]sP\subset [0,1]^s be a finite point set. Quasi-Monte Carlo integration of ff by PP is the average value of ff over PP that approximates the integration of ff over the ss-dimensional cube. Koksma-Hlawka inequality tells that, by a smart choice of PP, one may expect that the error decreases roughly O(N−1(log⁡N)s)O(N^{-1}(\log N)^s). For any α≥1α\geq 1, J.\ Dick gave a construction of point sets such that for αα-smooth ff, convergence rate O(N−α(log⁡N)sα)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−Clog⁡N/s)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−αN^{-α} with α>1α>1, for several test integrands for s=4s=4 and 88.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.