Sequentially refined Latin hypercube designs: reusing every point
From MaRDI portal
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
Cited in
(8)- A general construction for nested Latin hypercube designs
- A fast general extension algorithm of Latin hypercube sampling
- Sequential probability-based Latin hypercube designs without replacement
- A sequential optimal Latin hypercube design method using an efficient recursive permutation evolution algorithm
- Sliced Rotated Sphere Packing Designs
- Design for Sequential Follow-Up Experiments in Computer Emulations
- Sequentially refined Latin hypercube designs with flexibly and adaptively chosen sample sizes
- Efficient Active Learning Strategies for Computer Experiments
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)