University of Cambridge > > Isaac Newton Institute Seminar Series > Non-collapsing Spacing-filling Designs for Bounded Regions

Non-collapsing Spacing-filling Designs for Bounded Regions

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Design and Analysis of Experiments

Many physical processes can be described via mathematical models implemented as computer codes. Since a computer code may take hours or days to produce a single output, a cheaper surrogate model (emulator) may be fitted for exploring the region of interest. The performance of the emulator depends on the “space-filling” properties of the design; that is, how well the design points are spread throughout the experimental region. The output from many computer codes is deterministic, in which case no replications are required at, or near, any design point to estimate error variability. In addition, designs that do not replicate any value for any single input (“non-collapsing” designs) are the most efficient when one or more inputs turn out to have little effect on the response. An algorithm is described for constructing space-filling and non-collapsing designs for computer experiments when the input region is bounded.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity