隐藏权重——具有保证误差界的CBC黑箱算法
Hiding the weights -- CBC black box algorithms with a guaranteed error bound
AI总结:
本文提出两种新的CBC算法,在给定混合一阶导数的界的情况下,生成具有保证均方误差界的随机移位格点规则,从而避免了用户需要指定权重的问题,同时比较了产品权重和产品与顺序依赖权重的算法性能。
摘要:
组件-逐个构造(CBC)算法是一种用于构造良好生成向量以高效计算高维积分的算法,该积分是在Sloan和Wóźniakowski引入的“加权”函数空间设置中进行的。定义此类空间的“权重”是CBC算法的输入,因此一个自然的问题是,对于给定的问题,如何选择这些权重?本文介绍了两种新的CBC算法,给定混合一阶导数的界,生成具有保证均方误差界的随机移位格点规则。这消除了用户需要指定权重的必要性。我们处理了“产品权重”和“产品与顺序依赖(POD)权重”。数值表格比较了这两种算法在各种假设的混合一阶导数界下的表现,并提供了关于均方积分误差的严格上界。
英文摘要:
The component-by-component (CBC) algorithm is a method for constructing good generating vectors for lattice rules for the efficient computation of high-dimensional integrals in the "weighted" function space setting introduced by Sloan and Woźniakowski. The "weights" that define such spaces are needed as inputs into the CBC algorithm, and so a natural question is, for a given problem how does one choose the weights? This paper introduces two new CBC algorithms which, given bounds on the mixed first derivatives of the integrand, produce a randomly shifted lattice rule with a guaranteed bound on the root-mean-square error. This alleviates the need for the user to specify the weights. We deal with "product weights" and "product and order dependent (POD) weights". Numerical tables compare the two algorithms under various assumed bounds on the mixed first derivatives, and provide rigorous upper bounds on the root-mean-square integration error.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。