Space-filling designs for computer experiments
Professor Roshan Joseph
Barton Lectures in Computational Mathematics
Date: Wednesday, September 23, 2020
Time: 4:00 pm - 5:00 pm
Abstract: Space-filling properties are important in designing computer experiments. In this talk, first I will review the popular space-filling designs such as Latin hypercube, uniform, maximin, and minimax designs. Then, I will present a useful design known as maximum projection design in detail. Application of these designs in computer experiments, Bayesian computation, and model calibration will be illustrated with several examples.
*All talks will be held virtually through Zoom. Please contact firstname.lastname@example.org for talk links.*