Construction of orthogonal Latin hypercube designs
From MaRDI portal
Publication:3653111
DOI10.1093/biomet/asp058zbMath1178.62083OpenAlexW2130091664MaRDI QIDQ3653111
Min-Qian Liu, Fasheng Sun, Dennis K. J. Lin
Publication date: 18 December 2009
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biomet/asp058
Related Items (43)
On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments ⋮ Construction of column-orthogonal strong orthogonal arrays ⋮ Asymptotically optimal maximin distance Latin hypercube designs ⋮ Construction of space-filling orthogonal designs ⋮ Generalized good lattice point sets ⋮ Orthogonal Latin hypercube designs with special reference to four factors ⋮ The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2 ⋮ Algorithmic construction of nearly column-orthogonal designs ⋮ On the construction of nested orthogonal Latin hypercube designs ⋮ Construction of column-orthogonal designs for computer experiments ⋮ A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs ⋮ Exploratory ensemble designs for environmental models using k‐extended Latin Hypercubes ⋮ Construction of orthogonal general sliced Latin hypercube designs ⋮ 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 ⋮ A new class of Latin hypercube designs with high-dimensional hidden projective uniformity ⋮ Some new classes of orthogonal Latin hypercube designs ⋮ Construction of sliced (nearly) orthogonal Latin hypercube designs ⋮ On maximin distance and nearly orthogonal Latin hypercube designs ⋮ Sliced Latin hypercube designs with both branching and nested factors ⋮ A central limit theorem for marginally coupled designs ⋮ 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 ⋮ Strong orthogonal arrays of strength two plus ⋮ Sliced Latin Hypercube Designs ⋮ Algorithms for generating maximin Latin hypercube and orthogonal designs ⋮ Construction of orthogonal Latin hypercube designs with flexible run sizes ⋮ 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 ⋮ Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments ⋮ Flexible sliced Latin hypercube designs with slices of different sizes ⋮ Construction of orthogonal marginally coupled designs ⋮ A note on near-orthogonal Latin hypercubes with good space-filling properties ⋮ Column-orthogonal and nearly column-orthogonal designs for models with second-order terms
This page was built for publication: Construction of orthogonal Latin hypercube designs
