Sequentially refined Latin hypercube designs: reusing every point
DOI10.1080/01621459.2014.993078zbMATH Open1373.62414OpenAlexW2073065008MaRDI QIDQ5367479FDOQ5367479
Authors: Jin Xu, Jiajie Chen, Peter Z. G. Qian
Publication date: 13 October 2017
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Sequentially_refined_Latin_hypercube_designs_reusing_every_point/1293023
Recommendations
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- Space-filling Latin hypercube designs for computer experiments
- Optimal Latin-hypercube designs for computer experiments
- Latin hypercubes and space-filling designs
- Optimal and orthogonal Latin hypercube designs for computer experiments
computer experimentsdesign of experimentsnumerical integrationLatin hypercube designsequential evaluation
Cited In (6)
- A general construction for nested Latin hypercube designs
- Sequential probability-based Latin hypercube designs without replacement
- Design for Sequential Follow-Up Experiments in Computer Emulations
- Sliced Rotated Sphere Packing Designs
- A fast general extension algorithm of Latin hypercube sampling
- A sequential optimal Latin hypercube design method using an efficient recursive permutation evolution algorithm
This page was built for publication: Sequentially refined Latin hypercube designs: reusing every point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367479)