Space filling designs for computer experiments: some algorithms and numerical results on industrial problems
Duration: 34 mins 10 secs
About this item
Iooss, B (EDF R&D)
Tuesday 06 September 2011, 10:00-10:30
|Collection:||Design and Analysis of Experiments|
|Publisher:||Isaac Newton Institute|
|Abstract:||Complex computer codes, for instance simulating physical phenomena, are often too time expensive to be directly used to perform uncertainty, sensitivity, optimization and robustness analyses. A widely accepted method to circumvent this problem consists in replacing cpu time expensive computer models by cpu inexpensive mathematical functions, called metamodels. A necessary condition to a successful modelling of these computer experiments is to explore the whole space of variations of the computer model input variables. However in many industrial applications, we are faced to the harsh problem of the high dimensionality of the exploration space. In this communication, we will first focus on the metamodel validation process which consists in evaluating the metamodel predictivity with respect to the initial computer code. This step has to be realized with caution and robustness in industrial applications, especially in the framework of safety studies.
We propose and test an algorithm, which optimizes the distance between the validation points and the metamodel learning points in order to estimate the true metamodel predictivity with a minimum number of validation points. Comparisons with classical validation algorithms and application to a nuclear safety computer code show the relevance of this sequential validation design. Second, we will present some recent results about the properties of different space filling designs. In practice, one has to choose which design to use in an exploratory phase of a numerical model. We will show the usefulness of some classification tools, as those based on the minimal spanning trees. We adopt a numerical approach to compare the performance of different types of space filling designs, in function of their interpoint-distance, L2-discrepancies and various sub-projection properties. Finally, we will present two recent problems, posed in some industrial applications: the introductions of inequality constraints between the inputs of a space filling design and the building of space filling design mixing quantitative and qualitative factors.
|MPEG-4 Video||640x360||1.84 Mbits/sec||473.96 MB||View||Download|
|WebM||640x360||1.21 Mbits/sec||311.42 MB||View||Download|
|Flash Video||484x272||568.76 kbits/sec||142.33 MB||View||Download|
|iPod Video||480x270||506.29 kbits/sec||126.70 MB||View||Download|
|MP3||44100 Hz||125.02 kbits/sec||31.09 MB||Listen||Download|
|Auto *||(Allows browser to choose a format it supports)|