A construction method for orthogonal Latin hypercube designs

DOI10.1093/biomet/93.2.279zbMath1153.62349OpenAlexW2154735538MaRDI QIDQ5503395

Dennis K. J. Lin, David M. Steinberg

Publication date: 15 January 2009

Published in: Biometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/biomet/93.2.279

zbMATH Keywords

computer experiments\(U\)-designrotation design

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Factorial statistical designs (62K15)

Related Items (45)

Construction of column-orthogonal strong orthogonal arrays ⋮ Construction of space-filling orthogonal designs ⋮ Generalized good lattice point sets ⋮ LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model ⋮ A CLASS OF MULTILEVEL NONREGULAR DESIGNS FOR STUDYING QUANTITATIVE FACTORS ⋮ Orthogonal Latin hypercube designs with special reference to four factors ⋮ Algorithmic construction of nearly column-orthogonal designs ⋮ Construction of column-orthogonal designs for computer experiments ⋮ A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs ⋮ Orthogonal designs for computer experiments ⋮ A fast particle-based approach for calibrating a 3-D model of the Antarctic ice sheet ⋮ A new rotation method for constructing orthogonal Latin hypercube designs ⋮ Block-circulant matrices for constructing optimal Latin hypercube designs ⋮ On the maximin distance properties of orthogonal designs via the rotation ⋮ Construction of maximin \(L_1\)-distance Latin hypercube designs ⋮ A new class of Latin hypercube designs with high-dimensional hidden projective uniformity ⋮ Some new classes of orthogonal Latin hypercube designs ⋮ Accurate emulators for large-scale computer experiments ⋮ Construction of sliced (nearly) orthogonal Latin hypercube designs ⋮ Sliced Latin hypercube designs with both branching and nested factors ⋮ U-type and column-orthogonal designs for computer experiments ⋮ Construction of second-order orthogonal sliced Latin hypercube designs ⋮ Column-orthogonal nearly strong orthogonal arrays ⋮ On second order orthogonal Latin hypercube designs ⋮ Construction of space-filling orthogonal Latin hypercube designs ⋮ Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs ⋮ Nearly column-orthogonal designs based on leave-one-out good lattice point sets ⋮ Sliced Latin Hypercube Designs ⋮ Orthogonal-column Latin hypercube designs with small samples ⋮ Algorithms for generating maximin Latin hypercube and orthogonal designs ⋮ Computer experiments: a review ⋮ A new and flexible method for constructing designs for computer experiments ⋮ Construction of orthogonal Latin hypercube designs with flexible run sizes ⋮ Orthogonal Latin hypercube designs from generalized orthogonal designs ⋮ Column-orthogonal designs with multi-dimensional stratifications ⋮ A Note on the Construction of Orthogonal Latin Hypercube Designs ⋮ Construction of nearly orthogonal Latin hypercube designs ⋮ Construction of nearly orthogonal Latin hypercube designs ⋮ Optimal maximin \(L_2\)-distance Latin hypercube designs ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Flexible sliced Latin hypercube designs with slices of different sizes ⋮ A note on near-orthogonal Latin hypercubes with good space-filling properties ⋮ Construction of nested space-filling designs ⋮ A study of orthogonal array-based designs under a broad class of space-filling criteria ⋮ Representative points for distribution recovering

This page was built for publication: A construction method for orthogonal Latin hypercube designs