pith. sign in

arxiv: 0909.0329 · v3 · pith:CLGJQ2ZLnew · submitted 2009-09-02 · 📊 stat.CO · math.ST· stat.TH

Latin hypercube sampling with inequality constraints

classification 📊 stat.CO math.STstat.TH
keywords constraintshypercubelatinsamplinginequalitynumericalsomevariables
0
0 comments X
read the original abstract

In some studies requiring predictive and CPU-time consuming numerical models, the sampling design of the model input variables has to be chosen with caution. For this purpose, Latin hypercube sampling has a long history and has shown its robustness capabilities. In this paper we propose and discuss a new algorithm to build a Latin hypercube sample (LHS) taking into account inequality constraints between the sampled variables. This technique, called constrained Latin hypercube sampling (cLHS), consists in doing permutations on an initial LHS to honor the desired monotonic constraints. The relevance of this approach is shown on a real example concerning the numerical welding simulation, where the inequality constraints are caused by the physical decreasing of some material properties in function of the temperature.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.