On the variance of quadrature over scrambled nets and sequences
The randomization of a (t,m,s)-net or a (t,s)-sequence proposed by Owen (1995, Monte Carlo and quasi-Monte Carlo Methods in Scientific Computing (Berlin), Lecture Notes in Statistics, vol. 106, pp. 299-317) combines the strengths of equidistribution and Monte Carlo integration. This paper shows that the order of variance found in Owen (1997b, Scrambled net variance for integrals of smooth functions. Ann. Statist. 25, 1541-1562) still holds for weaker smooth integrands. The main results in this paper are as follows: For the univariate Lipschitz integrands on [0,1), the variance over scrambled ([lambda],t,m,1)-nets is of order O(n-3); In the s-dimensional case, if the integrand satisfies a generalized Lipschitz condition on [0,1)s, then the variance over scrambled ([lambda],t,m,s)-nets is of order O(n-3(log n)s-1); Also shown in this paper is that the variance over a scrambled (t,s)-sequence is of order O(n-2(log n)s-1) for the integrands described above. These results seem to be sharper than any similar results in the literature.
Year of publication: |
1999
|
---|---|
Authors: | Yue, Rong-Xian ; Mao, Shi-Song |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 44.1999, 3, p. 267-280
|
Publisher: |
Elsevier |
Keywords: | Integration Monte Carlo methods Equidistribution methods |
Saved in:
Saved in favorites
Similar items by person
-
A non-iterative approach to estimating parameters in a linear structural equation model
Zhu, Li-Ping, (2006)
-
D-optimal designs for multiresponse linear models with a qualitative factor
Yue, Rong-Xian, (2014)
-
Liu, Xin, (2013)
- More ...