Next Article in Journal
Unusual Water Flow in Ultra-Tight Porous Media: Integration of Profession and Innovation
Next Article in Special Issue
An Efficient and Accurate Approach to Electrical Boundary Layer Nanofluid Flow Simulation: A Use of Artificial Intelligence
Previous Article in Journal
Microwave-Assisted Phytochemical Extraction from Walnut Hull and Process Optimization Using Box–Behnken Design (BBD)
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Communication

Multi-Point Flux MFE Decoupled Method for Compressible Miscible Displacement Problem

School of Mathematics and Statistics, Qilu University of Technology (Shandong Academy of Sciences), Jinan 250353, China
*
Author to whom correspondence should be addressed.
Processes 2023, 11(4), 1244; https://doi.org/10.3390/pr11041244
Submission received: 15 February 2023 / Revised: 30 March 2023 / Accepted: 13 April 2023 / Published: 18 April 2023
(This article belongs to the Special Issue Recent Computational Aspect of Nanofluids and Heat Transfer)

Abstract

:
In this paper, a multi-point flux mixed-finite-element decoupled method was considered for the compressible miscible displacement problem. For this compressible problem, a fully discrete backward Euler scheme was proposed, in which the velocity and pressure equations were decoupled by a multi-point flux MFE method using BDM1 elements combined with a trapezoidal quadrature rule. The concentration equation was handled by a standard FE method. The error analysis for velocity, pressure, and concentration were rigorously derived. Numerical experiments to verify the convergence rates and simulate the miscible displacement problem of a water–oil system were presented.

1. Introduction

In this paper, we considered the miscible displacement of one compressible fluid by another in a porous medium. The Ω R 2 of unit thickness was described by the following model:
d ( c ) p t + · u = q , ( x , t ) Ω × J , u = μ ( c ) K 1 p , ( x , t ) Ω × J , ϕ c t + b ( c ) p t + u · c · ( D c ) = ( c ¯ c ) q , ( x , t ) Ω × J ,
with the following initial boundary conditions,
u · n = 0 , ( x , t ) Ω × J , D c · n = 0 , ( x , t ) Ω × J , p ( x , 0 ) = p 0 ( x ) , c ( x , 0 ) = c 0 ( x ) ,
where p, u , and c represent the pressure, the Darcy velocity of the fluid, and the concentration of one component in the mixed fluid, respectively; d ( c ) , q, μ , K, and ϕ represent the compression coefficient, external flow rates, the viscosity of the fluid mixture, the permeability tensor, and the porosity of the medium, respectively; c ¯ is equal to c for production wells and to a specified concentration at injection wells; and in μ ( c ) K 1 = α 1 ( c ) = a ( c ) , J = [ 0 , T ] is the time interval.
  • The diffusion coefficient D was given by:
D = ϕ ( x ) [ d m I + | u | ( d l E ( u ) + d t E ( u ) ) ] ,
where E ( u ) = ( e i j ( u ) ) 2 × 2 , e i j ( u ) = u i u j / | u | 2 , and E = I E , d m are the molecular diffusion coefficients, and d l and d t are the longitudinal and transverse dispersion coefficients, respectively.
The past few decades, there has been a significant amount of literature concerning the compressible miscible displacement problem. In [1], the authors presented the Galerkin finite-element procedure and mixed-finite-element procedure to handle the model problem. Bound-preserving discontinuous Galerkin methods were discussed in [2,3,4]. Characteristic block-centered finite-difference method for a compressible miscible displacement problem were derived in [5,6]. In [7,8], the authors presented a mixed-finite-element method with a mass-conservative characteristic finite method to solve a modeled problem. A mixed-finite-element method, combined with a two-grid method, for a compressible miscible displacement problem were shown in [9,10].
The MFE method has been widely used in the simulation of miscible displacement problems because it preserves the local mass and can approximate both the scalar unknown and the negative of its gradient simultaneously, but one limitation of this method has been that it can lead to a saddle-point algebraic system that is time-consuming to solve. To overcome this problem, many scholars have conducted much research on the modification of mixed-finite-element methods. In these works, it has been emphasized that the multi-point flux mixed-finite-element method, as proposed by M.F.Wheeler and I.Yotov [11], not only maintained the advantages of mixed-finite-element methods but also decoupled the saddle-point problem into a symmetric positive definite cell-centered finite-difference scheme for pressure, thereby achieving the rapid decoupling of equations and greatly improving computational efficiency.
There have also been many examples of the application of a multi-point flux mixed-finite-element method. The multi-point flux MFE method for poro-elastic systems on irregular domains with general grids was found in [12]. This method was proposed in [13] for a slightly compressible flow in porous media. The authors in [14] considered a multi-point flux MFE method for a compressible Darcy–Forchheimer model, and it was presented again in [15] for an incompressible Darcy–Forchheimer miscible displacement problem. However, most realistic reservoirs are compressible. Therefore, it was necessary to study rapid decoupling methods for compressible problems. To the best of our knowledge, there has been no published literature demonstrating the multi-point flux MFE method for compressible miscible displacement problems.
Therefore, we adopted a fully discrete backward Euler multi-point flux MFE decoupled scheme for a compressible miscible displacement problem, the velocity–pressure equation was approximated by the multi-point flux MFE method since it was practical for implementation and could decouple the saddle-point algebraic equation into a cell-centered finite difference scheme. In addition, this system was symmetrically positive and definite to achieve fast solutions to the equations, and the concentration equation was approximated by a standard finite element.
In this paper, we used the standard notations of Sobolev norms and spaces, following the example of [16], and we presented the following assumptions on the regularity ( R ) and the coefficients ( C ) of (1), which was similar to that in [17], as follows:
( R ) p L ( H 1 ) , u L ( H ( d i v ) ) L ( W 1 ) W 1 ( L ) H 2 ( L 2 ) , c L ( H 2 ) H 1 ( H 2 ) L ( W 1 ) H 2 ( L 2 ) ,
( C ) d * d ( c ) d * , α * α ( c ) α * , ϕ * ϕ ϕ * , b * b ( c ) b * , D * | r | 2 r T D r D * | r | 2 , r R 2 , | α c ( x , c ) | + | d c ( x , c ) | + | b c ( x , c ) | K ,
where d * ,   d * ,   α * ,   α * , ϕ * ,   ϕ * , b * ,   b * ,   D * ,   D * , and K are positive constants, and throughout the paper, K could have different values in different scenarios.
The rest of the paper is organized as follows. In Section 2, we present the problem formulation and discretization of the miscible displacement problem. Section 3 is the main body of the paper, where we describe the error-and-convergence analysis for velocity, pressure, and concentration. In Section 4, we illustrate several numerical experiments to demonstrate the theoretical results.

2. Problem Formulation and Discretizations

Assume Ω R 2 was a bounded open domain with the Lipschitz boundary Ω . Therefore, let the following be true:
H ( div , Ω ) = { u ( L 2 ( Ω ) ) 2 ; · u L 2 ( Ω ) } , V = { u H ( div , Ω ) ; u · n = 0 } , W = L 2 ( Ω ) , M = H 1 ( Ω ) .
  • Then, we could obtain a weak form of the problem (1): ω W , v V , z M , from which we could find ( u , p , c ) : [ 0 , T ] ( V , W , M ) , as follows:
( d ( c ) p t , ω ) + ( · u , ω ) = ( q , ω ) , ( α ( c ) u , v ) ( · v , p ) = 0 , ( ϕ c t , z ) + ( b ( c ) p t , z ) + ( u · c , z ) + ( D c , z ) = ( ( c ¯ c ) q , z ) .
Assume that V h × W h was the lowest-order Brezzi–Douglas–Marini mixed-finite-element space ( BDM 1 ) [18]. We considered a quasi-regular quadrilateral partition T p of Ω , h p = max E T p diam ( E ) . For each element E T p , we defined the bijection mapping F E : E ¯ E , E ¯ as the reference element with the vertices r ¯ 1 = ( 0 , 0 ) T , r ¯ 2 = ( 1 , 0 ) T , r ¯ 3 = ( 1 , 1 ) T , and r ¯ 4 = ( 0 , 1 ) T , as well as E with vertices r i = ( x i , y i ) T , i = 1 , , 4 . For mapping F E , the Jacobian matrix was denoted by D F E and J F = | det ( D F E ) | , the inverse mapping by F E 1 , and its Jacobian matrix by D F E 1 and J F 1 = | det ( D F E 1 ) | .
For the reference element E ¯ , the BDM 1 spaces were defined as follows:
V ¯ ( E ¯ ) = P 1 ( E ¯ ) 2 + r curl ( x ¯ 2 y ¯ ) + s curl ( x ¯ y ¯ 2 ) = α 1 x ˜ + β 1 y ˜ + γ 1 + r x ˜ 2 + 2 s x ˜ y ˜ α 2 x ˜ + β 2 y ˜ + γ 2 2 r x ˜ y ˜ s y ˜ 2 W ¯ ( E ¯ ) = P 0 ( E ¯ ) = α ,
where α i , β i , γ i , r, s, and α are the real constants for i = 1 , 2 .
  • In addition, the BDM 1 spaces on partition element E were defined by the following transformations:
u u ¯ : u = 1 J F D F E u ¯ F E 1 , v s . v ¯ : v = v ¯ F E 1 .
  • The BDM 1 spaces on T p were given by:
V h = { v V : v | E v ¯ , v ¯ V ¯ ( E ¯ ) , E T p } , W h = { w W : w | E w ¯ , w ¯ W ¯ ( E ¯ ) , E T p } .
Let M h H 1 ( Ω ) be a standard finite-element space for the Galerkin method with the quasi-regular partition T c of Ω , and then, this could satisfy the following:
inf z h M h [ z z h L 2 ( Ω ) + h c z z h H 1 ( Ω ) ] K h c 2 z H 2 ( Ω ) ,
where h c = max τ T c diam ( τ ) .
  • For the approximation spaces, there existed a positive constant K that was independent of the mesh sizes, such that the following was true:
v L K h p 1 v L 2 , v V h .
z W m , K h c 1 z H m , z M h , m = 0 , 1 .
  • We used the time step, let N > 0 be a positive integer, and set the following:
