SAMBA: Sparse Approximation of MomentBased Arbitrary Polynomial Chaos
Abstract
A new arbitrary Polynomial Chaos (aPC) method is presented for moderately highdimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately highdimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version ofmore »
 Authors:
 Publication Date:
 OSTI Identifier:
 22572343
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Journal of Computational Physics; Journal Volume: 320; Other Information: Copyright (c) 2016 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.; Country of input: International Atomic Energy Agency (IAEA)
 Country of Publication:
 United States
 Language:
 English
 Subject:
 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ACCURACY; ALGORITHMS; APPROXIMATIONS; CHAOS THEORY; DATA ANALYSIS; DISTRIBUTION; EFFICIENCY; NONLINEAR PROBLEMS; POLYNOMIALS; PROBABILITY; PROBABILITY DENSITY FUNCTIONS; QUADRATURES; STATISTICAL DATA; STOCHASTIC PROCESSES
Citation Formats
Ahlfeld, R., Email: r.ahlfeld14@imperial.ac.uk, Belkouchi, B., and Montomoli, F.. SAMBA: Sparse Approximation of MomentBased Arbitrary Polynomial Chaos. United States: N. p., 2016.
Web. doi:10.1016/J.JCP.2016.05.014.
Ahlfeld, R., Email: r.ahlfeld14@imperial.ac.uk, Belkouchi, B., & Montomoli, F.. SAMBA: Sparse Approximation of MomentBased Arbitrary Polynomial Chaos. United States. doi:10.1016/J.JCP.2016.05.014.
Ahlfeld, R., Email: r.ahlfeld14@imperial.ac.uk, Belkouchi, B., and Montomoli, F.. 2016.
"SAMBA: Sparse Approximation of MomentBased Arbitrary Polynomial Chaos". United States.
doi:10.1016/J.JCP.2016.05.014.
@article{osti_22572343,
title = {SAMBA: Sparse Approximation of MomentBased Arbitrary Polynomial Chaos},
author = {Ahlfeld, R., Email: r.ahlfeld14@imperial.ac.uk and Belkouchi, B. and Montomoli, F.},
abstractNote = {A new arbitrary Polynomial Chaos (aPC) method is presented for moderately highdimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately highdimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of MomentBased Arbitrary Polynomial Chaos. It is illustrated that for moderately highdimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10 different input distributions or histograms.},
doi = {10.1016/J.JCP.2016.05.014},
journal = {Journal of Computational Physics},
number = ,
volume = 320,
place = {United States},
year = 2016,
month = 9
}

Generalized polynomial chaos (gPC) expansions allow the representation of the solution of a stochastic system as a series of polynomial terms. The number of gPC terms increases dramatically with the dimension of the random input variables. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs if the evaluations of the system are expensive, the evaluation of the gPC expansion can be inaccurate due to overfitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solution, both in spacial and random domains, by coupling Bayesianmore »

A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
We propose an algorithm for recovering sparse orthogonal polynomial expansions via collocation. A standard sampling approach for recovering sparse polynomials uses Monte Carlo sampling, from the density of orthogonality, which results in poor function recovery when the polynomial degree is high. Our proposed approach aims to mitigate this limitation by sampling with respect to the weighted equilibrium measure of the parametric domain and subsequently solves a preconditionedmore » 
Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs
Generalized polynomial chaos (gPC) expansions allow us to represent the solution of a stochastic system using a series of polynomial chaos basis functions. The number of gPC terms increases dramatically as the dimension of the random input variables increases. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs when the corresponding deterministic solver is computationally expensive, evaluation of the gPC expansion can be inaccurate due to overfitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solutions, in both spatial and random domains, bymore » 
Adaptive sparse polynomial chaos expansion based on least angle regression
Polynomial chaos (PC) expansions are used in stochastic finite element analysis to represent the random model response by a set of coefficients in a suitable (socalled polynomial chaos) basis. The number of terms to be computed grows dramatically with the size of the input random vector, which makes the computational cost of classical solution schemes (may it be intrusive (i.e. of Galerkin type) or non intrusive) unaffordable when the deterministic finite element model is expensive to evaluate. To address such problems, the paper describes a non intrusive method that builds a sparse PC expansion. First, an original strategy for truncatingmore » 
Polynomial metamodels with canonical lowrank approximations: Numerical insights and comparison to sparse polynomial chaos expansions
The growing need for uncertainty analysis of complex computational models has led to an expanding use of metamodels across engineering and sciences. The efficiency of metamodeling techniques relies on their ability to provide statisticallyequivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing metamodels in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely themore »