A theorem for selecting oa-based latin hypercubes using a distance criterion

DOI10.1080/03610929408831370zbMath0825.62186OpenAlexW2003480990MaRDI QIDQ4843704

Boxin Tang

Publication date: 17 August 1995

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610929408831370

zbMATH Keywords

orthogonal arrayscomputer experimentsLatin hypercubesmaximin distance designs

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (8)

Asymptotically optimal maximin distance Latin hypercube designs ⋮ Unnamed Item ⋮ A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs ⋮ A new class of Latin hypercube designs with high-dimensional hidden projective uniformity ⋮ Accurate emulators for large-scale computer experiments ⋮ Orthogonal-column Latin hypercube designs with small samples ⋮ Construction of orthogonal Latin hypercube designs with flexible run sizes ⋮ Construction of nested space-filling designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some model robust designs in regression
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Orthogonal Array-Based Latin Hypercubes
• A Basis for the Selection of a Response Surface Design

This page was built for publication: A theorem for selecting oa-based latin hypercubes using a distance criterion