Δ t = T / N ; t n = n Δ t for n T / N .
Next, we considered the global quadrature formula for u , v V h :
( α u , v ) Q = E T p ( α u , v ) Q , E ,
and the quadrature formula on element E was calculated by mapping the reference element E ¯ :
E α u · v d x = E ¯ α ¯ 1 J F D F E u ¯ · 1 J F D F E v ¯ J F d x ¯ E ¯ A u ¯ · v ¯ d x ¯ 1 4 i = 1 4 A ( r ¯ i ) u ¯ ( r ¯ i ) · v ¯ ( r ¯ i ) ,
where
A = 1 J F D F E T α ¯ D F E .
  • The quadrature error of element E was denoted by the following:
σ E ( α u , v ) ( α u , v ) E ( α u , v ) Q , E ,
and the global quadrature error by σ ( α u , v ) | E = σ E ( α u , v ) .
  • In order to avoid a tedious introduction, please refer to [11] for details about the properties of bijection mapping, mixed-element spaces, quadrature formulas, and quadrature errors.
Now, we present the multi-point flux MFE decoupled scheme for the model problem (1), as follows:
( d ( c h n 1 ) p h n p h n 1 Δ t , ω h ) + ( · u h n , ω h ) = ( q n , ω h ) , ω h W h , ( α ( c h n 1 ) u h n , v h ) Q ( · v h , p h n ) = 0 , v h V h , ( ϕ c h n c h n 1 Δ t , z h ) + ( b ( c h n 1 ) p h n p h n 1 Δ t , z h ) + ( u h n · c h n , z h ) + ( D · c h n , z h ) = ( ( c ¯ n c h n ) q n , z h ) , z h M h .
  • In order to facilitate the error analysis, we introduced the projection operator.
  • For velocity and pressure, we defined projection ( u ˜ , p ˜ ) such that the following was true:
( α ( c ) ( u u ˜ ) , v h ) ( p p ˜ , · v h ) = 0 , v h V h , ( · ( u u ˜ ) , q h ) = 0 , q h V h .
  • For the following approximation properties,
u u ˜ K u r h p r , 1 r 2 ,
· ( u u ˜ ) K · u r h p r , 0 r 1 ,
p p ˜ K p r h p r , 0 r 1 .
  • For the concentration, the projection operator c ˜ : J M h satisfied:
( D ( c ˜ c ) , z ) + ( u · ( c ˜ c ) , z ) + ( λ ( c ˜ c ) , z ) = 0 , z M h ,
and the approximation properties satisfied:
( a ) c c ˜ L ( L 2 ( Ω ) ) + h c ( c c ˜ ) L ( L 2 ( Ω ) ) K h c 2 c L ( H 2 ( Ω ) ) , ( b ) ( c c ˜ ) t L ( L 2 ( Ω ) ) K h c 2 { c L ( H 2 ( Ω ) ) + c t L ( H 2 ( Ω ) ) } , ( c ) c ˜ L ( W 1 , ( Ω ) ) K .
  • For the following convergence analysis, we first introduced specific conclusions, which can be found in [11].
Lemma 1.
There existed a constant K , independent of h, such that for all v h V h :
( α v h , v h ) Q K v h 2 .
Remark 1.
Lemma 1 implied that ( α · , · ) Q 1 / 2 is a norm. We denoted this norm by · Q . It was easy to observe that · Q was equivalent to · .
Lemma 2.
There existed a constant K , independent of h and Δ t , such that for all v h V h , the following was true:
| σ ( α u ˜ , v h ) | K h u 1 v h .

3. Convergence Analysis

Note the following: η = p p ˜ ,   θ = p ˜ p h ,   γ = u u ˜ ,   δ = u ˜ u h , ζ = c c ˜ , ξ = c ˜ c h , d t θ n = θ n θ n 1 Δ t , d t δ n = δ n δ n 1 Δ t .
Theorem 1.
There existed a constant K , independent of h and Δ t , such that the following was true:
d t θ N 2 + Δ t n = 1 N d t δ n 2 K ( Δ t 2 + h p 2 + h c 4 + Δ t n = 1 N ( d t ξ n 1 2 + δ n 1 2 ) ) .
Proof. 
Subtracting the first two formulas of the multi-point flux MFE scheme (19) from the first two formulas of variational formulation (7) and combing that with the projection operator (20), we could express the error equations, as follows:
( d ( c h n 1 ) θ n θ n 1 Δ t , ω h ) + ( · δ n , ω h ) = ( d ( c h n 1 ) η n η n 1 Δ t , ω h ) ( d ( c h n 1 ) ( p n t p n p n 1 Δ t ) , ω h ) ( d ( c n ) p n t d ( c h n 1 ) p n t , ω h ) , ( α ( c h n 1 ) δ n , v h ) Q ( θ n , · v h ) = ( ( α ( c n ) α ( c h n 1 ) ) u ˜ n , v h ) σ ( α ( c h n 1 ) u ˜ n , v h ) .
  • Subtracting the n time level and n 1 time level of the error equation, dividing that by Δ t , and then taking ω h = d t θ n and v h = d t δ n , as well as adding in the two formulas, we could deduce the following:
( d t ( d ( c h n 1 ) d t θ n ) , d t θ n ) + ( d t ( α ( c h n 1 ) δ n ) , d t δ n ) Q = ( d t ( ( α ( c h n 1 ) α ( c n ) ) u ˜ n ) , d t δ n ) σ ( d t ( α ( c h n 1 ) u ˜ n ) , d t δ n ) ( d t ( ( d ( c n ) d ( c h n 1 ) ) p n t ) , d t θ n ) ( d t ( d ( c h n 1 ) ( p n t p n p n 1 Δ t ) ) , d t θ n ) ( d t ( d ( c h n 1 ) d t η n ) , d t θ n ) .
  • Based on the following:
