COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Space filling designs for computer experiments: some algorithms and numerical results on industrial problems

## Space filling designs for computer experiments: some algorithms and numerical results on industrial problemsAdd to your list(s) Download to your calendar using vCal - Iooss, B (EDF R&D)
- Tuesday 06 September 2011, 10:00-10:30
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact Mustapha Amrani. Design and Analysis of Experiments 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. This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other listsDAK Group Meetings CTSRD - CRASH-worthy Trusted Systems R&D King's Graduate Seminar## Other talksAn SU(3) variant of instanton homology for webs CANCELLED: Beverly Gage: G-Man: J. Edgar Hoover and the American Century Diagnostics and patient pathways in pancreatic cancer SciBar: Sleep, Dreams and Consciousness Understanding Ellipsis: Corpus, Annotation, Theory Streptococcus suis - managing a global zoonotic pathogen of pigs Sneks long balus Cambridge - Corporate Finance Theory Symposium September 2017 - Day 2 The evolution of photosynthetic efficiency Lunchtime Talk: Helen's Bedroom Unbiased Estimation of the Eigenvalues of Large Implicit Matrices |