Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quasi-Monte Carlo point sets with small $t$-values and WAFOM (1406.1967v4)

Published 8 Jun 2014 in math.NA and cs.NA

Abstract: 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.

Citations (8)

Summary

We haven't generated a summary for this paper yet.