( d t ( d ( c h n 1 ) d t θ n ) , d t θ n ) 1 2 d t ( d ( c h n 1 ) d t θ n , d t θ n ) 1 2 ( d t ( d ( c h n 1 ) ) d t θ n 1 , d t θ n 1 ) + ( d t ( d ( c h n 1 ) ) d t θ n 1 , d t θ n ) ,
and
( d t ( α ( c h n 1 ) δ n ) , d t δ n ) Q = ( α ( c h n 1 ) d t δ n , d t δ n ) Q + ( d t ( α ( c h n 1 ) ) δ n 1 , d t δ n ) Q .
  • We concluded:
( α ( c h n 1 ) d t δ n , d t δ n ) Q + 1 2 d t ( d ( c h n 1 ) d t θ n , d t θ n ) ( d t ( α ( c h n 1 ) ) δ n 1 , d t δ n ) Q ( d t ( d ( c h n 1 ) ) d t θ n 1 , d t θ n ) + 1 2 ( d t ( d ( c h n 1 ) ) d t θ n 1 , d t θ n 1 ) + ( d t ( ( α ( c h n 1 ) α ( c n ) ) u ˜ n ) , d t δ n ) σ ( d t ( α ( c h n 1 ) u ˜ n ) , d t δ n ) ( d t ( ( d ( c n ) d ( c h n 1 ) ) p n t ) , d t θ n ) ( d t ( d ( c h n 1 ) ( p n t p n p n 1 Δ t ) ) , d t θ n ) ( d t ( d ( c h n 1 ) d t η n ) , d t θ n ) .
  • Multiplying the above formula by Δ t and then combining Lemma 1 and summing n from 1 to N, we could then obtain the following:
C Δ t n = 1 N d t δ n L 2 2 + d t θ N L 2 2 n = 1 N Δ t ( d t ( α ( c h n 1 ) ) δ n 1 , d t δ n ) Q n = 1 N Δ t ( d t ( d ( c h n 1 ) ) d t θ n 1 , d t θ n ) + 1 2 n = 1 N Δ t ( d t ( d ( c h n 1 ) ) d t θ n 1 , d t θ n 1 ) + n = 1 N Δ t ( d t ( ( α ( c h n 1 ) α ( c n ) ) u ˜ n ) , d t δ n ) n = 1 N Δ t σ ( d t ( α ( c h n 1 ) u ˜ n ) , d t δ n ) n = 1 N Δ t ( d t ( ( d ( c n ) d ( c h n 1 ) ) p n t ) , d t θ n ) n = 1 N Δ t ( d t ( d ( c h n 1 ) ( p n t p n p n 1 Δ t ) ) , d t θ n ) n = 1 N Δ t ( d t ( d ( c h n 1 ) d t η n ) , d t θ n ) = n = 1 8 T i .
  • Next, we estimate the Formula (32), item by item:
| T 1 | = | Δ t n = 1 N ( d t ( α ( c h n 1 ) ) δ n 1 , d t δ n ) Q | ε Δ t n = 1 N d t δ n L 2 2 + K Δ t n = 1 N ( 1 + d t ξ n 1 L 2 + h c 4 ) δ n 1 L 2 2 ,
which follows the properties (5), Remark 1, and the ε -inequality.
| T 2 | + | T 3 | = | Δ t n = 1 N ( d t ( d ( c h n 1 ) ) d t θ n 1 , d t θ n ) | + 1 2 | Δ t n = 1 N ( d t ( d ( c h n 1 ) ) d t θ n 1 , d t θ n 1 ) | K Δ t n = 1 N ( 1 + d t ξ n 1 L 2 ) d t θ n 1 L 2 2 + K Δ t n = 1 N d t θ n L 2 2 .
| T 4 | = | Δ t n = 1 N ( d t ( ( α ( c h n 1 ) α ( c n ) ) u ˜ n ) , d t δ n ) | ε Δ t n = 1 N d t δ n L 2 2 + K ( Δ t n = 1 N d t ξ n 1 L 2 2 + Δ t 2 + h c 4 ) .
| T 5 | = | Δ t n = 1 N σ ( d t ( α ( c h n 1 ) u ˜ n ) , d t δ n ) | = | Δ t n = 1 N σ ( α ( c h n 1 ) d t u ˜ n + d t ( α ( c h n 1 ) ) u ˜ n 1 , d t δ n ) | ε Δ t n = 1 N d t δ n L 2 2 + K h p 2 ,
which followed Lemma 2 and the ε -inequality.
| T 6 | = | Δ t n = 1 N ( d t ( ( d ( c n ) d ( c h n 1 ) ) p n t ) , d t θ n ) | K ( Δ t n = 1 N ( d t θ n L 2 2 + d t ξ n 1 L 2 2 ) + Δ t 2 + h c 4 ) .
| T 7 | + | T 8 | | Δ t n = 1 N ( d t ( d ( c h n 1 ) ( p n t p n p n 1 Δ t ) ) , d t θ n ) | + | Δ t n = 1 N ( d t ( d ( c h n 1 ) d t η n ) , d t θ n ) | K ( Δ t n = 1 N ( d t θ n L 2 2 + d t ξ n 1 L 2 ) + Δ t 2 + h p 2 + h c 4 ) .
  • Substituting (33)–(38) into (32), and combining the discrete Gronwall’s inequality, we obtained (28), which completed the proof of the theorem. □
