关于一般正权格规则的CBC-DBD构造的注记
A note on the CBC-DBD construction of lattice rules with general positive weights
摘要:
格点规则是研究最多的拟蒙特卡罗方法之一。逼近$s$维积分的秩$1$晶格规则完全由其\emph{generating vector} $\boldsymbol{z} \in \mathbb{Z}^s$及其点数~ $N$指定。虽然有很多结果的存在“好”的秩$1$格规则,有没有明确的结构良好的生成向量的尺寸$s \ge 3$。这就是为什么人们通常诉诸计算机搜索算法。在Ebert等人最近发表在Journal of Complexity上的一篇论文中,我们展示了一种用于加权Korobov类中函数积分的秩为1的格规则的良好生成向量的逐分量逐位(CBC-DBD)构造。然而,该论文的结果仅限于产品重量。在本文中,我们将推广这一结果,以任意的正权重,从而回答了一个悬而未决的问题,在文件中提出的Ebert等人。我们还包括一个简短的一节,该算法可以实现的情况下,POD权重,我们看到,CBC-DBD建设是竞争与经典的CBC建设。
英文摘要:
Lattice rules are among the most prominently studied quasi-Monte Carlo methods to approximate multivariate integrals. A rank-$1$ lattice rule to approximate an $s$-dimensional integral is fully specified by its \emph{generating vector} $\boldsymbol{z} \in \mathbb{Z}^s$ and its number of points~$N$. While there are many results on the existence of ``good'' rank-$1$ lattice rules, there are no explicit constructions of good generating vectors for dimensions $s \ge 3$. This is why one usually resorts to computer search algorithms. In a recent paper by Ebert et al. in the Journal of Complexity, we showed a component-by-component digit-by-digit (CBC-DBD) construction for good generating vectors of rank-1 lattice rules for integration of functions in weighted Korobov classes. However, the result in that paper was limited to product weights. In the present paper, we shall generalize this result to arbitrary positive weights, thereby answering an open question posed in the paper of Ebert et al. We also include a short section on how the algorithm can be implemented in the case of POD weights, by which we see that the CBC-DBD construction is competitive with the classical CBC construction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。