Abstract
The -value of a -net is an important criterion of point sets for quasi-Monte Carlo integration, and many point sets are constructed in terms of the -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 -value and WAFOM are both small, so as to be effective for a wider range of function classes. For this, we fix digital -nets with small -values (e.g., Sobol' or Niederreiter--Xing nets) in advance, apply random linear scrambling, and select scrambled digital -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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.