Theorem 2.
Assume that (4), (5), and (11)–(13) held. The discretization parameters obeyed the relationship Δ t = O ( h p ) , h c 2 = O ( h p ) . Then, there exists a positive constant K , independent of h and Δ t , such that the following was true:
Δ t n = 1 N d t ξ n 2 + ξ N 2 K ( Δ t 2 + h p 2 + h c 4 + Δ t n = 1 N ( ξ n 1 2 + d t θ n 2 ) ) .
Proof. 
Subtracting the last formula of the approximation scheme (19) from the last formula of the variational formulation (7), and then integrating the projection operator (24) yielded the following error equation:
( ϕ ξ n ξ n 1 Δ t , z h ) + ( D · ξ n , z h ) = ( ϕ ( c n t c n c n 1 Δ t ) , z h ) ( ϕ ζ n ζ n 1 Δ t , z h ) + ( b ( c h n 1 ) p h n p h n 1 Δ t , z h ) ( b ( c n ) p n t , z h ) ( u n · c ˜ n u h n · c n n , z h ) + ( ( c h n c n ) q n , z h ) + ( λ ζ n , z h ) .
  • Taking z h = d t ξ n and multiplying Δ t on both sides of (40), and then summing for n from 1 to N, we obtained the following:
Δ t n = 1 N ( ϕ d t ξ n , d t ξ n ) + Δ t n = 1 N ( D · ξ n , d t ξ n ) = Δ t n = 1 N ( ϕ ( c t c n c n 1 Δ t ) , d t ξ n ) Δ t n = 1 N ( ϕ ζ n ζ n 1 Δ t , d t ξ n ) + Δ t n = 1 N ( b ( c h n 1 ) p h n p h n 1 Δ t , d t ξ n ) Δ t n = 1 N ( b ( c n ) p n t , d t ξ n ) Δ t n = 1 N ( u n · c ˜ n u h n · c n n , d t ξ n ) + Δ n = 1 N ( ( c h n c n ) q n , d t ξ n ) + Δ t n = 1 N ( λ ζ n , d t ξ n ) n = 1 7 I i .
  • The left side of the previous equation could be estimated as follows:
Δ t n = 1 N ( ϕ d t ξ n , d t ξ n ) + Δ t n = 1 N ( D · ξ n , d t ξ n ) K Δ t n = 1 N d t ξ n 2 + 1 2 Δ t ( D · ξ n , ξ n ) 1 2 Δ t ( D · ξ n 1 , ξ n 1 ) .
  • We estimated the right side of Formula (41) using the Cauchy–Schwarz inequality, and we obtained the following:
| I 1 | = | Δ t n = 1 N ( ϕ ( c t c n c n 1 Δ t ) , d t ξ n ) | Δ t n = 1 N ( K ϕ c n c n 1 Δ t ϕ c t L 2 2 + ε d t ξ n L 2 2 ) K Δ t n = 1 N t n 1 t n 2 c t 2 d t L 2 2 + ε Δ t n = 1 N d t ξ n L 2 2 K Δ t 2 2 c t 2 L 2 ( 0 , T ; L 2 ) 2 + ε Δ t n = 1 N d t ξ n L 2 2 .
| I 2 | = | Δ t n = 1 N ( ϕ ζ n ζ n 1 Δ t , d t ξ n ) | Δ t n = 1 N K [ Ω ( t n 1 t n ζ t d t ) 2 d x ] 1 2 · [ Ω ( d t ξ n ) 2 d x ] 1 2 K Δ t n = 1 N [ Ω ( t n 1 t n 1 2 d t t n 1 t n ( ζ t ) 2 d t ) d x ] 1 2 · d t ξ n L 2 K n = 1 N ζ t L 2 ( t n 1 , t n ; L 2 ) 2 + ε n = 1 N Δ t d t ξ n L 2 2 K h c 4 c t L 2 ( 0 , T ; H 2 ) 2 + ε Δ t n = 1 N d t ξ n L 2 2 .
| I 3 + I 4 | = | Δ t n = 1 N ( b ( c h n 1 ) p h n p h n 1 Δ t , d t ξ n ) Δ t n = 1 N ( b ( c n ) p n t , d t ξ n ) | = | Δ t n = 1 N ( ( b ( c h n 1 ) ( p h n p h n 1 Δ t p n p n 1 Δ t ) , d t ξ n ) + ( b ( c h n 1 ) ( p n p n 1 Δ t p n t ) , d t ξ n ) + ( ( b ( c h n 1 ) b ( c n ) ) p n t , d t ξ n ) ) | K ( Δ t 2 + h p 2 + h c 4 + Δ t n = 1 N ( ξ n 1 L 2 2 + d t θ n L 2 2 ) ) + ε Δ t n = 1 N d t ξ n L 2 2 .
| I 5 | = | Δ t n = 1 N ( u n · c ˜ n u h n · c n n , d t ξ n ) | | Δ t n = 1 N ( ( u n u h n ) · c ˜ n , d t ξ n ) | + | Δ t n = 1 N ( u h n · ( c ˜ n c h n ) , d t ξ n ) | Δ t n = 1 N | ( a ( c n ) p n a ( c h n ) p h n ) · c ˜ n , d t ξ n ) | + Δ t n = 1 N u h n L ( c ˜ n c h n ) L 2 d t ξ n L 2 = Δ t n = 1 N | ( ( a ( c n ) a ( c h n ) ) p h n · c ˜ n , d t ξ n ) + ( a ( c n ) θ n · c ˜ n , d t ξ n ) + ( a ( c n ) η n · c ˜ n , d t ξ n ) | + Δ t n = 1 N u h n L ( c ˜ n c h n ) L 2 d t ξ n L 2 K ( h p 2 + h c 4 + Δ t n = 1 N ξ n 1 2 ) + ε Δ t n = 1 N d t ξ n L 2 2 .
  • The estimation technique of (46) was similar to Formula ( 3.22 ) in [1]. The constant K in (46) depended on the norms of p h n L , u h n L and θ n L , such that they could be bounded using the inductive hypothesis, which we did not elaborate here.
