Convergence of quasi-optimal Stochastic Galerkin methods for a class of PDES with random coefficients
78
TL;DR: In this article, a quasi-optimal version of the Stochastic Galerkin method for solving linear elliptic PDEs with stochastic coefficients was proposed and proved to have a sub-exponential convergence rate.
read more
Abstract: In this work we consider quasi-optimal versions of the Stochastic Galerkin method for solving linear elliptic PDEs with stochastic coefficients. In particular, we consider the case of a finite number N of random inputs and an analytic dependence of the solution of the PDE with respect to the parameters in a polydisc of the complex plane C^N. We show that a quasi-optimal approximation is given by a Galerkin projection on a weighted (anisotropic) total degree space and prove a (sub)exponential convergence rate. As a specific application we consider a thermal conduction problem with non-overlapping inclusions of random conductivity. Numerical results show the sharpness of our estimates.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Low-rank methods for high-dimensional approximation and model order reduction
TL;DR: The problem of best approximation in subsets of low-rank tensors is analyzed and its connection with the problem of optimal model reduction in low-dimensional reduced spaces is discussed.
497
Approximation of high-dimensional parametric PDEs *
Albert Cohen,Ronald A. DeVore +1 more
TL;DR: Results reveal that, at least on a theoretical level, the solution map can be well approximated by discretizations of moderate complexity, thereby showing how the curse of dimensionality is broken.
335
Stochastic finite element methods for partial differential equations with random input data
TL;DR: Several approaches to quantification of probabilistic uncertainties in the outputs of physical, biological, and social systems governed by partial differential equations with random inputs require, in practice, the discretization of those equations, including intrusive approaches such as stochastic Galerkin methods and non-intrusive approaches.
286
Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
TL;DR: In this article, an analytic extension of the solution map on a tensor product of ellipses in the complex domain is proposed to estimate the Legendre coefficients of u. The analytic extension is based on the holomorphic version of the implicit function theorem in Banach spaces and can be applied to a large variety of parametric PDEs.
257
Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
TL;DR: In this paper, the authors show that the least squares method is quasi-optimal in expectation in the univariate case, under suitable conditions that relate the number of samples with respect to the dimension of the polynomial space.
References
•Book
An Introduction to Copulas
Roger B. Nelsen
- 01 Jan 1999
TL;DR: This book discusses the fundamental properties of copulas and some of their primary applications, which include the study of dependence and measures of association, and the construction of families of bivariate distributions.
8.7K
•Book
Stochastic Finite Elements: A Spectral Approach
Roger Ghanem,Pol D. Spanos +1 more
- 20 Dec 1990
TL;DR: In this article, a representation of stochastic processes and response statistics are represented by finite element method and response representation, respectively, and numerical examples are provided for each of them.
6.6K
The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
TL;DR: This work represents the stochastic processes with an optimum trial basis from the Askey family of orthogonal polynomials that reduces the dimensionality of the system and leads to exponential convergence of the error.
High-Order Collocation Methods for Differential Equations with Random Inputs
Dongbin Xiu,Jan S. Hesthaven +1 more
TL;DR: A high-order stochastic collocation approach is proposed, which takes advantage of an assumption of smoothness of the solution in random space to achieve fast convergence and requires only repetitive runs of an existing deterministic solver, similar to Monte Carlo methods.
1.8K
A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
TL;DR: A rigorous convergence analysis is provided and exponential convergence of the “probability error” with respect to the number of Gauss points in each direction in the probability space is demonstrated, under some regularity assumptions on the random input data.