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

乘积规则在经典光滑空间中是数值积分的最佳方法

Product rules are optimal for numerical integration in classical smoothness spaces

Johannes Kepler Universität(约翰内斯·开普勒大学);Universität Jena(耶拿大学);Columbia University(哥伦比亚大学);University of Warsaw(华沙大学)

Aicke Hinrichs, Erich Novak, Mario Ullrich, Henryk Wozniakowski

AI总结:

本文研究了在经典光滑空间中,使用n个函数值的最优算法在误差率n^{-r/d}下的表现,并证明了乘积规则在该条件下是最优的。

摘要:

我们主要研究在d维单位立方体上定义的实值函数的数值积分,这些函数的所有偏导数阶数不超过有限阶r≥1的都被限制在1以内。已知最优算法使用n个函数值可达到误差率n^{-r/d},其中隐藏常数依赖于r和d。本文证明了显式的误差界,且特别指出误差的最佳顺序为min{1, d n^{-r/d}},其中隐藏常数仅依赖于r,而不依赖于d。对于n=m^d,该最优顺序可通过(张量)乘积规则实现。我们还为在任意体积为1的开放域上定义的积分提供了下界。我们还简要讨论了这些积分下界如何应用于其他问题,如多变量逼近和优化。

英文摘要:

We mainly study numerical integration of real valued functions defined on the $d$-dimensional unit cube with all partial derivatives up to some finite order $r\ge1$ bounded by one. It is well known that optimal algorithms that use $n$ function values achieve the error rate $n^{-r/d}$, where the hidden constant depends on $r$ and $d$. Here we prove explicit error bounds without hidden constants and, in particular, show that the optimal order of the error is $\min \bigl\{1, d \, n^{-r/d}\bigr\}$, where now the hidden constant only depends on $r$, not on $d$. For $n=m^d$, this optimal order can be achieved by (tensor) product rules. We also provide lower bounds for integration defined over an arbitrary open domain of volume one. We briefly discuss how lower bounds for integration may be applied for other problems such as multivariate approximation and optimization.

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

↑