Resolvable orthogonal array-based uniform sliced Latin hypercube designs

DOI10.1016/J.SPL.2014.06.021MaRDI QIDQ395979zbMATH OpenOpenAlexFDO

Authors Xue Yang, Hao Chen, Min-Qian Liu

Publication date 8 August 2014

Published in Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.spl.2014.06.021

zbMATH Keywords

computer experimentspace-filling designcentered \(L_2\) discrepancyresolvable orthogonal arraysliced Latin hypercube design

Mathematics Subject Classification ID

Statistical block designs (62K10) Computing methodologies and applications (68U99) Orthogonal arrays, Latin squares, Room squares (05B15)

Recommendations

• Sliced Latin hypercube designs via orthogonal arrays
• Construction of sliced maximin-orthogonal Latin hypercube designs
• Construction of sliced space-filling designs based on balanced sliced orthogonal arrays
• Construction of sliced (nearly) orthogonal Latin hypercube designs
• Construction of (nearly) orthogonal sliced Latin hypercube designs

Cites work

• scientific article; zbMATH DE number 2231192 (Why is no real title available?)
• A generalized discrepancy and quadrature error bound
• An approach of constructing mixed-level orthogonal arrays of strength \(\geqslant 3\)
• Construction of sliced (nearly) orthogonal Latin hypercube designs
• Construction of sliced orthogonal Latin hypercube designs
• Optimal mixed-level supersaturated design
• Orthogonal Array-Based Latin Hypercubes
• Orthogonal arrays of strength 3 and small run sizes
• Orthogonal arrays. Theory and applications
• Sliced Latin Hypercube Designs
• Sliced Latin hypercube designs via orthogonal arrays
• Some new constructions of strength 3 mixed orthogonal arrays
• Statistics in industry
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Uniform designs limit aliasing
• Uniform supersaturated design and its construction

Cited in

(11)

• Sliced Latin hypercube designs via orthogonal arrays
• Construction of (nearly) orthogonal sliced Latin hypercube designs
• Construction of sliced space-filling designs based on balanced sliced orthogonal arrays
• Construction of sliced maximin-orthogonal Latin hypercube designs
• Uniform minimum moment aberration designs
• Lower bound of average centeredL2-discrepancy forU-type designs
• Construction of improved branching Latin hypercube designs
• Construction of second-order orthogonal sliced Latin hypercube designs
• A new and flexible design construction for orthogonal arrays for modern applications
• A method of constructing optimal sliced uniform designs under discrete discrepancy
• Some results on the construction of sliced orthogonal arrays of parallel-flats type

This page was built for publication: Resolvable orthogonal array-based uniform sliced Latin hypercube designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q395979)