arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1109.4998math.NAcs.NA
收藏

随机权重、稳健的格规则和 cbc$r$c 算法的几何

Random weights, robust lattice rules and the geometry of the cbc$r$c algorithm

The University of New South Wales(新南威尔士大学)

Josef Dick

AI总结:

本文研究随机权重下格规则的稳健构造,提出 cbc$r$c 算法,该算法对权重子空间同时有效,将权重选择负担转移到格规则构造上。

摘要:

本文研究格规则,即用于逼近单位立方体 $[0,1]^s$ 上被积函数的求积公式,来自一个加权再生核希尔伯特空间。我们假设权重是具有给定均值和方差的独立随机变量,原因有二,均源于实际应用:(i) 实践中通常不知道如何选择权重。因此,通过假设权重是随机变量,我们获得了对权重稳健的格规则构造。这在一定程度上消除了仔细选择权重的必要性。(ii) 实践中,使用同一个格规则处理许多不同的被积函数是很方便的。每个被积函数的最佳权重选择可能有所不同,因此将权重视为随机变量符合格规则在应用中的使用方式。我们还研究了一个使用 $r$ 个约束的推广版本,称为 cbc$r$c(带 $r$ 约束的逐分量)算法。我们证明,由 cbc$r$c 算法生成的格规则对所选权重 $oldsymbolγ^{(1)},..., oldsymbolγ^{(r)}$ 张成的子空间中的所有权重同时有效。因此,在实际应用中,无需找到一组权重,只需找到一个 $r$ 维凸多面体,其中包含最优权重。该方法的代价是误差上界和格规则构造成本中的一个因子 $r$。因此,精确确定一组权重的负担可以转移到构造好的格规则上。

英文摘要:

In this paper we study lattice rules which are cubature formulae to approximate integrands over the unit cube $[0,1]^s$ from a weighted reproducing kernel Hilbert space. We assume that the weights are independent random variables with a given mean and variance for two reasons stemming from practical applications: (i) It is usually not known in practice how to choose the weights. Thus by assuming that the weights are random variables, we obtain robust constructions (with respect to the weights) of lattice rules. This, to some extend, removes the necessity to carefully choose the weights. (ii) In practice it is convenient to use the same lattice rule for many different integrands. The best choice of weights for each integrand may vary to some degree, hence considering the weights random variables does justice to how lattice rules are used in applications. We also study a generalized version which uses $r$ constraints which we call the cbc$r$c (component-by-component with $r$ constraints) algorithm. We show that lattice rules generated by the cbc$r$c algorithm simultaneously work well for all weights in a subspace spanned by the chosen weights $\boldsymbolγ^{(1)},..., \boldsymbolγ^{(r)}$. Thus, in applications, instead of finding one set of weights, it is enough to find an $r$ dimensional convex polytope in which the optimal weights lie. The price for this method is a factor $r$ in the upper bound on the error and in the construction cost of the lattice rule. Thus the burden of determining one set of weights very precisely can be shifted to the construction of good lattice rules.

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

↑