A method of constructing optimal sliced uniform designs under discrete discrepancy
From MaRDI portal
Publication:6541801
DOI10.1002/sta4.388MaRDI QIDQ6541801
Chang-Ming Yin, Hengzhen Huang
Publication date: 21 May 2024
Published in: Stat (Search for Journal in Brave)
design of experimentsuniformityresolvabilityincomplete block design\(\setminus\)special t4ht\@.\(<\)spispace\(>U\)-type design
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resolvable orthogonal array-based uniform sliced Latin hypercube designs
- Construction of second-order orthogonal sliced Latin hypercube designs
- Connections between uniformity and aberration in general multi-level factorials
- Optimal mixed-level supersaturated design
- Theory and application of uniform experimental designs
- Support points
- Construction of Latin hypercube designs with nested and sliced structures
- Construction of (nearly) orthogonal sliced Latin hypercube designs
- Construction of sliced (nearly) orthogonal Latin hypercube designs
- Sliced Latin hypercube designs via orthogonal arrays
- Construction of sliced maximin-orthogonal Latin hypercube designs
- Sudoku-based space-filling designs
- Construction of sliced space-filling designs based on balanced sliced orthogonal arrays
- Sliced space-filling designs
- A generalized discrepancy and quadrature error bound
- Uniform designs limit aliasing
- Uniform Design: Theory and Application
- Uniform sliced Latin hypercube designs
- A method of constructing maximin distance designs
- Construction of Uniform Designs and Complex-Structured Uniform Designs via Partitionable t-Designss
- Bayesian Quadrature, Energy Minimization, and Space-Filling Design
- Sliced Rotated Sphere Packing Designs
This page was built for publication: A method of constructing optimal sliced uniform designs under discrete discrepancy
