Abstract

A non-intrusive method to get a multi-element Polynomial Chaos model is developed. This method is called ME-ACD, for Multi-Element based on Agglomerative Clustering on Derivatives. It aims at approximating a Quantity of Interest which presents discontinuities or irregularities making it difficult to be accurately approximated by standard Polynomial Chaos models. The method permits to efficiently split the parameter space and to train local polynomial models of lower degrees on every element where the local pieces of the Quantity of Interest are smoother. The algorithm is based on agglomerative clustering of the observations in a well-chosen abstract space taking into account the value of the Quantity of Interest and of its derivatives with respect to the stochastic input parameters. The same observations are used for both partitioning the space and training the local models. Several partitions of the parameter space are tested, and the one leading to local models minimising a cross-validation error is selected. Once the training observations are labelled with a class number indicating the element they are located in, a neural network classifier is trained to determine which local model to use for further evaluations. The method has proven to efficiently split the parameter space for a set of applications of moderate dimension. The piecewise chaos model is compared with the ones of a standard Polynomial Chaos non-intrusive method and of a Gradient Boosted Trees method in terms of accuracy.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call