Generating a maximally spaced set of bins to fill for high-dimensional space-filling Latin hypercube sampling

DOI10.1615/INT.J.UNCERTAINTYQUANTIFICATION.V1.I3.40MaRDI QIDQ3173745zbMATH OpenFDO

Authors Keith Dalbey, George N. Karystinos

Publication date 10 October 2011

Published in International Journal for Uncertainty Quantification (Search for Journal in Brave)

zbMATH Keywords

Monte CarloLatin hypercube samplinguncertainty quantificationspace-fillingcomputational designregularity detectionhigh-dimensional methods

Mathematics Subject Classification ID

Optimal statistical designs (62K05)

Recommendations

• Space-filling Latin hypercube designs for computer experiments
• Latin hypercubes and space-filling designs
• Orthogonal-maximin Latin hypercube designs
• A general construction for space-filling Latin hypercubes
• Bounds for maximin Latin hypercube designs

This page was built for publication: Generating a maximally spaced set of bins to fill for high-dimensional space-filling Latin hypercube sampling

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