arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1310.5403math.NAcs.NA
收藏

构造具有减少次数的优良高阶多项式格点规则

Constructing good higher order polynomial lattice rules with modulus of reduced degree

Graduate School of Engineering, The University of Tokyo(东京大学工学研究科)

Takashi Goda

AI总结:

本文研究了在加权非锚定Sobolev空间中高阶光滑性的多变量积分问题,通过使用在$\mathbb{F}_{2}$上随机数字位移后的高阶多项式格点集,并通过帐篷变换折叠,构造出具有减少模次数的优良高阶多项式格点规则,从而显著限制了生成向量的搜索空间。

摘要:

在本文中,我们研究了在加权非锚定Sobolev空间中任意高阶光滑性的多变量积分问题。作为求积点,我们使用在$\mathbb{F}_{2}$上的高阶多项式格点集,这些点首先经过随机数字位移,然后通过帐篷变换进行折叠。我们首先证明了存在优良的高阶多项式格点规则,这些规则能够实现均方最坏情况误差的最优速率,同时将所需的模次数减少了一半,相较于未经过帐篷变换的随机数字位移的高阶多项式格点规则。因此,我们能够显著限制生成向量的搜索空间。然后,我们研究了组件间构造作为显式获得优良高阶多项式格点规则的方法。类似于[J. Baldeaux, J. Dick, G. Leobacher, D. Nuyens, F. Pillichshammer, Numer. Algorithms, 59 (2012) 403--431],我们展示了如何高效计算质量标准,并利用快速傅里叶变换获得快速的组件间构造方法。我们的结果推广了之前由[L.L. Cristea, J. Dick, G. Leobacher, F. Pillichshammer, Numer. Math., 105 (2007) 413--455]所展示的结果,其中平滑度固定在2且考虑了经典的多项式格点规则。

英文摘要:

In this paper we investigate multivariate integration in weighted unanchored Sobolev spaces of smoothness of arbitrarily high order. As quadrature points we employ higher order polynomial lattice point sets over $\mathbb{F}_{2}$ which are randomly digitally shifted and then folded using the tent transformation. We first prove the existence of good higher order polynomial lattice rules which achieve the optimal rate of the mean square worst-case error, while reducing the required degree of modulus by half as compared to higher order polynomial lattice rules whose quadrature points are randomly digitally shifted but not folded using the tent transformation. Thus we are able to restrict the search space of generating vectors significantly. We then study the component-by-component construction as an explicit means of obtaining good higher order polynomial lattice rules. In a way analogous to [J. Baldeaux, J. Dick, G. Leobacher, D. Nuyens, F. Pillichshammer, Numer. Algorithms, 59 (2012) 403--431], we show how to calculate the quality criterion efficiently and how to obtain the fast component-by-component construction using the fast Fourier transform. Our result generalizes the previous result shown by [L.L. Cristea, J. Dick, G. Leobacher, F. Pillichshammer, Numer. Math., 105 (2007) 413--455], in which the degree of smoothness is fixed at 2 and classical polynomial lattice rules are considered.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