MATHICSE Technical Report : Regularity and sparse approximation of the recursive first moment equations for the lognormal Darcy problem
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 obtain new results pertaining to convergence and recurrence of multiple ergodic averages along functions from a Hardy field. Among other things, we confirm some of the conjectures posed by Frantzikinakis in [Fra10; Fra16] and obtain combinatorial applic ...
In this article, we establish novel decompositions of Gaussian fields taking values in suitable spaces of generalized functions, and then use these decompositions to prove results about Gaussian multiplicative chaos. We prove two decomposition theorems. Th ...
We study the Darcy boundary value problem with lognormal permeability field. We adopt a perturbation approach, expanding the solution in Taylor series around the nominal value of the coefficient, and approximating the expected value of the stochastic solut ...
Porto renaît, elle se reconstruit. Aujourd’hui, après des années d’oubli et d'abandon, la ville s’extrait brutalement de sa torpeur. Ce changement radical, porté par un tourisme grandissant, favorise la spéculation immobilière: les bâtiments abandonnés et ...
We consider design of sparse controllers for a stochastic linear system with infinite horizon quadratic objective. We formulate the non-sparse optimal solution through a semidefinite program for the second order moments of the states and inputs. Given that ...
We propose a novel sparse dictionary learning method for planar shapes in the sense of Kendall, namely configurations of landmarks in the plane considered up to similitudes. Our shape dictionary method provides a good trade-off between algorithmic simplici ...
We study an elliptic equation with stochastic coefficient modeled as a lognormal random field. A perturbation approach is adopted, expanding the solution in Taylor series around the nominal value of the coefficient. The resulting recursive deterministic pr ...
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 ...
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” ...
In this paper we make a survey of some recent developments of the theory of Sobolev spaces W-1,W-q (X, d, m), 1 < q < infinity, in metric measure spaces (X, d, m). In the final part of the paper we provide a new proof of the reflexivity of the Sobolev spac ...
