A theorem for selecting oa-based latin hypercubes using a distance criterion
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1203748
- Optimal orthogonal-array-based latin hypercubes
- A study on algorithms for optimization of Latin hypercubes
- On maximin distance and nearly orthogonal Latin hypercube designs
- A note on near-orthogonal Latin hypercubes with good space-filling properties
- Asymptotically optimal maximin distance Latin hypercube designs
- Optimal maximin \(L_2\)-distance Latin hypercube designs
- A new class of Latin hypercube for computer experiments
Cites work
- A Basis for the Selection of a Response Surface Design
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- scientific article; zbMATH DE number 4018165 (Why is no real title available?)
- scientific article; zbMATH DE number 3352656 (Why is no real title available?)
- Orthogonal Array-Based Latin Hypercubes
- Some model robust designs in regression
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov
Cited in
(8)- Construction of nested space-filling designs
- A new class of Latin hypercube designs with high-dimensional hidden projective uniformity
- Asymptotically optimal maximin distance Latin hypercube designs
- Trigonometric regression and sampling plans for simulated experiments
- Accurate emulators for large-scale computer experiments
- A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs
- Orthogonal-column Latin hypercube designs with small samples
- Construction of orthogonal Latin hypercube designs with flexible run sizes
This page was built for publication: A theorem for selecting oa-based latin hypercubes using a distance criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4843704)
