4.5 Article

Extending bluff-and-fix estimates for polynomial chaos expansions

期刊

JOURNAL OF COMPUTATIONAL SCIENCE
卷 50, 期 -, 页码 -

出版社

ELSEVIER

关键词

Polynomial chaos; Galerkin projections; Stochastic differential equations; Numerical PDE solvers; Spectral methods

向作者/读者索取更多资源

Polynomial chaos methods are used to approximate the solution to PDEs with stochastic inputs by expressing the solution as a truncated infinite polynomial expansion. A promising iterative strategy (bluff-and-fix) is introduced to address challenges in reusing existing solutions and choosing variables to estimate accurately, showing that bluff-and-fix can be more effective than monolithic methods. This extended version of the study demonstrates how bluff-and-fix successfully allows for choice in accurately approximating variables in estimating statistical properties of the system solution.
Polynomial chaos methods, which are part of a broader class known as stochastic Galerkin schemes, can be used to approximate the solution to a PDE with uncertainties represented by stochastic inputs or parameters. The stochastic solution is expressed as an infinite polynomial expansion truncated to M + 1 terms. The approach is then to derive a resulting system of coupled, deterministic PDEs and solve this system with standard numerical techniques. Some challenges with conventional numeric techniques applied in this context are as follows: (1) the solution to a polynomial chaos M system cannot easily reuse an already existing computer solution to an M-0 system for some M-0 < M, and (2) there is no flexibility around choosing which variables in an M system are more important or advantageous to estimate accurately. This latter point is especially relevant when, rather than focusing on the PDE solution itself, the objective is to approximate some function of the PDE solution that weights the solution variables with relative levels of importance. In Lyman and Iaccarino (2020) [1], we first present a promising iterative strategy (bluff-and-fix) to address challenge (1); we find that numerical estimates of the accuracy and efficiency demonstrate that bluff-and-fix can be more effective than using monolithic methods to solve a whole M system directly. This paper is an extended version of Lyman and Iaccarino (2020) [1] that showcases how bluff-and-fix successfully addresses challenge (2) as well by allowing for choice in which variables are approximated more accurately, in particular when estimating statistical properties such as the mean and variance of an.. system solution.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据