1. Introduction
The Darcy-Forchheimer equation is commonly used for describing the high velocity flow near oil and gas wellbores and fractures, which is a correction formula of the well known Darcy’s law by supplementing a nonlinear velocity quantity as follows:
where
and
represent the viscosity, the permeability, the density, and the dynamic viscosity coefficient of the fluid, respectively.
is also mentioned as the Forchheimer coefficient, whose values stand for the nonlinear intensity. In contrast, Darcy’s law, which is valid for the extremely small velocity case, is usually used to show the linear relationship between the velocity vector
and the pressure gradient
. The Darcy-Forchheimer model can be obtained by coupling Equation (
1) with the following conservation law equation:
In recent years, the Darcy-Forchheimer model has been studied by many researchers within numerical discretized methods. Girault et al. in [
1] proved the existence and uniqueness of the solution of the Darcy-Forchheimer model. Then, they considered mixed finite element methods by piecewise constant and nonconforming Crouzeix-Raviart elements to approximate the velocity and the pressure, respectively. Park in [
2] gave a mixed finite element method (MFEM) for generalized Darcy-Forchheimer flow. Pan et al. in [
3] presented an MFEM to approximate the velocity based on the Raviart–Thomas element or the Brezzi–Douglas–Marini element and piecewise constant for the pressure of the Darcy-Forchheimer model. Rui et al. in [
4] published a block-centered finite difference method (BCFDM) for the Darcy-Forchheimer model. The authors in [
5] established a BCFDM for the Darcy-Forchheimer model with variable parameter
. Rui and Liu in [
6] introduced a two level BCFDM for the Darcy-Forchheimer model. Huang, Chen, and Rui in [
7] designed a nonlinear multigrid method for the two-dimensional Darcy-Forchheimer model with a Peaceman–Rachford-type iteration as a smoother and proposed a better choice of the parameter used in the splitting. We point out that the constructed multigrid method with an almost linear computational cost is convergent independent of the critical parameters.
To solve the problem in heterogeneous media, a very fine mesh should be used for solving a heterogeneity scale problem, which results to a large number of degrees of freedom. For dimension reduction and fast solvers of such problems, some model reduction techniques are needed. In [
8], the authors introduced the mixed multiscale finite element methods and presented the main convergence results for the solution of second order elliptic equations with heterogeneous coefficients, which oscillate rapidly. Mixed multiscale finite element methods are widely used for solving the reservoir simulation problems [
9,
10,
11]. In [
12,
13,
14], we developed a mixed generalized multiscale finite element method (GMsFEM), where we enriched a multiscale space by new degrees of freedom, which was obtained by solving local spectral problems on the snapshot space.
In this paper, we consider a solution of the Darcy-Forchheimer model in heterogeneous media. We construct an efficient algorithm of the mixed generalized multiscale finite element method to make an approximation of the problem on the coarse grid. The construction is based on solving the local problems for calculating multiscale basis functions of the velocity. Meanwhile, we use piecewise constant elements to approximate the pressure. In the mixed formulation, we firstly define a snapshot space, which provides a solution space in each local area. Then we solve the local spectral problem in the snapshot space to find out multiscale basis functions. We use the Picard iteration to address the non-linearity when solving the problems on the multiscale spaces [
15,
16]. Note that when constructing multiscale basis functions, we do not take into account the nonlinear part of the Darcy-Forchheimer equation.
The remainder of this article is organized as follows: The model problem and its weak formulation in mixed form and the discrete weak formulation are demonstrated in
Section 2. The fine grid approximation and coarse gird approximation are presented in
Section 3 and
Section 4, respectively. Some numerical experiments using our mixed generalized multiscale finite element method are carried out in
Section 5 to verify the efficiency of the presented method. Finally, conclusions and further ideas are presented in
Section 6.
3. Fine Grid Approximation
In this section, mixed finite element methods have been borrowed to handle Problem (
5) in the fine grid. Here, we use the standard Sobolev spaces notation to define the function spaces and their norms as follows:
Then, we obtain the following variational formulation: find
such that:
The variational formulation (
8) and the problem (
5) are equivalent by the following Green’s formula:
Let
be a polygon in two dimensions, which can be entirely covered by a shape regular decomposition
, in the sense of Ciarlet [
17], into triangles, with
h being the maximum diameter of the elements of the triangles. Therefore,
is a family of conforming triangulations of
,
Here, we discretize the velocity in the lowest order Raviart–Thomas space:
Given a simplex
, the local Raviart–Thomas space of order
is defined by:
where
denotes the set of all polynomials in two variables of degree
. Then, we can get the lowest order global Raviart–Thomas space, which is the conforming finite element space of the velocity
:
The pressure
p is approximated in the following piecewise constant space:
Then, we can obtain the discrete weak formulation of (
8): find a pair
:
In [
3], the authors demonstrated the existence and uniqueness of the continuous problem and the discrete problem, respectively. Moreover, if
is quasi-uniform and
, then the following error estimates can be proven; see ([
3], Theorem 4.4) for details:
where
is the standard Sobolev space of index
, where
s is a nonnegative integer and
.
where
is the weak derivative of
v; see the details in [
18].
Let:
where
are the coefficients of the finite element approximations with
dimensions, in terms of a basis
of the velocity and a basis
of the pressure, respectively.
We apply the Picard iteration for solving the resulting discrete nonlinear system.
Find
with an arbitrary initial guess
, such that:
We rewrite the iteration (
15) into the following matrix form.
where
is the matrix associated with the term:
where
B is the matrix corresponding to
and
is the vector associated with the linear functional
In the practical implementation, we use the following termination criterion to control the iteration,
where:
4. Coarse Grid Approximation
In this section, we describe the construction of the approximation on a coarse grid using the mixed generalized multiscale finite element method (mixed GMsFEM). We construct a square uniform coarse grid
for the computational domain
with a coarse grid size
H;
is the set of all facets of a coarse mesh, and
is the number of facets of a coarse mesh. To construct the multiscale basis function, we build a uniform triangular fine grid, which is obtained by refinement of a coarse grid. In the mixed GMsFEM, we compute the multiscale basis functions for the velocity in the local domains
that correspond to the coarse edge
(
Figure 1).
where
is the coarse grid cell, which is equal to a square element of
.
We build a multiscale space for the velocity
:
where
are the multiscale basis functions, which are calculated in the local domain
and
is the number of basis functions in each local domain. For pressure, we use the space
of piecewise constant functions on the coarse cells.
We start with constructing a snapshot space in the local domain
and then make an approximation on the coarse grid using the solution of the local spectral problem on the snapshot space. The snapshot space is obtained by solving the next local problem in
: find (
such that:
with boundary condition:
where
is the unit exterior normal vector to the boundary
.
On the fine facet
, we apply an additional boundary condition:
where
is the number of the fine facets
on which we define the boundary condition (
20),
is chosen by the compatibility condition
,
presents the length of the fine grid facet
, and
denotes the volume of the local domain
. Here,
is the number of fine grid edges
on
,
, and
is a piecewise constant function defined on
, which takes the value of one on
and zero on each other edge of the fine grid.
Therefore, we can define the snapshot space in each local domain
:
To compute a multiscale basis function, we solve a local spectral problem in each local domain
. The spectral problem allows us to find the most important characteristics of the problem. Then, we use multiscale basis functions to define the multiscale space to get an approximation on the coarse grid. In each
, we solve the spectral problem on
:
where:
and:
For construction of the multiscale space, we select the first
smallest eigenvalues and take the corresponding eigenvectors
as basis functions (
). We note that the presented spectral decomposition in the snapshot space is motivated by theoretical analysis (see Theorem 4.3 in [
12]). Moreover, the oversampling techniques can be used for the construction of the multiscale basis functions to enhance the accuracy of mixed GMsFEM. The main idea of oversampling techniques is to introduce a small dimensional snapshot space using the POD (proper orthogonal decomposition) approach, where snapshot vectors are constructed in larger regions that contain the interfaces of two adjacent coarse blocks [
12].
Remark 2. For the construction of the multiscale basis functions, we can use other types of spectral problems (see [12,19]). For example, we can solve the following spectral problem:with:on the snapshot space and taking eigenvectors corresponding to the largest eigenvalues as a multiscale basis functions (). Additionally, we calculate the first basis function by the solution of the following local problem in the domain
: find
such that:
with the following boundary conditions:
where
,
is the length of coarse facet
.
Finally, we obtain the following multiscale space for velocity:
The illustration of the local multiscale basis functions with an additional basis are presented in
Figure 1.
For the construction of the coarse grid system, we define a projection matrix:
where
and
is the projection matrix for pressure, where we set one for each fine grid cell in the current coarse grid cell. Here,
is the number of facets of the coarse grid, and
is the number of multiscale basis functions in local domain
.
We use the constructed multiscale space and write the approximation in the coarse grid in matrix form:
where:
and finally, we reconstruct the solution on the fine grid
.
5. Numerical Results
In this section, we present several numerical results of the Darcy-Forchheimer model in the domain
. We used a structured
fine grid with 77,120 edges and 51,200 cells (triangles) and a
coarse grid with 220 edges and 100 cells (see
Figure 2).
In the numerical study, we set
,
, and
. For the Picard iteration, we set
. The permeability tensor
k is heterogeneous and presented in
Figure 3, where we considered two test cases. We set the Darcy-Forchheimer coefficient
from [
20,
21], where the parameter
C controls the influence of the nonlinear part of the equation. We studied the proposed multiscale solver for
,
,
, and
C = 71,554.17. With such values of
C, we could investigate the behavior of a method with the various influences of the nonlinear part. By increasing the parameter
C, we obtained a Darcy-Forchheimer equation with the dominant nonlinear part.
At first, we considered a test case with
. Fine scale and multiscale solutions using eight multiscale basis functions are presented in
Figure 4 and
Figure 5 for coefficient
k from Test 1 and Test 2. In
Table 1, the relative errors in the
norm for different numbers of multiscale basis functions are presented for
. Here,
and
denote the size of the multiscale and fine grid solutions (
= 128,320), and
M is the number of multiscale basis functions. By #iter, we denote the number of Picard iterations, and
and
are the relative errors in
norm for velocity and pressure, respectively. To calculate the error of the pressure, the average values over the coarse grid cells are used.
The numerical results for
with coefficient
k from Test 1 and Test 2 using eight multiscale basis functions are presented in
Figure 6 and
Figure 7. In
Table 2,
Table 3,
Table 4 and
Table 5, we show the relative error in the
norm between the multiscale solution and the fine grid solution for different numbers of multiscale basis functions. The errors are presented for different values of
C to see the influence of the nonlinear part on the accuracy of mixed GMsFEM. According to the obtained results, we observed that the method worked well with the presented problem. When we increased the number of multiscale bases, we observed that the error decreased. For large values of
C the error was greater than for smaller values. This was due to the fact that for large
C values, the influence of the nonlinear part of the equation increased, and our multiscale bases did not take into account the nonlinear part. From the tables, we can observe that the number of Picard iterations of mixed GMsFEM was significantly smaller than the number of iterations of the fine grid solution for large
C. For Test 1 and Test 2, we obtained similar results for the presented multiscale solver.