关于Banach空间值积分的随机复杂性
On the randomized complexity of Banach space valued integration
AI总结:
研究Banach空间值积分在随机设置下的复杂性,探讨函数的最优收敛率与Banach空间几何的关系,证明当X具有等范数类型p时,n阶最小误差受约束。
摘要:
我们研究Banach空间值积分在随机设置下的复杂性。我们关注在d维单位立方体Q上r次连续可微的函数,其值在Banach空间X中,并研究最优收敛率与X几何的关系。结果表明,当X具有等范数类型p时,n阶最小误差被界于cn^{-r/d-1+1/p}。
英文摘要:
We study the complexity of Banach space valued integration in the randomized setting. We are concerned with $r$-times continuously differentiable functions on the $d$-dimensional unit cube $Q$, with values in a Banach space $X$, and investigate the relation of the optimal convergence rate to the geometry of $X$. It turns out that the $n$-th minimal errors are bounded by $cn^{-r/d-1+1/p}$ if and only if $X$ is of equal norm type $p$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。