arXiv Analytics

Sign in

arXiv:1412.0783 [math.NA]AbstractReferencesReviewsResources

The Mean Square Quasi-Monte Carlo Error for Digitally Shifted Digital Nets

Takashi Goda, Ryuichi Ohori, Kosuke Suzuki, Takehito Yoshiki

Published 2014-12-02Version 1

In this paper, we study randomized quasi-Monte Carlo (QMC) integration using digitally shifted digital nets. We express the mean square QMC error of the $n$-th discrete approximation $f_n$ of a function $f\colon[0,1)^s\to \mathbb{R}$ for digitally shifted digital nets in terms of the Walsh coefficients of $f$. We then apply a bound on the Walsh coefficients for sufficiently smooth integrands to obtain a quality measure called Walsh figure of merit for root mean square error, which satisfies a Koksma-Hlawka type inequality on the root mean square error. Through two types of experiments, we confirm that our quality measure is of use for finding digital nets which show good convergence behaviors of the root mean square error for smooth integrands.

Comments: 15 pages, 8 figures. Submitted to: Monte Carlo and Quasi-Monte Carlo Methods 2014
Categories: math.NA
Related articles: Most relevant | Search more
arXiv:1007.0842 [math.NA] (Published 2010-07-06, updated 2012-11-20)
Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands
arXiv:1903.02276 [math.NA] (Published 2019-03-06)
Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration
arXiv:2001.08558 [math.NA] (Published 2020-01-23)
Randomized sparse grid algorithms for multivariate integration on Haar-Wavelet spaces