Adaptive multi-element polynomial chaos with discrete measure: Algorithms and application to SPDEs

• Published in: Applied numerical mathematics Vol. 90; pp. 91 - 110
• Main Authors: Zheng, Mengdi, Wan, Xiaoliang, Karniadakis, George Em
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.04.2015
• Subjects: Accuracy; Adaptive algorithms; Algorithms; Charlier polynomials; Construction; Criteria; Data-driven model; Discrete–continuous inputs; KdV equation; Mathematical analysis; Mathematical models; Polynomials; Stochastic collocation; KdV equation; Discrete–continuous inputs; Stochastic collocation; Data-driven model; Charlier polynomials
• ISSN: 0168-9274; 1873-5460
• DOI: 10.1016/j.apnum.2014.11.006

We develop a multi-element probabilistic collocation method (ME-PCM) for arbitrary discrete probability measures with finite moments and apply it to solve partial differential equations with random parameters. The method is based on numerical construction of orthogonal polynomial bases in terms of a discrete probability measure. To this end, we compare the accuracy and efficiency of five different constructions. We develop an adaptive procedure for decomposition of the parametric space using the local variance criterion. We then couple the ME-PCM with sparse grids to study the Korteweg–de Vries (KdV) equation subject to random excitation, where the random parameters are associated with either a discrete or a continuous probability measure. Numerical experiments demonstrate that the proposed algorithms lead to high accuracy and efficiency for hybrid (discrete–continuous) random inputs.