Numerical studies of space filling designs: optimization of Latin Hypercube Samples and subprojection properties

Abstract : Quantitative assessment of the uncertainties tainting the results of computer simulations is nowadays a major topic of interest in both industrial and scientific communities. One of the key issues in such studies is to get information about the output when the numerical simulations are expensive to run. This paper considers the problem of exploring the whole space of variations of the computer model input variables in the context of a large dimensional exploration space. Various properties of space filling designs are justified: interpoint-distance, discrepancy, minimum spanning tree criteria. A specific class of design, the optimized Latin Hypercube Sample, is considered. Several optimization algorithms, coming from the literature, are studied in terms of convergence speed, robustness to subprojection and space filling properties of the resulting design. Some recommendations for building such designs are given. Finally, another contribution of this paper is the deep analysis of the space filling properties of the design 2D-subprojections.
Liste complète des métadonnées

Cited literature [44 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00848240
Contributor : Bertrand Iooss <>
Submitted on : Thursday, July 25, 2013 - 4:44:17 PM
Last modification on : Friday, April 12, 2019 - 4:22:50 PM
Document(s) archivé(s) le : Wednesday, April 5, 2017 - 4:50:34 PM

Files

JOS_vf.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00848240, version 1
  • ARXIV : 1307.6835

Citation

Guillaume Damblin, Mathieu Couplet, Bertrand Iooss. Numerical studies of space filling designs: optimization of Latin Hypercube Samples and subprojection properties. Journal of Simulation, Palgrave Macmillan, 2013, 7, pp.276-289. ⟨hal-00848240⟩

Share

Metrics

Record views

654

Files downloads

1826