Convergence Analysis For Spectral Approximation To A Scalar Transport Equation With A Random Wave Speed

Vsp Bv, 2012
Journal paper

Abstract

This paper is concerned with the initial-boundary value problems of scalar transport equations with uncertain transport velocities. It was demonstrated in our earlier works that regularity of the exact solutions in the random spaces (or the parametric spaces) can be determined by the given data. In turn, these regularity results are crucial to convergence analysis for high order numerical methods. In this work, we will prove the spectral convergence of the stochastic Galerkin and collocation methods under some regularity results or assumptions. As our primary goal is to investigate the errors introduced by discretizations in the random space, the errors for solving the corresponding deterministic problems will be neglected.

Official source

https://infoscience.epfl.ch/record/185741?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts

Related publications

This work proposes and analyzes an anisotropic sparse grid stochastic collocation method for solving partial differential equations with random coefficients and forcing terms ( input data of the model). The method consists of a Galerkin approximation in the space variables and a collocation, in probability space, on sparse tensor product grids utilizing either Clenshaw-Curtis or Gaussian knots. Even in the presence of nonlinearities, the collocation approach leads to the solution of uncoupled deterministic problems, just as in the Monte Carlo method. This work includes a priori and a posteriori procedures to adapt the anisotropy of the sparse grids to each given problem. These procedures seem to be very effective for the problems under study. The proposed method combines the advantages of isotropic sparse collocation with those of anisotropic full tensor product collocation: the first approach is effective for problems depending on random variables which weigh approximately equally in the solution, while the benefits of the latter approach become apparent when solving highly anisotropic problems depending on a relatively small number of random variables, as in the case where input random variables are Karhunen-Loeve truncations of "smooth" random fields. This work also provides a rigorous convergence analysis of the fully discrete problem and demonstrates ( sub) exponential convergence in the asymptotic regime and algebraic convergence in the preasymptotic regime, with respect to the total number of collocation points. It also shows that the anisotropic approximation breaks the curse of dimensionality for a wide set of problems. Numerical examples illustrate the theoretical results and are used to compare this approach with several others, including the standard Monte Carlo. In particular, for moderately large-dimensional problems, the sparse grid approach with a properly chosen anisotropy seems to be very efficient and superior to all examined methods.

Society for Industrial and Applied Mathematics2008

Well-Posedness, Regularity, and Convergence Analysis of the Finite Element Approximation of a Generalized Robin Boundary Value Problem

Claudia Maria Colciago, Alfio Quarteroni

In this paper, we propose the mathematical and finite element analysis of a second-order partial differential equation endowed with a generalized Robin boundary condition which involves the Laplace--Beltrami operator by introducing a function space

H^1(\Omega; \Gamma)

H^1(\Omega)

-functions with

H^1(\Gamma)

-traces, where

\Gamma \subseteq \partial \Omega

. Based on a variational method, we prove that the solution of the generalized Robin boundary value problem possesses a better regularity property on the boundary than in the case of the standard Robin problem. We numerically solve generalized Robin problems by means of the finite element method with the aim of validating the theoretical rates of convergence of the error in the norms associated to the space

H^1(\Omega; \Gamma)

Society for Industrial and Applied Mathematics2015

Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity

Fabio Nobile, Lorenzo Tamellini

We analyze the recent Multi-index Stochastic Collocation (MISC) method for computing statistics of the solution of a partial differential equation (PDE) with random data, where the random coefficient is parametrized by means of a countable sequence of terms in a suitable expansion. MISC is a combination technique based on mixed differences of spatial approximations and quadratures over the space of random data, and naturally, the error analysis uses the joint regularity of the solution with respect to both the variables in the physical domain and parametric variables. In MISC, the number of problem solutions performed at each discretization level is not determined by balancing the spatial and stochastic components of the error, but rather by suitably extending the knapsack-problem approach employed in the construction of the quasi optimal sparse-grids and Multi-index Monte Carlo methods, i.e., we use a greedy optimization procedure to select the most effective mixed differences to include in the MISC estimator. We apply our theoretical estimates to a linear elliptic PDE in which the log-diffusion coefficient is modeled as a random field, with a covariance similar to a Matérn model, whose realizations have spatial regularity determined by a scalar parameter. We conduct a complexity analysis based on a summability argument showing algebraic rates of convergence with respect to the overall computational work. The rate of convergence depends on the smoothness parameter, the physical dimensionality and the efficiency of the linear solver. Numerical experiments show the effectiveness of MISC in this infinite dimensional setting compared with the Multi-index Monte Carlo method and compare the convergence rate against the rates predicted in our theoretical analysis.

2016