A novel extension algorithm for optimized Latin hypercube sampling

DOI10.1080/00949655.2017.1340475MaRDI QIDQ5106950zbMATH OpenOpenAlexFDO

Authors

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

design of experimentLatin hypercube samplingsample size extensionspace-filling

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

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

Cited in

(6)

• 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
• A fast general extension algorithm of Latin hypercube sampling
• On reduction of finite-sample variance by extended Latin hypercube sampling
• Isovolumetric adaptations to space-filling design of experiments
• Model predictivity assessment: incremental test-set selection and accuracy evaluation

This page was built for publication: A novel extension algorithm for optimized Latin hypercube sampling

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