A posteriori error estimation for partial differential equations with random input data
Publications associées (145)
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.
The study of seeded randomness extractors is a major line of research in theoretical computer science. The goal is to construct deterministic algorithms which can take a weak random source x with min-entropy k and a uniformly random seed Y of length d, and ...
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 ...
The estimation of a random vector with independent components passed through a linear transform followed by a componentwise (possibly nonlinear) output map arises in a range of applications. Approximate message passing (AMP) methods, based on Gaussian appr ...
We develop a new reduced basis (RB) method for the rapid and reliable approximation of parametrized elliptic eigenvalue problems. The method hinges upon dual weighted residual type a posteriori error indicators which estimate, for any value of the paramete ...
When using Newton iterations to solve nonlinear parametrized PDEs in the context of Reduced Basis (RB)methods, the assembling of the RB arrays in the online stage depends in principle on the high-fidelityapproximation. This task is even more challenging wh ...
We propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolera ...
We develop a canonical framework for the study of the problem of registration of multiple point processes subjected to warping, known as the problem of separation of amplitude and phase variation. The amplitude variation of a real random function {Y(x) : x ...
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 ...
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 ...
We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first k eigenvectors of the similarity matrix' Laplacian, whose computati ...