Searcharxiv⌕ Search

arXiv subjects

Wing Tat Leung

Publications and source records attributed to Wing Tat Leung.

65 records · Page 4Linked to original sources

Re-iterated multiscale model reduction using the GMsFEM

Numerical homogenization and multiscale finite element methods construct effective properties on a coarse grid by solving local problems and extracting the average effective properties from these local solutions. In some cases, the solutions of local problems can be expensive to compute due to scale disparity. In this setting, one can basically apply a homogenization or multiscale method re-iteratively to solve for the local problems. This process is known as re-iterated homogenization and has many variations in the numerical context. Though the process seems to be a straightforward extension of two-level process, it requires some careful implementation and the concept development for problems without scale separation and high contrast. In this paper, we consider the Generalized Multiscale Finite Element Method (GMsFEM) and apply it iteratively to construct its multiscale basis functions. The main idea of the GMsFEM is to construct snapshot functions and then extract multiscale basis functions (called offline space) using local spectral decompositions in the snapshot spaces. The extension of this construction to several levels uses snapshots and offline spaces interchangebly to achieve this goal. At each coarse-grid scale, we assume that the offline space is a good approximation of the solution and use all possible offline functions or randomization as boundary conditions and solve the local problems in the offline space at the previous (finer) level, to construct snapshot space. We present an adaptivity strategy and show numerical results for flows in heterogeneous media and in perforated domains.

math.NA↗

Generalized multiscale finite element methods for space-time heterogeneous parabolic equations

In this paper, we consider local multiscale model reduction for problems with multiple scales in space and time. We developed our approaches within the framework of the Generalized Multiscale Finite Element Method (GMsFEM) using space-time coarse cells. The main idea of GMsFEM is to construct a local snapshot space and a local spectral decomposition in the snapshot space. Previous research in developing multiscale spaces within GMsFEM focused on constructing multiscale spaces and relevant ingredients in space only. In this paper, our main objective is to develop a multiscale model reduction framework within GMsFEM that uses space-time coarse cells. We construct space-time snapshot and offline spaces. We compute these snapshot solutions by solving local problems. A complete snapshot space will use all possible boundary conditions; however, this can be very expensive. We propose using randomized boundary conditions and oversampling. We construct the local spectral decomposition based on our analysis, as presented in the paper. We present numerical results to confirm our theoretical findings and to show that using our proposed approaches, we can obtain an accurate solution with low dimensional coarse spaces. We remark that the proposed method is a significant extension compared to existing methods, which use coarse cells in space only because of (1) the parabolic nature of cell solutions, (2) extra degrees of freedom associated with space-time cells, and (3) local boundary conditions in space-time cells.

math.NA↗

Online Adaptive Local Multiscale Model Reduction for Heterogeneous Problems in Perforated Domains

In this paper, we develop and analyze an adaptive multiscale approach for heterogeneous problems in perforated domains. In many applications, these problems have a multiscale nature arising because of the perforations, their geometries, the sizes of the perforations, and configurations. In this paper, we present a general offline/online procedure, which can adequately and adaptively represent the local degrees of freedom and derive appropriate coarse-grid equations. The main contributions of this paper are (1) the rigorous analysis of the offline approach (2) the development of the online procedures and their analysis (3) the development of adaptive strategies. We present an online procedure, which allows adaptively incorporating global information and is important for a fast convergence when combined with the adaptivity. Our methodology allows adding and guides constructing new online multiscale basis functions adaptively in appropriate regions. We present the convergence analysis of the online adaptive enrichment algorithm for the Stokes system. In particular, we show that the online procedure has a rapid convergence with a rate related to the number of offline basis functions, and one can obtain fast convergence by a sufficient number of offline basis functions, which are computed in the offline stage. To illustrate the performance of our method, we present numerical results with both small and large perforations. We see that only a few (1 or 2) online iterations can significantly improve the offline solution.

