A novel extension algorithm for optimized Latin hypercube sampling

DOI10.1080/00949655.2017.1340475OpenAlexW2689264666MaRDI QIDQ5106950

No author found.

Publication date: 22 April 2020

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00949655.2017.1340475

zbMATH Keywords

Latin hypercube samplingdesign of experimentspace-fillingsample size extension

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items

An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design ⋮ A sequential experimental design for multivariate sensitivity analysis using polynomial chaos expansion ⋮ Isovolumetric adaptations to space-filling design of experiments

Cites Work

• Exploratory designs for computational experiments
• Algorithmic construction of optimal symmetric Latin hypercube designs.
• Two general extension algorithms of Latin hypercube sampling
• Optimal Latin hypercube designs for the Kullback-Leibler criterion
• An efficient algorithm for constructing optimal design of computer experiments
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Nested Latin hypercube designs
• Sliced Latin Hypercube Designs
• Design and analysis of simulation experiments