کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4608480 | 1631469 | 2016 | 21 صفحه PDF | دانلود رایگان |
In this paper, we study quasi-Monte Carlo (QMC) integration in weighted Sobolev spaces. In contrast to many previous results the QMC algorithms considered here are of open type, i.e., they are extensible in the number of sample points without having to discard the samples already used. As the underlying integration nodes we consider randomized Halton sequences in prime bases p=(p1,…,ps) for which we study the root mean square (RMS) worst-case error. The randomization method is a p-adic shift which is based on p-adic arithmetic.In the class of open methods, the error bounds are optimal with respect to the order of magnitude of the number of sample nodes. Furthermore we obtain conditions on the coordinate weights under which the error bounds are independent of the dimension ss. In terms of the field of Information-Based Complexity this means that the corresponding QMC rule achieves a strong polynomial tractability error bound. Our findings on the RMS worst-case error of randomized Halton sequences can be carried over to the RMS L2L2-discrepancy.Except for the p-adic shift our results are fully constructive and no search algorithms (such as the component-by-component algorithm) are required.
Journal: Journal of Complexity - Volume 33, April 2016, Pages 169–189