math.NA↗

Multiscale stabilization for convection-dominated diffusion in heterogeneous media

We develop a Petrov-Galerkin stabilization method for multiscale convection-diffusion transport systems. Existing stabilization techniques add a limited number of degrees of freedom in the form of bubble functions or a modified diffusion, which may not sufficient to stabilize multiscale systems. We seek a local reduced-order model for this kind of multiscale transport problems and thus, develop a systematic approach for finding reduced-order approximations of the solution. We start from a Petrov-Galerkin framework using optimal weighting functions. We introduce an auxiliary variable to a mixed formulation of the problem. The auxiliary variable stands for the optimal weighting function. The problem reduces to finding a test space (a reduced dimensional space for this auxiliary variable), which guarantees that the error in the primal variable (representing the solution) is close to the projection error of the full solution on the reduced dimensional space that approximates the solution. To find the test space, we reformulate some recent mixed Generalized Multiscale Finite Element Methods. We introduce snapshots and local spectral problems that appropriately define local weight and trial spaces. In particular, we use energy minimizing snapshots and local spectral decompositions in the natural norm associated with the auxiliary variable. The resulting spectral decomposition adaptively identifies and builds the optimal multiscale space to stabilize the system. We discuss the stability and its relation to the approximation property of the test space. We design online basis functions, which accelerate convergence in the test space, and consequently, improve stability. We present several numerical examples and show that one needs a few test functions to achieve an error similar to the projection error in the primal variable irrespective of the Peclet number.

math.NA↗

Goal-oriented adaptivity for GMsFEM

In this paper we develop two goal-oriented adaptive strategies for a posteriori error estimation within the generalized multiscale finite element framework. In this methodology, one seeks to determine the number of multiscale basis functions adaptively for each coarse region to efficiently reduce the error in the goal functional. Our first error estimator uses a residual based strategy where local indicators on each coarse neighborhood are the product of local indicators for the primal and dual problems, respectively. In the second approach, viewed as the multiscale extension of the dual weighted residual method (DWR), the error indicators are computed as the pairing of the local H^{-1} residual of the primal problem weighed by a projection into the primal space of the H_0^1 dual solution from an enriched space, over each coarse neighborhood. In both of these strategies, the goal-oriented indicators are then used in place of a standard residual-based indicator to mark coarse neighborhoods of the mesh for further enrichment in the form of additional multiscale basis functions. The method is demonstrated on high-contrast problems with heterogeneous multiscale coefficients, and is seen to outperform the standard residual based strategy with respect to efficient reduction of error in the goal function.

math.NA↗

Mixed GMsFEM for the simulation of waves in highly heterogeneous media

Numerical simulations of waves in highly heterogeneous media have important applications, but direct computations are prohibitively expensive. In this paper, we develop a new generalized multiscale finite element method with the aim of simulating waves at a much lower cost. Our method is based on a mixed Galerkin type method with carefully designed basis functions that can capture various scales in the solution. The basis functions are constructed based on some local snapshot spaces and local spectral problems defined on them. The spectral problems give a natural ordering of the basis functions in the snapshot space and allow systematically enrichment of basis functions. In addition, by using a staggered coarse mesh, our method is energy conserving and has block diagonal mass matrix, which are desirable properties for wave propagation. We will prove that our method has spectral convergence, and present numerical results to show the performance of the method.

math.NA↗

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.

math.NA↗

An online generalized multiscale discontinuous Galerkin method (GMsDGM) for flows in heterogeneous media

Offline computation is an essential component in most multiscale model reduction techniques. However, there are multiscale problems in which offline procedure is insufficient to give accurate representations of solutions, due to the fact that offline computations are typically performed locally and global information is missing in these offline information. To tackle this difficulty, we develop an online local adaptivity technique for local multiscale model reduction problems. We design new online basis functions within Discontinuous Galerkin method based on local residuals and some optimally estimates. The resulting basis functions are able to capture the solution efficiently and accurately, and are added to the approximation iteratively. Moreover, we show that the iterative procedure is convergent with a rate independent of physical scales if the initial space is chosen carefully. Our analysis also gives a guideline on how to choose the initial space. We present some numerical examples to show the performance of the proposed method.

