On the optimal polynomial approximation of stochastic PDEs by Galerkin and Collocation methods
Related publications (44)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this article we study some necessary and sufficient conditions for the existence of solutions in W-0(1,infinity) (Omega; Lambda(k)) of the differential inclusion d omega is an element of E a.e. in Omega where E subset of Lambda(k+1) is a prescribed set. ...
The objective of this thesis is to develop reduced models for the numerical solution of optimal control, shape optimization and inverse problems. In all these cases suitable functionals of state variables have to be minimized. State variables are solutions ...
Isogeometric analysis (IGA) is a computational methodology recently developed to numerically approximate Partial Differential Equation (PDEs). It is based on the isogeometric paradigm, for which the same basis functions used to represent the geometry are t ...
In this project report, we first present the application of the finite elements method to the numerical approximation of elliptic and parabolic PDEs over two-dimensional domains. We then consider the theory and numerical approximation of optimal control pr ...
We propose a strategy for the systematic construction of the mimetic inner products on cochain spaces for the numerical approximation of partial differential equations on unstructured polygonal and polyhedral meshes. The mimetic inner products are locally ...
In this paper we present a compact review on the mostly used techniques for computational reduction in numerical approximation of partial differential equations. We highlight the common features of these techniques and provide a detailed presentation of th ...
In this work we provide a convergence analysis for the quasi-optimal version of the Stochastic Sparse Grid Collocation method we had presented in our previous work \On the optimal polynomial approximation of Stochastic PDEs by Galerkin and Collocation meth ...
Finite elements methods (FEMs) with numerical integration play a central role in numerical homogenization methods for partial differential equations with multiple scales, as the effective data in a homogenization problem can only be recovered from a micros ...
In this work we first focus on the Stochastic Galerkin approximation of the solution u of an elliptic stochastic PDE. We rely on sharp estimates for the decay of the coefficients of the spectral expansion of u on orthogonal polynomials to build a sequence ...
This paper discusses the upwinded local discontinuous Galerkin methods for the one-term/multi-term fractional ordinary differential equations (FODEs). The natural upwind choice of the numerical fluxes for the initial value problem for FODEs ensures stabili ...