Piecewise polynomial approximation of probability density functions with application to uncertainty quantification for stochastic pdes

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The probability density function (PDF) associated with a given set of samples is approximated by a piecewise-linear polynomial constructed with respect to a binning of the sample space. The kernel functions are a compactly supported basis for the space of such polynomials, i.e. finite element hat functions, that are centered at the bin nodes rather than at the samples, as is the case for the standard kernel density estimation approach. This feature naturally provides an approximation that is scalable with respect to the sample size. On the other hand, unlike other strategies that use a finite element approach, the proposed approximation does not require the solution of a linear system. In addition, a simple rule that relates the bin size to the sample size eliminates the need for bandwidth selection procedures. The proposed density estimator has unitary integral, does not require a constraint to enforce positivity, and is consistent. The proposed approach is validated through numerical examples in which samples are drawn from known PDFs. The approach is also used to determine approximations of (unknown) PDFs associated with outputs of interest that depend on the solution of a stochastic partial differential equation.

Cite

CITATION STYLE

APA

Capodaglio, G., & Gunzburger, M. (2020). Piecewise polynomial approximation of probability density functions with application to uncertainty quantification for stochastic pdes. In Lecture Notes in Computational Science and Engineering (Vol. 137, pp. 101–127). Springer. https://doi.org/10.1007/978-3-030-48721-8_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free