Answers are grounded in this paper and cite their sources.
Inspired by the reduced basis approach and modern numerical multiscale methods, we present a new framework for an efficient treatment of heterogeneous multiscale problems. The new approach is based on the idea of considering heterogeneous multiscale problems as parametrized partial differential equations where the parameters are smooth functions. We then construct, in an offline phase, a suitable localized reduced basis that is used in an online phase to efficiently compute approximations of the multiscale problem by means of a discontinuous Galerkin method on a coarse grid. We present our approach for elliptic multiscale problems and discuss an a posteriori error estimate that can be used in the construction process of the localized reduced basis. Numerical experiments are given to demonstrate the efficiency of the new approach.
No takes yet. Share an insight, caveat, or question.
Kaulmann et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: