Stochastic polynomial chaos based algorithm for solving PDEs with random coefficients

A generalization of a polynomial chaos-based algorithm for solving PDEs with random input data is suggested. The input random field is assumed to be defined by its mean and correlation function. The method uses the Karhunen–Loève expansion, in its analytical form, for the input random field. Potenti...

Full description

Saved in:
Bibliographic Details
Published inMonte Carlo methods and applications Vol. 20; no. 4; pp. 279 - 289
Main Authors Shalimova, Irina A., Sabelfeld, Karl K.
Format Journal Article
LanguageEnglish
Published Berlin De Gruyter 01.12.2014
Walter de Gruyter GmbH
Subjects
Online AccessGet full text
ISSN0929-9629
1569-3961
DOI10.1515/mcma-2014-0006

Cover

More Information
Summary:A generalization of a polynomial chaos-based algorithm for solving PDEs with random input data is suggested. The input random field is assumed to be defined by its mean and correlation function. The method uses the Karhunen–Loève expansion, in its analytical form, for the input random field. Potentially, however, if desired, the Karhunen–Loève expansion can be also constructed by a randomized singular value decomposition of the correlation function recently suggested in our paper [Math. Comput. Simulation 82 (2011), 295–317]. The polynomial chaos expansion is then constructed by resolving a probabilistic collocation-based system of linear equations. The method is compared against a direct Monte Carlo method which solves repeatedly many times the PDE for a set of samples of the input random field. Along with the commonly used statistical characteristics like the mean and variance of the solution, we were able to calculate more sophisticated functionals like the instant velocity samples and the mean for Eulerian and Lagrangian velocity fields.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0929-9629
1569-3961
DOI:10.1515/mcma-2014-0006