arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1107.1547stat.COmath.PRstat.ME
收藏

基于多项式混沌和证据理论的认知不确定性传播的近似区间方法

Approximate Interval Method for Epistemic Uncertainty Propagation using Polynomial Chaos and Evidence Theory

Gabriel Terejanu, Puneet Singla, Tarunraj Singh, Peter D. Scott

摘要:

本文建立在最近的一种方法,找到一个真正的函数使用多项式混沌展开的近似边界。给定一个具有紧支持概率分布的随机变量函数,直觉上是使用多项式混沌展开来量化响应中的不确定性,并丢弃所有提供的关于输出随机性的信息,只提取其紧支持的边界。为了求解多项式的边界范围,将多项式混沌展开变换为Bernstein形式,并利用Bernstein多项式的值域封闭性来求解响应的最小值和最大值。这个程序是用来传播Dempster-Shafer结构的封闭区间通过非线性函数,它是应用于代数挑战问题。

英文摘要:

The paper builds upon a recent approach to find the approximate bounds of a real function using Polynomial Chaos expansions. Given a function of random variables with compact support probability distributions, the intuition is to quantify the uncertainty in the response using Polynomial Chaos expansion and discard all the information provided about the randomness of the output and extract only the bounds of its compact support. To solve for the bounding range of polynomials, we transform the Polynomial Chaos expansion in the Bernstein form, and use the range enclosure property of Bernstein polynomials to find the minimum and maximum value of the response. This procedure is used to propagate Dempster-Shafer structures on closed intervals through nonlinear functions and it is applied on an algebraic challenge problem.

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

↑