Adaptive multiscale model reduction with Generalized Multiscale Finite Element Methods

In this paper, we discuss a general multiscale model reduction framework based on multiscale finite element methods. We give a brief overview of related multiscale methods. Due to page limitations, the overview focuses on a few related methods and is not intended to be comprehensive. We present a general adaptive multiscale model reduction framework, the Generalized Multiscale Finite Element Method. Besides the method's basic outline, we discuss some important ingredients needed for the method's success. We also discuss several applications. The proposed method allows performing local model reduction in the presence of high contrast and no scale separation

Variational Multiscale Stabilization and the Exponential Decay of Fine-scale Correctors

This paper addresses the variational multiscale stabilization of standard finite element methods for linear partial differential equations that exhibit multiscale features. The stabilization is of Petrov-Galerkin type with a standard finite element trial space and a problem-dependent test space based on pre-computed fine-scale correctors. The exponential decay of these correctors and their localisation to local cell problems is rigorously justified. The stabilization eliminates scale-dependent pre-asymptotic effects as they appear for standard finite element discretizations of highly oscillatory problems, e.g., the poor $L^2$ approximation in homogenization problems or the pollution effect in high-frequency acoustic scattering

On Multiscale Methods in Petrov-Galerkin formulation

In this work we investigate the advantages of multiscale methods in Petrov-Galerkin (PG) formulation in a general framework. The framework is based on a localized orthogonal decomposition of a high dimensional solution space into a low dimensional multiscale space with good approximation properties and a high dimensional remainder space{, which only contains negligible fine scale information}. The multiscale space can then be used to obtain accurate Galerkin approximations. As a model problem we consider the Poisson equation. We prove that a Petrov-Galerkin formulation does not suffer from a significant loss of accuracy, and still preserve the convergence order of the original multiscale method. We also prove inf-sup stability of a PG Continuous and a Discontinuous Galerkin Finite Element multiscale method. Furthermore, we demonstrate that the Petrov-Galerkin method can decrease the computational complexity significantly, allowing for more efficient solution algorithms. As another application of the framework, we show how the Petrov-Galerkin framework can be used to construct a locally mass conservative solver for two-phase flow simulation that employs the Buckley-Leverett equation. To achieve this, we couple a PG Discontinuous Galerkin Finite Element method with an upwind scheme for a hyperbolic conservation law

Sparse Generalized Multiscale Finite Element Methods and their applications

In a number of previous papers, local (coarse grid) multiscale model reduction techniques are developed using a Generalized Multiscale Finite Element Method. In these approaches, multiscale basis functions are constructed using local snapshot spaces, where a snapshot space is a large space that represents the solution behavior in a coarse block. In a number of applications (e.g., those discussed in the paper), one may have a sparsity in the snapshot space for an appropriate choice of a snapshot space. More precisely, the solution may only involve a portion of the snapshot space. In this case, one can use sparsity techniques to identify multiscale basis functions. In this paper, we consider two such sparse local multiscale model reduction approaches. In the first approach (which is used for parameter-dependent multiscale PDEs), we use local minimization techniques, such as sparse POD, to identify multiscale basis functions, which are sparse in the snapshot space. These minimization techniques use $l_1$ minimization to find local multiscale basis functions, which are further used for finding the solution. In the second approach (which is used for the Helmholtz equation), we directly apply $l_1$ minimization techniques to solve the underlying PDEs. This approach is more expensive as it involves a large snapshot space; however, in this example, we can not identify a local minimization principle, such as local generalized SVD