The aim of this paper is to show that one can achieve convergence rates of $N^{-α+ δ}$ for $α> 1/2$ (and for $δ> 0$ arbitrarily small) for nonperiodic $α$-smooth cosine series using lattice rules without random shifting. The smoothness of the functions can be measured by the decay rate of the cosine coefficients. For a specific choice of the parameters the cosine series space coincides with the unanchored Sobolev space of smoothness 1.
We study the embeddings of various reproducing kernel Hilbert spaces and numerical integration in the cosine series function space and show that by applying the so-called tent transformation to a lattice rule one can achieve the (almost) optimal rate of convergence of the integration error. The same holds true for symmetrized lattice rules for the tensor product of the direct sum of the Korobov space and cosine series space, but with a stronger dependence on the dimension in this case.
QMC integration based on arbitrary (t,m,s)-nets yields optimal convergence rates on several scales of function spaces
Institut für Mathematik, Universität Osnabrück(奥斯纳布吕克大学);School of Mathematics and Statistics, University of New South Wales(新南威尔士大学);Stuttgart Technology Center, Sony Semiconductor Solutions Europe(索尼半导体解决方案欧洲斯图加特技术中心);Mathematisches Institut, Friedrich-Schiller-Universität Jena(耶拿大学)
Dimension-independent convergence rates of randomized nets using median-of-means
Johann Radon Institute for Computational and Applied Mathematics, ÖAW(约翰·拉登计算与应用数学研究所,奥地利科学院);Institute of Fundamental and Transdisciplinary Research, Zhejiang University(浙江大学基础与跨学科研究院)
Scaled lattice rules for integration on $\mathbb{R}^d$ achieving higher-order convergence with error analysis in terms of orthogonal projections onto periodic spaces
A higher order lattice-based method for high-dimensional numerical integration using periodization
Catholic University of Eichstätt–Ingolstadt(天主教艾希施泰特-因戈尔施塔特大学);UNSW Sydney(新南威尔士大学悉尼分校);University of Bonn(波恩大学);Fraunhofer Institute for Algorithms and Scientific Computing (SCAI)(弗劳恩霍夫算法与科学计算研究所)