Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity
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.
Inspired by the BBM formula and by work of G. Leoni and D. Spector, we analyze the asymptotic behavior of two sequences of convex nonlocal functionals (Psi(n)(u)) and (Phi(n)(u)) which converge formally to the BV-norm of u. We show that pointwise convergen ...
We study the homogenization problem for the system of equations of dynamics of a mixture of liquid crystals with random structure. We consider a simplified form of the Ericksen-Leslie equations for an incompressible medium with inhomogeneous density with r ...
We consider the isotropic XY quantum spin chain in a random external field in the z direction, with single site distributions given by i.i.d. random variables times the critical decaying envelope j−1/2. Our motivation is the study of many-body localization ...
The interface control domain decomposition (ICDD) method of Discacciati, Gervasio, and Quarteroni [SIAM J. Control Optim., 51 (2013), pp. 3434-3458, doi:10.1137/120890764; J. Coupled Syst. Multiscale Dyn., 1 (2013), pp. 372-392, doi:10.1166/jcsmd.2013.1026 ...
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” ...
We consider elliptic random walks in i.i.d. random environments on . The main goal of this paper is to study under which ellipticity conditions local trapping occurs. Our main result is to exhibit an ellipticity criterion for ballistic behavior which exten ...
In this work we build on the classical adaptive sparse grid algorithm (T. Gerstner and M. Griebel, Dimension-adaptive tensor-product quadrature), obtaining an enhanced version capable of using non-nested collocation points, and supporting quadrature and in ...
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. We optimize hierarchies with geometric and ...
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 work we introduce the Multi-Index Stochastic Collocation method (MISC) for computing statistics of the solution of a PDE with random data. MISC is a combination technique based on mixed differences of spatial approximations and quadratures over the ...
