Abstract
Let X be a uniform random vector on the unit cube [0, 1]3 and f : [0, 1]3 → ℝ be a measurable function. In many computer experiments, we would like to estimate the value of ∈ t [0,1]3 f(x)dx, which is E(f○X), by computing f at a number points in [0, 1]3. There are many ways to choose these points and one of these is randomized orthogonal arrays which was proposed independently by Owen and Tang [10, 18], respectively. In this article, we give a uniform bound on a combinational central limit theorem for the randomized orthogonal arrays sampling designs which are based on OA(q 2, 3, q, 2) by using Stein's method. Our order is which is better than Loh's order [6].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.