| I 6 | = | Δ t n = 1 N ( ( c h n c n ) q n , d t ξ n ) | K h c 4 + K Δ t n = 1 N ξ n L 2 2 + ε Δ t n = 1 N d t ξ n L 2 2 ,
follows from (25a) and the Cauchy–Schwarz inequality. We could also obtain the following:
| I 7 | = | Δ t n = 1 N ( λ ζ n , d t ξ n ) | K h c 4 + ε Δ t n = 1 N d t ξ n L 2 2 .
  • Substituting (42)–(48) into (41), choosing ξ 0 = 0 , and applying the discrete Gronwall’s Lemma, we discovered the following:
Δ t n = 1 N d t ξ n 2 + ξ N 2 K ( Δ t 2 + h p 2 + h c 4 + Δ t n = 1 N ( ξ n 1 2 + d t θ n 2 ) ) ,
this completes the proof of Theorem 2. □
Moreover, by observing the following:
Δ t n = 1 N ( φ n , d t φ n ) = 1 2 ( φ N 2 φ 0 2 + n = 1 N φ n φ n 1 2 ) 1 2 ε Δ t n = 1 N ( φ n , φ n ) + ε 2 Δ t n = 1 N ( d t φ n , d t φ n ) ,
it followed that:
φ N 2 φ 0 2 K Δ t n = 1 N φ n 2 + ε Δ t n = 1 N d t φ n 2 .
  • Then, combing (28) and (39), we obtained the following:
θ N 2 + d t θ N 2 + δ N 2 + Δ t n = 1 N d t δ n 2 + ξ N 2 + ξ N 2 + Δ t n = 1 N d t ξ n 2 K Δ t n = 1 N ( θ n 2 + δ n 2 + ξ n 1 2 + d t θ n 2 ) + K ( Δ t 2 + h c 4 + h p 2 ) .
  • Applying the discrete Gronwall’s Lemma to the previous equation resulted in the following:
max n = 1 N θ N 2 + max n = 1 N δ N 2 + max n = 1 N ξ N 2 + max n = 1 N ξ N 2 + max n = 1 N d t θ N 2 + Δ t n = 1 N d t δ n 2 + Δ t n = 1 N d t ξ n 2 K ( h c 4 + h p 2 + Δ t 2 ) .
  • Combining the estimates (21), (23), (25), and (53), we obtained the following conclusion.
Corollary 1.
Under the assumption of Theorem 2, there existed a constant K , independent of h and Δ t , such that the following was true:
max n = 1 N u n u h n + max n = 1 N p n p h n + max n = 1 N c n c h n K ( Δ t + h c 2 + h p ) .

4. Numerical Examples

In this section, we present the numerical experiments that verified the theoretical analysis and tested the performance of the proposed method.

4.1. Test Convergence Rate

We considered the problem (1) in Ω = [ 0 , 1 ] × [ 0 , 1 ] and K = 1 . The exact solution was constructed as follows:
u ( x , y , t ) = exp ( t ) ( sin ( π x ) cos ( π y ) + 3 x 2 y 2 , cos ( π x ) sin ( π y ) + 2 x 3 y ) , p ( x , y , t ) = exp ( t ) ( cos ( π x ) cos ( π y ) / π + x 3 y 2 ) , c ( x , y , t ) = exp ( t ) ( sin ( π x ) + sin ( π y ) ) .
The numerical results in Table 1 show the first-order convergence rates for velocity and pressure. Moreover, the first-order convergence rates of the H 1 norms and the second-order rates of the L 2 norms for concentration were consistent with the theoretical analysis.The graphs of the concentration, pressure, and velocity fields are presented in Figure 1.
We tested the application performance of the proposed method for different injection production cases of water–oil miscible displacements.

4.2. Single Injection Single Production Case

For the single-injection, single-production case, K = 0.01 , we set the injection well in the upper-right corner at q = 20 and m 2 /s, and the production well in lower-right corner at q = 20 and m 2 /s. The initial concentration was c 0 = 0 . We focused on the molecular diffusion and ignored the longitudinal and transverse dispersion effects, where d m = 0.0005 m 2 /s and d l = d t = 0 . The evolution of the invading fluid is presented in Figure 2. We found the flow was faster in the diagonal direction, which was reasonable and agreed with the simulation results in [15].

