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.
This thesis addresses the development and implementation of efficient and parallel algorithms for the numerical simulation of Fluid-Structure Interaction (FSI) problems in hemodynamics. Indeed, hemodynamic conditions in large arteries are significantly aff ...
We are interested in the approximation of partial differential equations on domains decomposed into two (or several) subdomains featuring non-conforming interfaces. The non-conformity may be due to different meshes and/or different polynomial degrees used ...
In this work we provide a convergence analysis for the quasi-optimal version of the sparse-grids stochastic collocation method we presented in a previous work: “On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods” ...
Aquatic ecologists have recently employed dynamic models to estimate aquatic ecosystem metabolism. All approaches involve numerically solving a differential equation describing dissolved oxygen (DO) dynamics. Although the DO differential equation can be so ...
Association for the Sciences of Limnology and Oceanography2016
We propose and analyze a novel Multi Index Monte Carlo (MIMC) method for weak approximation of stochastic models that are described in terms of differential equations either driven by random measures or with random coefficients. The MIMC method is both a s ...
We study the convergence rate of the moment-sum-of-squares hierarchy of semidefinite programs for optimal control problems with polynomial data. It is known that this hierarchy generates polynomial under-approximations to the value function of the optimal ...
We are interested in the approximation of partial differential equations on domains decomposed into two (or several) subdomains featuring non-conforming interfaces. The non-conformity may be due to different meshes and/or different polynomial degrees used ...
We analyze the recent Multi-index Stochastic Collocation (MISC) method for computing statistics of the solution of a partial differential equation with random data, where the random coefficient is parametrized by means of a countable sequence of terms in a ...
In this paper we present some heuristic strategies to compute rapid and reliable approximations to stability factors in nonlinear, inf-sup stable parametrized PDEs. The efficient evaluation of these quantities is crucial for the rapid construction of a pos ...
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 ...