z-logo
open-access-imgOpen Access
Multi-Element Generalized Polynomial Chaos for Arbitrary Probability Measures
Author(s) -
Xiaoliang Wan,
George Em Karniadakis
Publication year - 2006
Publication title -
siam journal on scientific computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.674
H-Index - 147
eISSN - 1095-7197
pISSN - 1064-8275
DOI - 10.1137/050627630
Subject(s) - mathematics , polynomial chaos , random element , random variable , convergence of random variables , probability density function , random field , random function , orthogonal polynomials , probability measure , mathematical analysis , monte carlo method , statistics
We develop a multi-element generalized polynomial chaos (ME-gPC) method for arbitrary probability measures and apply it to solve ordinary and partial differential equations with stochastic inputs. Given a stochastic input with an arbitrary probability measure, its random space is decomposed into smaller elements. Subsequently, in each element a new random variable with respect to a conditional probability density function (PDF) is defined, and a set of orthogonal polynomials in terms of this random variable is constructed numerically. Then, the generalized polynomial chaos (gPC) method is implemented element-by-element. Numerical experiments show that the cost for the construction of orthogonal polynomials is negligible compared to the total time cost. Efficiency and convergence of ME-gPC are studied numerically by considering some commonly used random variables. ME-gPC provides an efficient and flexible approach to solving differential equations with random inputs, especially for problems related to long-term integration, large perturbation, and stochastic discontinuities.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom