# Stochastic Collocation with Kernel Density Estimation ∗ Howard

نویسندگان

##### چکیده

The stochastic collocation method has recently received much attention for solving partial differential equations posed with uncertainty, i.e., where coefficients in the differential operator, boundary terms or right-hand sides are random fields. Recent work has led to the formulation of an adaptive collocation method that is capable of accurately approximating functions with discontinuities and steep gradients. These methods, however, usually depend on an assumption that the random variables involved in expressing the uncertainty are independent with marginal probability distributions that are known explicitly. In this work we combine the adaptive collocation technique with kernel density estimation to approximate the statistics of the solution when the joint distribution of the random variables is unknown. 1. Problem Statement. Let (Ω,Σ, P ) be a complete probability space with sample space Ω, σ-algebra Σ ⊂ 2 and probability measure P : Σ → [0, 1]. Let D ⊂ R be a d-dimensional bounded domain with boundary ∂D. We investigate partial differential equations (PDEs) of the form L(x, ω;u) = f(x), ∀x ∈ D, ω ∈ Ω (1.1) B(x, ω;u) = g(x), ∀x ∈ ∂D, ω ∈ Ω. Here L is a partial differential operator with boundary operator B, both of which can depend on the random parameter ω. As a consequence of the Doob-Dynkin lemma, it follows that u is also a random field, dependent on both the spatial location x and the event ω. In order to work numerically with the expressions in (1.1), we must first represent the operators in terms of a finite number of random variables ξ = [ξ1, ξ2, ..., ξM ] . This is often accomplished using a truncated Karhunen-Loève (KL) expansion [13]. If we denote Γ = Image(ξ), then we can write (1.1) as L(x, ξ;u) = f(x), ∀x ∈ D, ξ ∈ Γ (1.2) B(x, ξ;u) = g(x), ∀x ∈ ∂D, ξ ∈ Γ. For a given realization of the random vector ξ, the system (1.2) is a deterministic partial differential equation that can be solved using a deterministic solver. Throughout this paper we assume that D, L, B, f , and g are defined so that the above problem (1.2) is well posed for all values of ξ ∈ Γ. In this paper we will explore several different sampling methods for solving the system (1.2). One is typically interested in methods that allow statistical properties of u to be computed. If ρ(ξ) denotes the joint probability density function of the random vector ξ, then the k moment of the solution u is defined as

برای دسترسی به متن کامل این مقاله و 23 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام کنیداگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

ورود##### منابع مشابه

## Fast Algorithms for the Solution of Stochastic Partial Differential Equations

Title of dissertation: FAST ALGORITHMS FOR THE SOLUTION OF STOCHASTIC PARTIAL DIFFERENTIAL EQUATIONS Christopher W. Miller, Doctor of Philosophy, 2012 Dissertation directed by: Professor Howard Elman Department of Computer Science Institute for Advanced Computer Studies We explore the performance of several algorithms for the solution of stochastic partial differential equations including the s...

متن کامل## Stochastic collocation with kernel density estimation

Article history: Received 7 September 2011 Received in revised form 25 June 2012 Accepted 26 June 2012 Available online 16 July 2012

متن کامل## An efficient Bayesian inference approach to inverse problems based on adaptive sparse grid collocation method

A new approach for modeling inverse problems using a Bayesian inference method is introduced. The Bayesian approach considers the unknown parameters as random variables and seeks the probabilistic distribution of the unknowns. By introducing the concept of the stochastic prior state space to the Bayesian formulation, we reformulate the deterministic forward problem as a stochastic one. The adap...

متن کامل## Comparison of the Gamma kernel and the orthogonal series methods of density estimation

The standard kernel density estimator suffers from a boundary bias issue for probability density function of distributions on the positive real line. The Gamma kernel estimators and orthogonal series estimators are two alternatives which are free of boundary bias. In this paper, a simulation study is conducted to compare small-sample performance of the Gamma kernel estimators and the orthog...

متن کامل## Kernel-based Collocation Methods versus Galerkin Finite Element Methods for Approximating Elliptic Stochastic Partial Differential Equations

We compare a kernel-based collocation method (meshfree approximation method) with a Galerkin finite element method for solving elliptic stochastic partial differential equations driven by Gaussian noise. The kernel-based collocation solution is a linear combination of reproducing kernels obtained from related differential and boundary operators centered at chosen collocation points. Its random ...

متن کاملافزودن به منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دسترسی به متن کامل این مقاله و 23 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام کنیداگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

ورود##### عنوان ژورنال:

دوره شماره

صفحات -

تاریخ انتشار 2011