Random Sampling and Efficient Algorithms for Multiscale PDEs
arXiv:1807.08848
Abstract
We describe a numerical framework that uses random sampling to efficiently capture low-rank local solution spaces of multiscale PDE problems arising in domain decomposition. In contrast to existing techniques, our method does not rely on detailed analytical understanding of specific multiscale PDEs, in particular, their asymptotic limits. We present the application of the framework on two examples --- a linear kinetic equation and an elliptic equation with rough media. On these two examples, this framework achieves the asymptotic preserving property for the kinetic equations and numerical homogenization for the elliptic equations.
References in corpus (11)
- Generalized Multiscale Finite Element Methods (GMsFEM)
- A class of asymptotic preserving schemes for kinetic equations and related problems with stiff sources
- Convergence Rates in L^2 for Elliptic Homogenization Problems
- An analysis of a class of variational multiscale methods based on subspace decomposition
- Asymptotic-Preserving Schemes for Fluid Models of Plasmas
- Implicit Asymptotic Preserving Method for Linear Transport Equations
- Diffusion approximations and domain decomposition method of linear transport equations: asymptotics and numerics
- Validity and regularization of classical half-space equations
- A Heterogeneous Stochastic FEM Framework for Elliptic PDEs
- Uncertain Loading and Quantifying Maximum Energy Concentration within Composite Structures
- Randomized sampling for basis functions construction in generalized finite element methods