返回
Time-dependent generalized polynomial chaos
DOI:10.1016/j.jcp.2010.07.020.png)
摘要
En 中文
Generalized polynomial chaos (gPC) has non-uniform convergence and tends to break down for long-time integration. The reason is that the probability density distribution (PDF) of the solution evolves as a function of time. The set of orthogonal polynomials associated with the initial distribution will therefore not be optimal at later times, thus causing the reduced efficiency of the method for long-time integration. Adaptation of the set of orthogonal polynomials with respect to the changing PDF removes the error with respect to long-time integration. In this method new stochastic variables and orthogonal polynomials are constructed as time progresses. In the new stochastic variable the solution can be represented exactly by linear functions. This allows the method to use only low order polynomial approximations with high accuracy. The method is illustrated with a simple decay model for which an analytic solution is available and subsequently applied to the three mode Kraichnan-Orszag problem with favorable results. (C) 2010 Elsevier Inc. All rights reserved.
Keyword:
Polynomial chaos
Monte-Carlo simulation
Stochastic differential equations
Time dependence
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
引用论文
Physical systems with random uncertainties: Chaos representations with arbitrary probability measure
Uncertainty Quantification and Polynomial Chaos Techniques in Computational Fluid Dynamics计算流体动力学中的不确定性量化和多项式混沌技术

