Random Sampling and Efficient Algorithms for Multiscale PDEs
نویسندگان
چکیده
منابع مشابه
Robust Domain Decomposition Algorithms for Multiscale PDEs
In this paper we describe a new class of domain deomposition preconditioners suitable for solving elliptic PDEs in highly fractured or heterogeneous media, such as arise in groundwater flow or oil recovery applications. Our methods employ novel coarsening operators which are adapted to the heterogeneity of the media. In contrast to standard methods (based on piecewise polynomial coarsening), th...
متن کاملRandom Sampling Based Algorithms for Efficient Semi-Key Discovery
We design efficient random sampling based algorithms for discovering keys and semi-keys in large tables. Given that these problems are provably hard, we adopt the approach of finding approximate solutions to save on time and space requirements. We first propose two natural measures for quantifying the approximation of a semi-key. For the problem of finding minimum keys, we develop efficient alg...
متن کاملDomain decomposition for multiscale PDEs
We consider additive Schwarz domain decomposition preconditioners for piecewise linear finite element approximations of elliptic PDEs with highly variable coefficients. In contrast to standard analyses, we do not assume that the coefficients can be resolved by a coarse mesh. This situation arises often in practice, for example in the computation of flows in heterogeneous porous media, in both t...
متن کاملStochastic elliptic multiscale PDES
In this paper Monte Carlo Finite Element (MC FE) approximations for elliptic homogenization problems with random coefficients which oscillate on n ∈ N a-priori known, separated length scales are considered. The convergence of multilevel MC FE (MLMC FE) discretizations is analyzed. In particular, it is considered that the multilevel FE discretization resolves the finest physical length scale, bu...
متن کاملEfficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallelism and external memory. In contrast to previously known work for parallel setups, our method is able to fulfill the three criteria of uniformity, work-optimality and balance among the processors simultaneously. To gua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2020
ISSN: 1064-8275,1095-7197
DOI: 10.1137/18m1207430