Implementation of a component-by-component algorithm to generate small low-discrepancy samples

10Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In [B. Doerr, M. Gnewuch, P. Kritzer, F. Pillichshammer. Monte Carlo Methods Appl., 14:129-149, 2008], a component-by-component (CBC) approach to generate small low-discrepancy samples was proposed and analyzed. The method is based on randomized rounding satisfying hard constraints and its derandomization. In this paper we discuss how to implement the algorithm and present first numerical experiments. We observe that the generated points in many cases have a significantly better star discrepancy than what is guaranteed by the theoretical upper bound. Moreover, we exhibit that the actual discrepancy is mainly caused by the underlying grid structure, whereas the rounding errors have a negligible contribution. Hence to improve the algorithm, we propose and analyze a randomized point placement. We also study a hybrid approach which combines classical low-discrepancy sequences and the CBC algorithm. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Doerr, B., Gnewuch, M., & Wahlström, M. (2009). Implementation of a component-by-component algorithm to generate small low-discrepancy samples. In Monte Carlo and Quasi-Monte Carlo Methods 2008 (pp. 323–338). Springer Verlag. https://doi.org/10.1007/978-3-642-04107-5_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free