Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNumerical solution of fractional elliptic stochastic PDEs with spatial white noise
127
0
0.0
(
0
)
Added by
Kristin Kirchner
Publication date
2017
fields
Mathematical Statistics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The numerical approximation of solutions to stochastic partial differential equations with additive spatial white noise on bounded domains in $mathbb{R}^d$ is considered. The differential operator is given by the fractional power $L^beta$, $betain(0,1)$, of an integer order elliptic differential operator $L$ and is therefore non-local. Its inverse $L^{-beta}$ is represented by a Bochner integral from the Dunford-Taylor functional calculus. By applying a quadrature formula to this integral representation, the inverse fractional power operator $L^{-beta}$ is approximated by a weighted sum of non-fractional resolvents $(I + t_j^2 L)^{-1}$ at certain quadrature nodes $t_j>0$. The resolvents are then discretized in space by a standard finite element method. This approach is combined with an approximation of the white noise, which is based only on the mass matrix of the finite element discretization. In this way, an efficient numerical algorithm for computing samples of the approximate solution is obtained. For the resulting approximation, the strong mean-square error is analyzed and an explicit rate of convergence is derived. Numerical experiments for $L=kappa^2-Delta$, $kappa > 0$, with homogeneous Dirichlet boundary conditions on the unit cube $(0,1)^d$ in $d=1,2,3$ spatial dimensions for varying $betain(0,1)$ attest the theoretical results.
rate research
Read More
The numerical approximation of the solution to a stochastic partial differential equation with additive spatial white noise on a bounded domain is considered. The differential operator is assumed to be a fractional power of an integer order elliptic differential operator. The solution is approximated by means of a finite element discretization in space and a quadrature approximation of an integral representation of the fractional inverse from the Dunford-Taylor calculus. For the resulting approximation, a concise analysis of the weak error is performed. Specifically, for the class of twice continuously Frechet differentiable functionals with second derivatives of polynomial growth, an explicit rate of weak convergence is derived, and it is shown that the component of the convergence rate stemming from the stochasticity is doubled compared to the corresponding strong rate. Numerical experiments for different functionals validate the theoretical results.
In this paper, we consider the strong convergence of the time-space fractional diffusion equation driven by fractional Gaussion noise with Hurst index $Hin(frac{1}{2},1)$. A sharp regularity estimate of the mild solution and the numerical scheme constructed by finite element method for integral fractional Laplacian and backward Euler convolution quadrature for Riemann-Liouville time fractional derivative are proposed. With the help of inverse Laplace transform and fractional Ritz projection, we obtain the accurate error estimates in time and space. Finally, our theoretical results are accompanied by numerical experiments.
For semilinear stochastic evolution equations whose coefficients are more general than the classical global Lipschitz, we present results on the strong convergence rates of numerical discretizations. The proof of them provides a new approach to strong convergence analysis of numerical discretizations for a large family of second order parabolic stochastic partial differential equations driven by space-time white noises. We apply these results to the stochastic advection-diffusion-reaction equation with a gradient term and multiplicative white noise, and show that the strong convergence rate of a fully discrete scheme constructed by spectral Galerkin approximation and explicit exponential integrator is exactly $frac12$ in space and $frac14$ in time. Compared with the optimal regularity of the mild solution, it indicates that the spetral Galerkin approximation is superconvergent and the convergence rate of the exponential integrator is optimal. Numerical experiments support our theoretical analysis.
Numerical methods for stochastic partial differential equations typically estimate moments of the solution from sampled paths. Instead, we shall directly target the deterministic equations satisfied by the first and second moments, as well as the covariance. In the first part, we focus on stochastic ordinary differential equations. For the canonical examples with additive noise (Ornstein-Uhlenbeck process) or multiplicative noise (geometric Brownian motion) we derive these deterministic equations in variational form and discuss their well-posedness in detail. Notably, the second moment equation in the multiplicative case is naturally posed on projective-injective tensor product spaces as trial-test spaces. We construct Petrov-Galerkin discretizations based on tensor product piecewise polynomials and analyze their stability and convergence in these natural norms. In the second part, we proceed with parabolic stochastic partial differential equations with affine multiplicative noise. We prove well-posedness of the deterministic variational problem for the second moment, improving an earlier result. We then propose conforming space-time Petrov-Galerkin discretizations, which we show to be stable and quasi-optimal. In both parts, the outcomes are illustrated by numerical examples.
This paper studies numerical methods for the approximation of elliptic PDEs with lognormal coefficients of the form $-{rm div}(a abla u)=f$ where $a=exp(b)$ and $b$ is a Gaussian random field. The approximant of the solution $u$ is an $n$-term polynomial expansion in the scalar Gaussian random variables that parametrize $b$. We present a general convergence analysis of weighted least-squares approximants for smooth and arbitrarily rough random field, using a suitable random design, for which we prove optimality in the following sense: their convergence rate matches exactly or closely the rate that has been established in cite{BCDM} for best $n$-term approximation by Hermite polynomials, under the same minimial assumptions on the Gaussian random field. This is in contrast with the current state of the art results for the stochastic Galerkin method that suffers the lack of coercivity due to the lognormal nature of the diffusion field. Numerical tests with $b$ as the Brownian bridge confirm our theoretical findings.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