4.3. Five Spot Pattern Case

For the common whole five-spot pattern, K = 0.01 , we set the injection well in the center with an injection rate of q = 100 and m 2 /s, and the production wells at the four corners with a production rate of q = 25 and m 2 /s.
The numerical velocity and pressure are shown in Figure 3, and the evolution of the invading fluid is presented in Figure 4.

4.4. Five-Spot Pattern with Random Permeability Case

Based on the five-spot pattern, we studied random permeability cases, where the range of bottom right-hand quarter was from 0.1 to 0.5 and others were from 1 / 7 to 1 / 6 . Based on the results shown in Figure 5, we observed that the flow was faster along the domain with higher permeability. These examples showed that the multi-point flux MFE method was, indeed, effective for simulating a miscible displacement problem.

5. Results

We carried out four numerical experiments to verify the correctness of the theoretical analysis and the efficiency of the method. In Example 1, we tested the convergence order of the method, which was consistent with the theorem and corollary results. In the next three examples, we tested the application performance of the proposed method, based on water-oil miscible displacement problems involving a single injection and single production; a five-spot pattern; and random permeability five-spot pattern. The test results showed that the flow velocity along the high permeability area was relatively fast, which was reasonable.

6. Discussion

For compressible miscible displacement problems, a multi-point flux MFE decoupled method was considered. One of its advantages was that it avoided the coupled saddle-point problem by introducing a trapezoidal numerical integration formula. The BDM1 element was used for spatial discretization to approximate the velocity and the pressure, and a standard FE was used to approximate the concentration. A backward Euler scheme was proposed for the time discretization. The error estimates of the three variables were obtained through strict theoretical derivation, and the results were consistent with the convergence order in a previous incompressible article [15]. In the future, we will study another compressible miscible displacement problem, in which the velocity and pressure are controlled by the nonlinear Darcy–Forchheimer equation, since the non-Darcy and coupling problems actually exist in high-water cut reservoirs and areas with a high flow velocity around the well-bore.

Author Contributions

Conceptualization, W.X. and H.G.; methodology, W.X.; software, X.L.; validation, W.X., H.G. and X.L.; formal analysis, H.G.; investigation, X.L.; resources, W.X.; data curation, X.L.; writing—original draft preparation, W.X. and H.G.; writing—review and editing, W.X. and Y.R.; visualization, X.L. and Y.R.; supervision, W.X.; project administration, X.L.; funding acquisition, W.X. All authors have read and agreed to the published version of the manuscript.

Funding

The authors were supported by the Education and Industry Integration Pilot Project Basic Research Project of Qilu University of Technology (Shandong Academy of Sciences) (2022PY058).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Douglas, J., Jr.; Roberts, J.E. Numerical Methods for a Model for Compressible Miscible Displacement in Porous Media. Math. Comput. 1983, 41, 441–459. [Google Scholar] [CrossRef]
  2. Feng, W.; Guo, H.; Kang, Y.; Yang, Y. Bound-preserving discontinuous Galerkin methods with second-order implicit pressure explicit concentration time marching for compressible miscible displacements in porous media. J. Comput. Phys. 2022, 463, 111240. [Google Scholar] [CrossRef]
  3. Guo, H.; Yang, Y. Bound-Preserving Discontinuous Galerkin Method for Compressible Miscible Displacement in Porous Media. SIAM J. Sci. Comput. 2017, 39, A1969–A1990. [Google Scholar] [CrossRef]
  4. Chuenjarern, N.; Xu, Z.; Yang, Y. High-order bound-preserving discontinuous Galerkin methods for compressible miscible displacements in porous media on triangular meshes. J. Comput. Phys. 2019, 378, 110–128. [Google Scholar] [CrossRef]
  5. Li, A.; Huang, J.; Liu, W.; Wei, H.; Yi, N. A characteristic block-centered finite difference method for Darcy-Forchheimer compressible miscible displacement problem. J. Comput. Appl. Math. 2022, 413, 114303. [Google Scholar] [CrossRef]
  6. Li, X.; Rui, H. Characteristic block-centered finite difference method for compressible miscible displacement in porous media. Appl. Math. Comput. 2017, 314, 391–407. [Google Scholar] [CrossRef]
  7. Li, X.; Rui, H.; Xu, W. A new MCC-MFE method for compressible miscible displacement in porous media. J. Comput. Appl. Math. 2016, 302, 139–156. [Google Scholar] [CrossRef]
  8. Zhang, J. A new combined characteristic mixed-finite-element method for compressible miscible displacement problem. Numer. Algorithms 2019, 81, 1157–1179. [Google Scholar] [CrossRef]
  9. Hu, H. Two-grid method for compressible miscible displacement problem by mixed-finite-element methods and expanded mixed-finite-element method of characteristics. Numer. Algorithms 2022, 89, 611–636. [Google Scholar] [CrossRef]
  10. Zeng, J.; Chen, Y.; Hu, H. Two-grid method for compressible miscible displacement problem by CFEM-MFEM. J. Comput. Appl. Math. 2018, 337, 175–189. [Google Scholar] [CrossRef]
  11. Wheeler, M.F.; Yotov, I. A multi-point flux mixed-finite-element method. SIAM J. Numer. Anal. 2006, 44, 2082–2106. [Google Scholar] [CrossRef]
  12. Wheeler, M.F.; Xue, G.; Yotov, I. Coupling multi-point flux mixed-finite-element methods with continuous galerkin methods for poroelasticity. Computat. Geosci. 2014, 18, 57–75. [Google Scholar] [CrossRef]
  13. Arrarás, A.; Portero, L. Multipoint flux mixed-finite-element methods for slightly compressible flow in porous media. Comput. Math. Appl. 2019, 77, 1437–1452. [Google Scholar] [CrossRef]
  14. Xu, W.; Liang, D.; Rui, H. A multi-point flux mixed-finite-element method for the compressible Darcy-Forchheimer models. Appl. Math. Comput. 2017, 315, 259–277. [Google Scholar] [CrossRef]
  15. Xu, W.; Liang, D.; Rui, H.; Li, X. A Multipoint Flux Mixed Finite Element Method for Darcy-Forchheimer Incompressible Miscible Displacement Problem. J. Sci. Comput. 2020, 82, 1–20. [Google Scholar] [CrossRef]
  16. Adams, R.A.; Fournier, J.J.F. Sobolev Spaces; Elsevier: Amsterdam, The Netherlands, 2003. [Google Scholar]
  17. Ewing, R.E.; Russell, T.F.; Wheeler, M.F. Convergence analysis of an approximation of miscible displacement in porous media by mixed finite elements and a modified method of characteristics. Comput. Methods Appl. Mech. Eng. 1984, 47, 73–92. [Google Scholar] [CrossRef]
  18. Brezzi, F.; Douglas, J., Jr.; Marini, L.D. Two families of mixed finite elements for second order elliptic problems. Numer. Math. 1985, 88, 217–235. [Google Scholar] [CrossRef]
