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

截断维度分解中的近似误差

Approximation Errors in Truncated Dimensional Decompositions

The University of Iowa(爱荷华大学)

Sharif Rahman

AI总结:

本文分析了参考维度分解(RDD)和方差分析维度分解(ADD)两种多变量函数分解方法的误差,推导出截断RDD近似误差的上下界公式,揭示RDD近似误差比ADD大2^{S+1}倍,表明ADD更精确。

摘要:

本文主要探讨了两种多变量函数分解方法——参考维度分解(RDD)和方差分析维度分解(ADD)的误差分析。新公式给出了在随机选择参考点时,双变量和任意截断的RDD近似误差的上下界,从而为比较RDD和ADD近似方法提供了依据。公式表明,对于N变量函数的S维RDD近似,其期望误差至少是S维ADD近似的2^{S+1}倍。因此,ADD近似比RDD近似更精确。分析还发现,RDD近似在任意选择的参考点下是次优的,而ADD近似始终产生最小误差。因此,RDD近似应谨慎使用。

英文摘要:

The main theme of this paper is error analysis for approximations derived from two variants of dimensional decomposition of a multivariate function: the referential dimensional decomposition (RDD) and analysis-of-variance dimensional decomposition (ADD). New formulae are presented for the lower and upper bounds of the expected errors committed by bivariately and arbitrarily truncated RDD approximations when the reference point is selected randomly, thereby facilitating a means for weighing RDD against ADD approximations. The formulae reveal that the expected error from the S-variate RDD approximation of a function of N variables, where $0 \le S < N < \infty$, is at least $2^{S+1}$ times greater than the error from the S-variate ADD approximation. Consequently, ADD approximations are exceedingly more precise than RDD approximations. The analysis also finds the RDD approximation to be sub-optimal for an arbitrarily selected reference point, whereas the ADD approximation always results in minimum error. Therefore, the RDD approximation should be used with caution.

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

↑