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

具有随机n的格点规则实现几乎最优的O(n^{-α-1/2})误差,与维度无关

Lattice rules with random $n$ achieve nearly the optimal $\mathcal{O}(n^{-α-1/2})$ error independently of the dimension

Peter Kritzer, Frances Y. Kuo, Dirk Nuyens, Mario Ullrich

AI总结:

本文提出了一种新的随机算法,用于在[0,1]^d上对d变量函数进行数值积分,该函数属于带主导混合光滑度α≥0和产品权重1≥γ_1≥γ_2≥⋯>0的加权Sobolev空间。算法基于秩为1的格点规则,并使用随机点数n。对于α>1/2的情况,证明了该算法能够达到几乎最优的收敛阶O(n^{-α-1/2}),其中隐含常数与维度d无关,如果权重满足∑_{j=1}^∞ γ_j^{1/α}<∞。通过在格点规则中添加随机位移,对于更一般的α>0的情况,同样可以达到相同的收敛阶。这表明,在随机化设置中,强可处理性 的指数等于1/(α+1/2),如果权重衰减足够快。本文还给出了下界以表明我们的结果本质上是最佳的。与之前的相关工作相比,本文在实现潜力和误差界与问题维度无关方面取得了显著进展。其他已知的达到最优误差界的算法,如基于Frolov方法的算法,在高维情况下难以实现。本文适配了一种较少为人知的随机化技术,该技术由Bakhvalov于1961年提出。该算法基于秩为1的格点规则,利用整数生成向量可以轻松实现。使用简单的概率方法可以得到合适的生成向量。

摘要:

我们分析了一种新的随机算法,用于在[0,1]^d上对d变量函数进行数值积分,该函数属于带主导混合光滑度α≥0和产品权重1≥γ_1≥γ_2≥⋯>0的加权Sobolev空间。该算法基于秩为1的格点规则,并使用随机点数n。对于α>1/2的情况,我们证明该算法可以达到几乎最优的收敛阶O(n^{-α-1/2}),其中隐含常数与维度d无关,如果权重满足∑_{j=1}^∞ γ_j^{1/α}<∞。通过在格点规则中添加随机位移,对于更一般的α>0的情况,同样可以达到相同的收敛阶。这表明,在随机化设置中,强可处理性 的指数等于1/(α+1/2),如果权重衰减足够快。我们还给出了下界以表明我们的结果本质上是最佳的。与之前的相关工作相比,本文在实现潜力和误差界与问题维度无关方面取得了显著进展。其他已知的达到最优误差界的算法,如基于Frolov方法的算法,在高维情况下难以实现。本文适配了一种较少为人知的随机化技术,该技术由Bakhvalov于1961年提出。该算法基于秩为1的格点规则,利用整数生成向量可以轻松实现。使用简单的概率方法可以得到合适的生成向量。

英文摘要:

We analyze a new random algorithm for numerical integration of $d$-variate functions over $[0,1]^d$ from a weighted Sobolev space with dominating mixed smoothness $α\ge 0$ and product weights $1\geγ_1\geγ_2\ge\cdots>0$, where the functions are continuous and periodic when $α>1/2$. The algorithm is based on rank-$1$ lattice rules with a random number of points~$n$. For the case $α>1/2$, we prove that the algorithm achieves almost the optimal order of convergence of $\mathcal{O}(n^{-α-1/2})$, where the implied constant is independent of the dimension~$d$ if the weights satisfy $\sum_{j=1}^\infty γ_j^{1/α}<\infty$. The same rate of convergence holds for the more general case $α>0$ by adding a random shift to the lattice rule with random $n$. This shows, in particular, that the exponent of strong tractability in the randomized setting equals $1/(α+1/2)$, if the weights decay fast enough. We obtain a lower bound to indicate that our results are essentially optimal. This paper is a significant advancement over previous related works with respect to the potential for implementation and the independence of error bounds on the problem dimension. Other known algorithms which achieve the optimal error bounds, such as those based on Frolov's method, are very difficult to implement especially in high dimensions. Here we adapt a lesser-known randomization technique introduced by Bakhvalov in 1961. This algorithm is based on rank-$1$ lattice rules which are very easy to implement given the integer generating vectors. A simple probabilistic approach can be used to obtain suitable generating vectors.

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

↑