Figure 1. The graphs of the concentration, pressure, and velocity fields of Example 4.1 .
Figure 1. The graphs of the concentration, pressure, and velocity fields of Example 4.1 .
Processes 11 01244 g001
Figure 2. Contours and graphs of concentration in single injection single production case.
Figure 2. Contours and graphs of concentration in single injection single production case.
Processes 11 01244 g002
Figure 3. The numerical velocity and pressure solution in five-spot pattern.
Figure 3. The numerical velocity and pressure solution in five-spot pattern.
Processes 11 01244 g003
Figure 4. Contours and graphs of concentration in five-spot pattern.
Figure 4. Contours and graphs of concentration in five-spot pattern.
Processes 11 01244 g004
Figure 5. Contours and graphs of concentration in random permeability case.
Figure 5. Contours and graphs of concentration in random permeability case.
Processes 11 01244 g005
Table 1. Numerical error-and-convergence rates for Example 4.1 .
Table 1. Numerical error-and-convergence rates for Example 4.1 .
Norm Type u u h l 2 ( L 2 ) u u h l ( L 2 ) p p h l 2 ( L 2 ) p p h l ( L 2 )
mesherrorrateerrorrateerrorrateerrorrate
5 4.15 × 10 3 1.31 × 10 1 1.37 × 10 3 4.32 × 10 2
10 1.97 × 10 3 1.01 6.23 × 10 2 1.01 6.97 × 10 4 0.97 2.21 × 10 2 0.97
20 9.99 × 10 4 0.98 3.16 × 10 2 0.98 3.50 × 10 4 0.99 1.11 × 10 2 0.99
40 5.08 × 10 4 0.98 1.61 × 10 2 0.98 1.55 × 10 4 1.00 5.55 × 10 3 1.00
Norm Type c c h l 2 ( H 1 ) c c h l ( H 1 ) c c h l 2 ( L 2 ) c c h l ( L 2 )
mesherrorrateerrorrateerrorrateerrorrate
5 1.80 × 10 2 5.68 × 10 1 2.94 × 10 4 4.65 × 10 2
10 9.00 × 10 3 1.00 2.85 × 10 1 0.99 7.37 × 10 5 1.97 1.17 × 10 2 1.99
20 4.50 × 10 3 1.00 1.42 × 10 1 1.00 1.84 × 10 5 1.99 2.92 × 10 3 2.00
40 2.25 × 10 3 1.00 7.12 × 10 2 1.00 4.61 × 10 6 2.00 7.29 × 10 4 2.00
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Xu, W.; Guo, H.; Li, X.; Ren, Y. Multi-Point Flux MFE Decoupled Method for Compressible Miscible Displacement Problem. Processes 2023, 11, 1244. https://doi.org/10.3390/pr11041244

AMA Style

Xu W, Guo H, Li X, Ren Y. Multi-Point Flux MFE Decoupled Method for Compressible Miscible Displacement Problem. Processes. 2023; 11(4):1244. https://doi.org/10.3390/pr11041244

Chicago/Turabian Style

Xu, Wenwen, Hong Guo, Xindong Li, and Yongqiang Ren. 2023. "Multi-Point Flux MFE Decoupled Method for Compressible Miscible Displacement Problem" Processes 11, no. 4: 1244. https://doi.org/10.3390/pr11041244

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop