Error Analysis of the Dynamically Orthogonal Approximation of Time Dependent Random PDEs
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 work we consider quasi-optimal versions of the Stochastic Galerkin Method for solving linear elliptic PDEs with stochastic coeffcients. In particular, we consider the case of a finite number N of random inputs and an analytic dependence of the solu ...
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 work studies the asynchronous behavior of diffusion adaptation strategies for distributed optimization over networks. Under the assumed model, agents in the network may stop updating their estimates or may stop exchanging information at random times. ...
Peer-to-peer content dissemination applications suffer immensely from freeriders, i.e., nodes that do not provide their fair share. The Tit-for-Tat (TfT) incentives have received much attention as they help make such systems more robust against freeriding. ...
We carry out a comprehensive feasibility study for a real-time cm-level localisation of a predefined terrestrial target from a MAV-based autonomous platform. Specifically, we conduct an error propagation analysis which quantifies all potential error source ...
In this work we propose and analyze a weighted reduced basis method to solve elliptic partial differential equations (PDEs) with random input data. The PDEs are first transformed into a weighted parametric elliptic problem depending on a finite number of p ...
We investigate the convergence rate of approximations by finite sums of rank-1 tensors of solutions of multiparametric elliptic PDEs. Such PDEs arise, for example, in the parametric, deterministic reformulation of elliptic PDEs with random field inputs, ba ...
Society for Industrial and Applied Mathematics2010
This invention discloses new methods and security devices for authenticating documents and valuable products which may be applied to any support, including transparent synthetic materials and traditional opaque materials such as paper. The invention relate ...
This work proposes and analyzes a Smolyak-type sparse grid stochastic collocation method for the approximation of statistical quantities related to the solution of partial differential equations with random coeffcients and forcing terms ( input data of the ...
Society for Industrial and Applied Mathematics2008
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 th ...
Society for Industrial and Applied Mathematics2008
