.png){kind=icon}
返回
STOCHASTIC COLLOCATION METHODS VIA l1 MINIMIZATION USING RANDOMIZED QUADRATURES
.png){kind=icon}
PRE
AI
DOI：10.1137/16M1059680.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We discuss the problem of approximating a multivariate function by a polynomial constructed via an l(1) minimization method using a randomly chosen subgrid of the corresponding tensor grid of Gaussian quadrature points. The input variables of the function are assumed to be independent random variables and thus the framework provides a nonintrusive way to construct the sparse polynomial chaos expansions, stemming from the motivating application of uncertainty quantification. We provide a theoretical analysis on the validity of the approach. The framework includes both the bounded measures, such as the uniform and the Chebyshev measures, and the unbounded measures which include the Gaussian measure. Several numerical examples are given to confirm the theoretical results.
Keyword:
compressive sensing
l(1) minimization
polynomial chaos expansions
uncertainty quantification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容