In this paper, we propose a multi-scale discontinuous Galerkin (DG) method for second-order elliptic problems with curvilinear unidirectional rough coefficients by choosing a special non-polynomial approximation space. The key ingredient of the method lies in the incorporation of the local oscillatory features of the differential operators into the approximation space so as to capture the multi-scale solutions without having to resolve the finest scales. The unidirectional feature of the rough coefficients allows us to construct the basis functions of the DG non-polynomial approximation space explicitly, thereby greatly increasing the algorithm efficiency. Detailed error estimates for two-dimensional second-order DG methods are derived, and a general guidance on how to construct such non-polynomial basis is discussed. Numerical examples are also presented to validate and demonstrate the effectiveness of the algorithm.

Local multiscale methods often construct multiscale basis functions in the offline stage without taking into account input parameters, such as source terms, boundary conditions, and so on. These basis functions are then used in the online stage with a specific input parameter to solve the global problem at a reduced computational cost. Recently, online approaches have been introduced, where multiscale basis functions are adaptively constructed in some regions to reduce the error significantly. In multiscale methods, it is desired to have only 12 iterations to reduce the error to a desired threshold. Using Generalized Multiscale Finite Element Framework [10], it was shown that by choosing sufficient number of offline basis functions, the error reduction can be made independent of physical parameters, such as scales and contrast. In this paper, our goal is to improve this. Using our recently proposed approach [4] and

In this paper, we consider an online basis enrichment mixed generalized multiscale method with oversampling, for solving flow problems in highly heterogeneous porous media. This is an exten-sion of the online mixed generalized multiscale method [6]. The multiscale online basis functions are computed by solving a Neumann problem in an over-sampled domain, instead of a standard neighborhood of a coarse face. We are motivated by the restricted domain decomposition method. Extensive numerical experiments are presented to demonstrate the performance of our methods for both steady-state flow, and two-phase flow and transport problems.

In this paper, we introduce a new adaptive data analysis method to study trend and instantaneous frequency of nonlinear and nonstationary data. This method is inspired by the Empirical Mode Decomposition method (EMD) and the recently developed compressed (compressive) sensing theory. The main idea is to look for the sparsest representation of multiscale data within the largest possible dictionary consisting of intrinsic mode functions of the form {a(t) cos(θ(t))}, where a ∈ V (θ), V (θ) consists of the functions smoother than cos(θ(t)) and θ   0. This problem can be formulated as a nonlinear l0 optimization problem. In order to solve this optimization problem, we propose a nonlinear matching pursuit method by generalizing the classical matching pursuit for the l0 optimization problem. One important advantage of this nonlinear matching pursuit method is it can be implemented very efficiently and is very stable to noise. Further, we provide an error analysis of our nonlinear matching pursuit method under certain scale separation assumptions. Extensive numerical examples will be given to demonstrate the robustness of our method and comparison will be made with the state-of-the-art methods. We also apply our method to study data without scale separation, and data with incomplete or under-sampled data.

No abstract uploaded!