Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration |
| |
Institution: | 1. Graduate School of Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan;2. Graduate School of Mathematical Sciences, The University of Tokyo, 3-8-1 Komaba, Meguro-ku, Tokyo 153-8914, Japan |
| |
Abstract: | In this paper we study quasi-Monte Carlo integration of smooth functions using digital nets. We fold digital nets over by means of the -adic tent transformation, which has recently been introduced by the authors, and employ such folded digital nets as quadrature points. We first analyze the worst-case error of quasi-Monte Carlo rules using folded digital nets in reproducing kernel Hilbert spaces. Here we need to permit digital nets with “infinite digit expansions”, which are beyond the scope of the classical definition of digital nets. We overcome this issue by considering the infinite product of cyclic groups and the characters on it. We then give an explicit means of constructing good folded digital nets as follows: we use higher order polynomial lattice point sets for digital nets and show that the component-by-component construction can find good folded higher order polynomial lattice rules that achieve the optimal convergence rate of the worst-case error in certain Sobolev spaces of smoothness of arbitrarily high order. |
| |
Keywords: | Quasi-Monte Carlo Numerical integration Tent transformation Folded digital nets Higher order polynomial lattice rules |
本文献已被 ScienceDirect 等数据库收录! |
|