A Weighted Reduced Basis Method For Elliptic Partial Differential Equations With Random Input Data
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.
We consider the numerical approximation of the stochastic Darcy problem with log-normal permeability field and propose a novel Multi Level Monte Carlo approach with a control variate variance reduction technique on each level. We model the log-permeability ...
We consider elliptic PDEs (partial differential equations) in the framework of isogeometric analysis, i.e., we treat the physical domain by means of a B-spline or NURBS mapping which we assume to be regular. The numerical solution of the PDE is computed by ...
In this work we discuss the Dynamically Orthogonal (DO) approximation of time dependent partial differential equations with random data. The approximate solution is expanded at each time instant on a time dependent orthonormal basis in the physical domain ...
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 s ...
This paper is concerned with the solution of heterogeneous problems by the interface control domain decomposition (ICDD) method, a strategy introduced for the solution of partial differential equations in computational domains partitioned into subdomains t ...
The article begins with a quantitative version of the martingale central limit theorem, in terms of the Kantorovich distance. This result is then used in the study of the homogenization of discrete parabolic equations with random i.i.d. coefficients. For s ...
We perform a general optimization of the parameters in the Multilevel Monte Carlo (MLMC) discretization hierarchy based on uniform discretization methods with general approximation orders and computational costs. Moreover, we discuss extensions to non-unif ...
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 ...
Several computational challenges arise when evaluating the failure probability of a given system in the context of risk prediction or reliability analysis. When the dimension of the uncertainties becomes high, well established direct numerical methods can ...
This volume presents selected papers from the ninth International Conference on Spectral and High Order Methods (ICOSAHOM’12) conference that was held at Gammarth, Tunisia, during the week June 25–29, 2012. These selected papers were refereed by members of ...
