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

通过基底选择增强多项式混沌展开的$\ell_1$-最小化估计

Enhancing $\ell_1$-minimization estimates of polynomial chaos expansions using basis selection

Sandia National Laboratories(桑迪亚国家实验室)

John D. Jakeman, Michael S. Eldred, Khachik Sargsyan

AI总结:

本文提出一种基底选择方法,结合$\ell_1$-最小化自适应确定多项式混沌展开的大型系数。通过非均匀随机变量和梯度信息提升基底选择的精度和性能。

摘要:

本文提出了一种基底选择方法,可用于与$\ell_1$-最小化结合,自适应确定多项式混沌展开(PCE)中的大系数。自适应构造产生各向异性基底集,在重要维度包含更多项,并限制增加互相关系数的不重要项,从而降低$\ell_1$-最小化性能。通过多个数值实验展示了重要特征和基底选择的准确性。具体而言,我们证明在给定计算预算下,基底选择能产生比预先固定基底更准确的PCE。此外,我们还展示了基底选择可应用于非均匀随机变量,并能利用梯度信息。

英文摘要:

In this paper we present a basis selection method that can be used with $\ell_1$-minimization to adaptively determine the large coefficients of polynomial chaos expansions (PCE). The adaptive construction produces anisotropic basis sets that have more terms in important dimensions and limits the number of unimportant terms that increase mutual coherence and thus degrade the performance of $\ell_1$-minimization. The important features and the accuracy of basis selection are demonstrated with a number of numerical examples. Specifically, we show that for a given computational budget, basis selection produces a more accurate PCE than would be obtained if the basis is fixed a priori. We also demonstrate that basis selection can be applied with non-uniform random variables and can leverage gradient information.

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

↑