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. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Grünschloß, L., & Keller, A. (2009). (t,m,s)-nets and maximized minimum distance, part II. In Monte Carlo and Quasi-Monte Carlo Methods 2008 (pp. 395–409). Springer Verlag. https://doi.org/10.1007/978-3-642-04107-5_25
Mendeley helps you to discover research relevant for your work.