MATHICSE Technical Report : Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity
Publications associées (131)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
This thesis consists of two parts. The first part is about a variant of Banach's fixed point theorem and its applications to several partial differential equations (PDE's), abstractly of the form [ \mathcal Lu + \mathcal Q(u) = f.] The main result of thi ...
This paper deals with asymptotic bifurcation, first in the abstract setting of an equation G(u) = lambda u, where G acts between real Hilbert spaces and lambda is an element of R, and then for square-integrable solutions of a second order non-linear ellipt ...
In this work, we apply a Matrix version of the so-called Discrete Empirical Interpolation (MDEIM) for the efficient reduction of nonaffine parametrized systems arising from the discretization of linear partial differential equations. Dealing with affinely ...
In this work, we apply a Matrix version of the so-called Discrete Empirical Interpolation (MDEIM) for the efficient reduction of nonaffine parametrized systems arising from the discretization of linear partial differential equations. Dealing with affinely ...
We consider a participatory sensing scenario where a group of private sensors observes the same phenomenon, such as air pollution. Since sensors need to be installed and maintained, owners of sensors are inclined to provide inaccurate or random data. We de ...
This project aims to study the concept of collocation method for isogeometric analysis with NURBS. We first introduce the isogeometric concept and its main advantages compared to finite elements methods. We then present the isogeometric collocation method ...
We prove that when a class of partial differential equations, generalized from the cable equation, is defined on tree graphs and the inputs are restricted to a spatially discrete, well chosen set of points, the Green's function (GF) formalism can be rewrit ...
In this work we develop an adaptive and reduced computational algorithm based on dimension-adaptive sparse grid approximation and reduced basis methods for solving highdimensional uncertainty quantification (UQ) problems. In order to tackle the computation ...
Pushed by the proliferation of antennas and of multiuser scenarios, matrices with random entries are appearing more and more frequently in information theory. This leads to the study of matrix channels, where the capacity depends on the distribution of the ...
We consider the simple random walk on Z(d) evolving in a random i.i.d. potential taking values in [0, +infinity). The potential is not assumed integrable, and can be rescaled by a multiplicative factor lambda > 0. Completing the work started in a companion ...