A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments
Abstract
Let f:[0,1)d R be an integrable function. An objective of many computer experiments is to estimate ∫[0,1)d f(x) dx by evaluating f at a finite number of points in [0,1)d. There is a design issue in the choice of these points and a popular choice is via the use of randomized orthogonal arrays. This article proves a multivariate central limit theorem for a class of randomized orthogonal array sampling designs [Owen (1992a)] as well as for a class of OA-based Latin hypercubes [Tang (1993)].
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.