Summary
Digital nets can improve upon traditional fractional factorial designs because for a budget of n=bm runs, they can allow b, …, bm−1, or bm levels per factor, while retaining the good balance properties of orthogonal arrays. However, the t-value typically used to characterize the quality of digital nets is not adequate for the purposes of experimental design. Rather, concepts from the experimental design literature, such as strength, resolution and aberration should be used. Moreover, the known number-theoretic constructions of digital nets are optimized for large m, whereas for laboratory experiments one typically has n=bm less than 100.
This article describes some recent work on constructing digital nets with small numbers of points that are suitable for experimental designs. Coding theory provides some bounds on the quality of designs that may be expected. The generating matrices for the designs are found by computational search. The quality of the designs obtained is compared with the coding theory bounds.
This research was supported by a Hong Kong RGC grant HKBU2007/03P.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dey, A. & Mukerjee, R. (1999), Fractional Factorial Plans, John Wiley & Sons.
Hedayat, A. S., Sloane, N. J. A. & Stufken, J. (1999), Orthogonal Arrays: Theory and Applications, Springer Series in Statistics, Springer-Verlag.
Hickernell, F. J. & Liu, M. Q. (2002), Uniform designs limit aliasing, Biometrika 89, 893–904.
Hong, H. S. (2002), Digital nets and sequences for Quasi-Monte Carlo methods, PhD thesis, Hong Kong Baptist University.
Martin, W. J. & Stinson, D. R. (1999), A generalized Rao bound for ordered orthogonal arrays and (t, m, s)-nets, Canadian Mathematical Bulletin 42(3), 359–370.
Niederreiter, H. (1988), Low-discrepancy and low-dispersion sequences, J. Numb. Theor. 30, 51–70.
Niederreiter, H. (1992), Random Number Generation and Quasi-Monte Carlo Methods, Society for Industrial and Applied Mathematics.
Niederreiter, H. & Xing, C. (1998), Nets, (t, s)-sequences and algebraic geometry, in Random and Quasi-Random Point Sets, Vol. 138 of Lecture Notes in Statistics, Springer-Verlag, pp. 267–302.
Owen, A. B. (1995), Randomly permuted (t, m, s)-nets and (t, s)-sequences, in Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, Vol. 106 of Lecture Notes in Statistics, Springer-Verlag, pp. 299–317.
Pukelsheim, F. (1993), Optimal Design of Experiments, Wiley.
Sobol’, I. M. (1967), The distribution of points in a cube and the approximate evaluation of integrals, U.S.S.R. Comput. Math. Math. Phys. 7, 86–112.
Yue, R. X. & Hickernell, F. J. (1999), Robust designs for fitting linear models with misspecification, Statist. Sinica 9, 1053–1069.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, KI., Hickernell, F.J. (2006). Experimental Designs Using Digital Nets with Small Numbers of Points. In: Niederreiter, H., Talay, D. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31186-6_20
Download citation
DOI: https://doi.org/10.1007/3-540-31186-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25541-3
Online ISBN: 978-3-540-31186-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)