(t,m,s)-Nets and Maximized Minimum Distance, Part II

Conference paper

DOI: 10.1007/978-3-642-04107-5_25

Cite this paper as:
Grünschloß L., Keller A. (2009) (t,m,s)-Nets and Maximized Minimum Distance, Part II. In: L' Ecuyer P., Owen A. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2008. Springer, Berlin, Heidelberg

Abstract

The quality parameter t of (t,m,s)-nets controls extensive stratification properties of the generated sample points. However, the definition allows for points that are arbitrarily close across strata boundaries. We continue the investigation of (t,m,s)-nets under the constraint of maximizing the mutual distance of the points on the unit torus and present two new constructions along with algorithms. The first approach is based on the fact that reordering (t,s)-sequences can result in (t,m,s+1)-nets with varying toroidal distance, while the second algorithm generates points by permutations instead of matrices.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.GmbHBerlinGermany

Personalised recommendations