math.NA↗

Residual-driven online Generalized Multiscale Finite Element Methods

The construction of local reduced-order models via multiscale basis functions has been an area of active research. In this paper, we propose online multiscale basis functions which are constructed using the offline space and the current residual. Online multiscale basis functions are constructed adaptively in some selected regions based on our error indicators. We derive an error estimator which shows that one needs to have an offline space with certain properties to guarantee that additional online multiscale basis function will decrease the error. This error decrease is independent of physical parameters, such as the contrast and multiple scales in the problem. The offline spaces are constructed using Generalized Multiscale Finite Element Methods (GMsFEM). We show that if one chooses a sufficient number of offline basis functions, one can guarantee that additional online multiscale basis functions will reduce the error independent of contrast. We note that the construction of online basis functions is motivated by the fact that the offline space construction does not take into account distant effects. Using the residual information, we can incorporate the distant information provided the offline approximation satisfies certain properties. In the paper, theoretical and numerical results are presented. Our numerical results show that if the offline space is sufficiently large (in terms of the dimension) such that the coarse space contains all multiscale spectral basis functions that correspond to small eigenvalues, then the error reduction by adding online multiscale basis function is independent of the contrast. We discuss various ways computing online multiscale basis functions which include a use of small dimensional offline spaces.

math.NA↗

An adaptive generalized multiscale discontinuous Galerkin method (GMsDGM) for high-contrast flow problems

In this paper, we develop an adaptive Generalized Multiscale Discontinuous Galerkin Method (GMs-DGM) for a class of high-contrast flow problems, and derive a-priori and a-posteriori error estimates for the method. Based on the a-posteriori error estimator, we develop an adaptive enrichment algorithm for our GMsDGM and prove its convergence. The adaptive enrichment algorithm gives an automatic way to enrich the approximation space in regions where the solution requires more basis functions, which are shown to perform well compared with a uniform enrichment. We also discuss an approach that adaptively selects multiscale basis functions by correlating the residual to multiscale basis functions (cf. [4]). The proposed error indicators are L2-based and can be inexpensively computed which makes our approach efficient. Numerical results are presented that demonstrate the robustness of the proposed error indicators.

math.NA↗

Generalized multiscale finite element methods for wave propagation in heterogeneous media

Numerical modeling of wave propagation in heterogeneous media is important in many applications. Due to the complex nature, direct numerical simulations on the fine grid are prohibitively expensive. It is therefore important to develop efficient and accurate methods that allow the use of coarse grids. In this paper, we present a multiscale finite element method for wave propagation on a coarse grid. The proposed method is based on the Generalized Multiscale Finite Element Method (GMsFEM). To construct multiscale basis functions, we start with two snapshot spaces in each coarse-grid block where one represents the degrees of freedom on the boundary and the other represents the degrees of freedom in the interior. We use local spectral problems to identify important modes in each snapshot space. These local spectral problems are different from each other and their formulations are based on the analysis. To our best knowledge, this is the first time where multiple snapshot spaces and multiple spectral problems are used and necessary for efficient computations. Using the dominant modes from local spectral problems, multiscale basis functions are constructed to represent the solution space locally within each coarse block. These multiscale basis functions are coupled via the symmetric interior penalty discontinuous Galerkin method which provides a block diagonal mass matrix, and, consequently, results in fast computations in an explicit time discretiza- tion. Our methods' stability and spectral convergence are rigorously analyzed. Numerical examples are presented to show our methods' performance. We also test oversampling strategies. In particular, we discuss how the modes from different snapshot spaces can affect the proposed methods' accuracy.

math.NA↗