Next Article in Journal
Symmetric Polynomials in Free Associative Algebras—II
Previous Article in Journal
Working Performance Improvement of a Novel Independent Metering Valve System by Using a Neural Network-Fractional Order-Proportional-Integral-Derivative Controller
Previous Article in Special Issue
Oscillatory and Periodical Behavior of Heat Transfer and Magnetic Flux along Magnetic-Driven Cylinder with Viscous Dissipation and Joule Heating Effects
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Local and Parallel Stabilized Finite Element Methods Based on the Lowest Equal-Order Elements for the Stokes–Darcy Model

School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(23), 4820; https://doi.org/10.3390/math11234820
Submission received: 19 October 2023 / Revised: 19 November 2023 / Accepted: 28 November 2023 / Published: 29 November 2023
(This article belongs to the Special Issue Advances in Computational and Applied Fluid Dynamics)

Abstract

:
In this article, two kinds of local and parallel stabilized finite element methods based upon two grid discretizations are proposed and investigated for the Stokes–Darcy model. The lowest equal-order finite element pairs ( P 1 - P 1 - P 1 ) are taken into account to approximate the velocity, pressure, and piezometric head, respectively. To circumvent the inf-sup condition, the stabilized term is chosen as the difference between a consistent and an under-integrated mass matrix. The proposed algorithms consist of approximating the low-frequency component on the global coarse grid and the high-frequency component on the local fine grid and assembling them to obtain the final approximation. To obtain a global continuous solution, the technique tool of the partition of unity is used. A rigorous theoretical analysis for the algorithms was conducted and numerical experiments were carried out to indicate the validity and efficiency of the algorithms.

1. Introduction

The Stokes–Darcy system describes a model that is composed of the Stokes equations for the fluid flow and Darcy’s law for the porous media flow with coupled interface conditions. The finite element method is widely used for solving this model since it is more applicable to the complex region and its numerical analysis is perfect. Until now, there have been lots of works on this coupled model, for instance, coupled finite element methods [1,2,3], two-grid methods [4,5,6], multi-grid methods [7], domain decomposition methods [8,9,10,11], and so on. Compared with coupled methods, decoupled methods could save a lot of computing time by dividing the coupled problem into two sub-problems. Among these decoupled methods, the local and parallel finite element methods were first proposed by Xu and Zhou to solve the elliptic boundary value problems by combining the two-grid method and domain decomposition technique in [12,13]. Subsequently, many researchers generalized them to the Stokes problem [14], the Navier–Stokes problem [15,16,17], the Stokes–Darcy model [18], the Navier–Stokes–Darcy model [19], and the MHD problem [20].
In this paper, the local and parallel finite element methods are considered to solve the coupled problem. The steps of the local and parallel finite element method can be presented as follows. Firstly, the Stokes–Darcy model is approximated to obtain the numerical solution by using standard finite element method on a coarse grid. Secondly, the coupled problem is decoupled into two individual sub-problems and the complete domain is divided into a series of sub-domains. Then, the residual problems are solved on a fine grid in these sub-domains. To avoid the effect of the artificial Dirichlet boundary condition, each sub-domain is properly enlarged to a larger domain. Finally, the numerical solution is assembled on the coarse grid and the residual together. However, the solution for the Stokes–Darcy model using local and parallel finite element methods can be improved since the solutions are, in general, globally discontinuous. To overcome this drawback, the most popular idea is to introduce the partition of unity technique, which is adaptable and controllable, to decompose the computational domain [21,22].
It is well known that finite element spaces utilized for the coupled Stokes–Darcy model should satisfy the inf-sup (or LBB) condition. Although the lowest equal-order finite element pairs do not satisfy the inf-sup condition, they are computationally convenient in practical applications because of the identical degree distribution for the velocity and pressure. Therefore, the lowest equal-order finite element pairs have attracted much more attention in recent years. To circumvent the inf-sup condition, many stabilized techniques have been researched, such as local pressure projection stabilized methods [23,24,25] and the stabilized methods based on two local Gauss integrations [26,27,28,29,30]. Among these stabilized methods, the stabilized method based on two local Gauss integrations does not need to calculate high-order derivatives and construct the projection operator; however, it can be computed at the element level.
In this paper, two parallelized stabilized finite element algorithms are proposed and analyzed for the mixed Stokes–Darcy model by combining the classical local and parallel finite element methods and the stabilized method based on two local Gauss integration techniques. Compared to our previous work, for instance [18], the lowest equal-order finite element pairs are considered. The algorithms in this study and those in [18] were devised with the understanding that, for a solution to the mixed problem, the low-frequency components have the global property while the high-frequency components have the local property. Hence, the low-frequency components are computed on a coarse mesh and the high-frequency components are obtained on a fine mesh by some local and parallel procedures. The theoretical results indicate that our methods could derive the same error convergence orders as the parallel methods provided in [18]. On the other hand, the numerical results show that algorithms in this study could achieve a better error accuracy and take less time compared with the parallel methods provided in [18].
The rest of this article is organized as follows. In Section 2, the Stokes–Darcy model is introduced. The finite element spaces and some useful notations are described in Section 3. In Section 4, two local and parallel finite element methods are proposed. In Section 5, the theoretical analysis is presented. Some numerical results are reported to verify the validity and efficiency of the presented algorithms in Section 6. Finally, a conclusion is derived in Section 7.

2. The Stokes–Darcy Model

Let Ω f R d ( d = 2 , 3 ) be a fluid region and Ω p R d be a porous media region with Ω f Ω p = , Ω f ¯ Ω p ¯ = Γ , Ω f ¯ Ω p ¯ = Ω ¯ . Denote Γ f = Ω f Γ , Γ p = Ω p Γ .
In the fluid region Ω f , the fluid is governed by the Stokes equations as follows:
· T ( u , p ) = f 1 in Ω f , · u = 0 in Ω f ,
where T = p I + 2 ν D ( u ) is the stress tensor, I is the identity matrix, ν is the kinematic viscosity, D ( u ) = 1 2 ( u + T u ) is the velocity deformation tensor, u represents the velocity, p represents the kinematic pressure, and f 1 represents the external force.
In the porous media region Ω p , the fluid is governed by the equations as follows:
· u p = f 2 in Ω p , u p = K ϕ in Ω p ,
where u p denotes the fluid velocity, f 2 denotes a source term, K denotes the hydraulic conductivity, and ϕ = z + p p ρ g denotes the piezometric head, with z being the height from a reference level, p p being the dynamic pressure, ρ being the density of the fluid, and g being the gravitational acceleration.
Then, Equation (2) is rewritten in the following formalization:
· ( K ϕ ) = f 2 in Ω p ,
which we shall consider in the following paper.
On the interface Γ , the following conditions are considered:
u · n f + u p · n p = 0 , [ T ( u , p ) · n f ] · n f = ρ g ϕ , [ T ( u , p ) · n f ] · τ i = α ν g t r ( K ) u · τ i ,
where n f is the unit normal vector on Γ from Ω f to Ω p , n p is the unit normal vector on Γ from Ω p to Ω f , { τ i } i = 1 d 1 are the tangential unit vectors on Γ , and α is a positive constant, which is dependent on the property of the porous media region. The first equation is the mass conservation, the second one denotes the balance of normal forces, and the last one is the well-known Beavers–Joseph–Saffman interface condition, which is the simplification of the Beavers–Joseph interface condition.
For the sake of simplicity, the following Dirichlet boundary conditions are considered:
u = 0 on Γ f , ϕ = 0 on Γ p .
In the following, the standard Sobolev spaces and related norms are utilized. Furthermore, for a domain D, let ( · , · ) D stand for the usual L 2 inner product on D. To derive the weak formulation of the mixed Stokes–Darcy problem, the following spaces are introduced:
H f = { v H 1 ( Ω f ) d : v = 0 on Γ f } , H p = { ψ H 1 ( Ω p ) : ψ = 0 on Γ p } , Q = L 2 ( Ω f ) , W = H f × H p , X = W × Q .
Then, the weak formulation of the coupled Stokes–Darcy model with the Beavers–Joseph–Saffman interface condition reads as follows: find u = ( u , ϕ ) W , p Q , such that
a ( u , v ) + b ( v , p ) = ( f , v ) v = ( v , ψ ) W , b ( u , q ) = 0 q Q ,
where
a ( u , v ) = a Ω ( u , v ) + a Γ ( u , v ) = a f ( u , v ) + a p ( ϕ , ψ ) + a Γ ( u , v ) , a f ( u , v ) = 2 ν ( D ( u ) , D ( v ) ) Ω f + α ν g t r ( K ) Γ P τ u · P τ v , P τ v = j = 1 d 1 ( v · τ j ) τ j , a p ( ϕ , ψ ) = ρ g ( K ϕ , ψ ) Ω p , a Γ ( u , v ) = ρ g Γ ( ϕ v ψ u ) · n f , b ( v , p ) b ( v , p ) = ( p , · v ) Ω f , ( f , v ) = ( f 1 , v ) Ω f + ρ g ( f 2 , ψ ) Ω p .

3. Stabilized Finite Element Approximation

Let τ h be a regular triangulation of Ω . The triangles K i ( i = 1 , , M ) satisfy Ω ¯ = K 1 ¯ K 2 ¯ K M ¯ , h = max K τ h d i a m ( K ) . Assume the triangulation τ h ( Ω f ) is compatible with τ h ( Ω p ) on the interface Γ . Define the following finite element spaces as
H f , h = { v H f : v | K P 1 P 1 d , K τ h ( Ω f ) } , H p , h = { ψ H p : ψ | K P 1 , K τ h ( Ω p ) } , Q h = { q Q : q | K P 1 , K τ h ( Ω f ) } , W h = H f , h × H p , h , X h = W h × Q h .
It is well known that the above finite element spaces H f , h × Q h do not satisfy the discrete inf-sup condition. To derive a stable numerical solution, the following stabilization term is introduced:
G ( p , q ) = λ ( ( I Π ) p , ( I Π ) q ) ,
where the stabilization parameter λ satisfies 0 < λ < 1 . For the local pressure projection Π : L 2 ( Ω ) R , R Ω , there holds
( p , q ) = ( Π p , q ) p L 2 ( Ω ) , q R ,
Π p 0 c p 0 p L 2 ( Ω ) ,
| ( I Π ) p | c h m p m p H m ( Ω ) , m = 0 , 1 .
Define the discrete form of Equation (6) with two Gauss integrals
G ( p h , q h ) = λ K K h K , 2 p h q h d x K , 1 p h q h d x p h , q h Q h ,
where K , m · d x denotes a Gauss integral over K, K is exact for polynomials of degree m, and m = 1 , 2 .
Under the above notations, the stabilized finite element method of Equation (5) reads as follows: find ( u h , p h ) = ( u h , ϕ h , p h ) X h , such that
a ( u h , v h ) + b ( v h , p h ) = ( f , v h ) v h = ( v h , ψ h ) W h , b ( u h , q h ) + G ( p h , q h ) = 0 q h Q h .
Then, recall some error estimates of the stabilized finite element method deduced by Li et al., in [29].
u u h 1 + ϕ ϕ h 1 + p p h 0 c h ( u 2 + ϕ 2 + p 1 ) , u u h 0 + ϕ ϕ h 0 c h 2 ( u 2 + ϕ 2 + p 1 ) .
Since 0 < λ < 1 , the above estimates still hold for Equation (11).
Then, the Stokes equation can be rewritten as
B s ( ( u h , p h ) ; ( v h , q h ) ) = ( f 1 , v h ) ,
where
B s ( ( u h , p h ) ; ( v h , q h ) ) = a f ( u h , v h ) + b ( v h , p h ) b ( u h , q h ) G ( p h , q h ) .
It is easy to verify that
B s ( ( u , p ) ; ( v , q ) ) c ( u , p ) Ω f ( v , q ) Ω f ,
β ( u h , p h ) Ω f sup ( v h , q h ) H f , h × Q h B s ( ( u h , p h ) ; ( v h , q h ) ) ( v h , q h ) Ω f ( u h , p h ) H f , h × Q h ,
where ( u h , p h ) Ω f = u h 1 , Ω f + p h 0 , Ω f .

4. Numerical Algorithm

Divide Ω f into a series of disjoint sub-domains D j , and then enlarge D j to Ω j such that D j Ω j Ω f ( D j Ω j means that dist( D j Ω f , Ω j Ω f ) > 0 ). Define Γ Ω j = Γ Ω j . Furthermore, divide Ω p into a series of disjoint sub-domains D i , then enlarge D i to Ω i . Then, obtain D i Ω i Ω p and define Γ Ω i = Γ Ω i similarly.
Algorithm 1 Local and parallel stabilized finite element method
Step 1. On a coarse grid, solve the following coupled model to find ( u H , p H ) X H satisfying
a ( u H , v H ) + b ( v H , p H ) = ( f , v H ) v H = ( v H , ψ h ) W H , b ( u H , q H ) + G ( p H , q H ) = 0 q H Q H .
Step 2. On a fine mesh, solve a series of local Darcy sub-problems in parallel as follows: Find the local residuals ϵ h i H p , h ( Ω i )  ( i = 1 , 2 , , M p h < H ) satisfying
a p ( ϵ h i , ψ h ) = ρ g ( f 2 , ψ h ) Ω i a p ( ϕ H , ψ h ) + ρ g Γ Ω i ψ h u H · n f ψ h H p , h ( Ω i ) ,
and we set ϕ h = ϕ H + ϵ h i in D i .
On a fine mesh, solve the following local Stokes sub-problems in parallel. Find local residuals ( e h j , η h j ) H f , h ( Ω j ) × Q h ( Ω j )  ( j = 1 , 2 , , M f ), such that, for all ( v h , q h ) H f , h ( Ω j ) × Q h ( Ω j ) ,
a f ( e h j , v h ) + b ( v h , η h j ) = ( f 1 , v h ) Ω j ( a f ( u H , v h ) + b ( v h , p H ) ) ρ g Γ Ω j ϕ H v h · n f , b ( e h j , q h ) + G ( η h j , q h ) = b ( u H , q h ) G ( p H , q h ) ,
and then set ( u h , p h ) = ( u H + e h j , p H + η h j ) in D j .
However, the solution of the coupled Stokes–Darcy model Equation (11) derived by Algorithm 1 is globally discontinuous. By combining the local and parallel finite element method and the partition of unity method, a new local and parallel finite element method is obtained. Let { Ω f j } j = 1 M f be an open cover of Ω f and { ϕ j f } j = 1 M f be the partition of unity subordinate to { Ω f j } j = 1 M f . Let { Ω p i } i = 1 M p be an open cover of Ω p and { δ i p } i = 1 M p be the partition of unity subordinate to { Ω p i } i = 1 M p . ϕ j f and δ i p could be chosen as piecewise linear Lagrange basis functions. Then, there holds the following results [31]:
supp ϕ j f Ω ¯ f j j = 1 , , M f , j = 1 M f ϕ j f = 1 on Ω f , ϕ j f L ( R d ) c , supp δ i p Ω ¯ p i i = 1 , , M p , i = 1 M p δ i p = 1 on Ω p , δ i p L ( R d ) c .
Furthermore, construct the partition of unity as follows: Define a regular triangulation τ H p in Ω such that h < H H p , where H p is fixed and independent of h , H . For the triangulation τ H p , let D f j be the union of triangles in Ω f , and let D p i be the union of triangles in Ω p . Define Γ Ω f j = Γ Ω f j , Γ Ω p i = Γ Ω p i .
Algorithm 2 Local and parallel partition of unity stabilized finite element method
Step 1. On a coarse grid, solve the following coupled model to obtain ( u H , p H ) X H , such that
a ( u H , v H ) + b ( v H , p H ) = ( f , v H ) v H = ( v H , ψ h ) W H , b ( u H , q H ) + G ( p H , q H ) = 0 q H Q H .
Step 2. On a fine mesh, find local fine grid correction ϵ h i H p , h ( Ω p i ) ( i = 1 , 2 , , M p , h < H ), such that for all ψ h H p , h ( Ω p i ) ,
a p ( ϵ h i , ψ h ) = ρ g ( f 2 , ψ h ) Ω p i a p ( ϕ H , ψ h ) + ρ g Γ Ω p i ψ h u H · n f ,
and then assemble them together to derive a continuous solution as
ϕ H h = ϕ H + i = 1 M p δ i p ϵ h i .
On a fine mesh, find the local corrections ( e h j , η h j ) H f , h ( Ω f j ) × Q h ( Ω f j ) ( j = 1 , 2 , , M f ) , ( v h , q h ) H f , h ( Ω f j ) × Q h ( Ω f j ) such that
a f ( e h j , v h ) + b ( v h , η h j ) = ( f 1 , v h ) Ω f j ( a f ( u H , v h ) + b ( v h , p H ) ) ρ g Γ Ω f j ϕ H v h · n f , b ( e h j , q h ) + G ( η h j , q h ) = b ( u H , q h ) G ( p H , q h ) ,
and then obtain the final approximation as
( u H h , p H h ) = ( u H + j = 1 M f ϕ j f e h j , p H + j = 1 M f ϕ j f η h j ) .

5. Theoretical Analysis

In this section, the error estimates of the proposed algorithms are derived. Firstly, a lemma, which is crucial for the later analysis, is introduced. Then, the main results based upon the provided lemma are derived. The proof of the following lemma is similar to lemma 3.2 in [26] and so it will be omitted.
Lemma 1.
Let D Ω 0 Ω f , for f L 2 ( Γ Ω 0 ) , and λ = O ( h ) , if there exists ( w h , r h ) H f , h × Q h such that
a f ( w h , v h ) + b ( v h , r h ) b ( w h , q h ) G ( r h , q h ) = ( f , v h ) , ( v h , q h ) H f , h ( Ω 0 ) × Q h ( Ω 0 ) ,
then there holds
w h 1 , D + r h 0 , D c ( w h 0 , Ω 0 + r h 1 , Ω 0 + f L 2 ( Γ Ω 0 ) ) .
Theorem 1.
Assume that Lemma 1 holds, ( u , ϕ , p ) is the exact solution of (5), ( u h , ϕ h , p h ) is the solution of the standard finite element method, and ( u h , ϕ h , p h ) is the solution of Algorithm 1. The following estimates hold:
ϕ h ϕ h 1 , D i c H 2 ,
u h u h 1 , D j + p h p h 0 , D j c H 2 .
Consequently, there holds
ϕ ϕ h 1 , D i c ( h + H 2 ) ,
u u h 1 , D j + p p h 0 , D j c ( h + H 2 ) .
Proof. 
Taking ( v h , ψ h ) = ( 0 , ψ h ) into Equation (11) yields
a p ( ϕ h , ψ h ) = ρ g ( f 2 , ψ h ) + ρ g Γ ψ h u h · n f .
Since
a p ( ϕ h , ψ h ) = ρ g ( f 2 , ψ h ) + ρ g Γ Ω i ψ h u H · n f ,
and setting ψ h = ϕ h ϕ h , there holds
a p ( ϕ h ϕ h , ϕ h ϕ h ) = ρ g Γ Ω i ( ϕ h ϕ h ) ( u h u H ) · n f .
Then, the auxiliary problem similar to [6] is introduced as follows: find δ H 1 ( Ω f ) , such that
Δ δ = 0 in Ω f , δ = ϕ h ϕ h on Γ Ω i , δ = 0 on Ω f / Γ Ω i .
Recalling the interpolation space H 00 1 / 2 ( Γ Ω i ) = [ L 2 ( Γ Ω i ) , H 0 1 ( Γ Ω i ) ] 1 / 2 presented in [32], it follows that
δ 1 , Ω f c ϕ h ϕ h H 00 1 / 2 ( Γ Ω i ) c ϕ h ϕ h 1 , Ω i .
Combining Equation (11) with Equation (17) yields
b ( u h u H , q H ) + G ( p h p H , q H ) = 0 .
Hence,
ρ g Γ Ω i ( ϕ h ϕ h ) ( u h u H ) · n f = ρ g Ω f δ ( u h u H ) · n f = ρ g Ω f δ · ( u h u H ) + ρ g Ω f δ · ( u h u H ) = ρ g Ω f δ · ( u h u H ) + ρ g Ω f ( δ q H ) · ( u h u H ) + ρ g G ( p h p H , q H ) .
Noting that Equation (12) holds, therefore, for δ H 1 ( Ω f ) , it can be derived that
ϕ h ϕ h 1 , Ω i 2 = a p ( ϕ h ϕ h , ϕ h ϕ h ) c δ 1 , Ω f u h u H 0 , Ω f + c inf q H Q H Ω f ( δ q H ) · ( u h u H ) + c G ( p h p H , q H δ ) + c G ( p h p H , δ ) c H 2 δ 1 , Ω f + c inf q H Q H δ q H 0 , Ω f u h u H 1 , Ω f + c p h p H 0 , Ω f inf q H Q H q H δ 0 , Ω f + c p h p H 0 , Ω f ( I Π ) δ 0 , Ω f c H 2 δ 1 , Ω f c H 2 ϕ h ϕ h 1 , Ω i .
Then, Equation (26) is established.
Analogously, an auxiliary problem in the porous media domain is introduced: find Φ H 1 ( Ω p ) such that
· ( K Φ ) = 0 in Ω p , K Φ · n p = ρ g v h · n p on Γ Ω j , K Φ · n p = 0 on Ω p / Γ Ω j .
It is classical that
K 1 / 2 Φ 0 , Ω p c v h 1 , Ω j ,
and
Φ 2 , Ω p c v h 1 , Ω j .
Taking ( v h , ψ h , q h ) = ( v h , 0 , q h ) into Equation (11) yields
a f ( u h , v h ) + b ( v h , p h ) b ( u h , q h ) G ( p h , q h ) = ( f 1 , v h ) ρ g Γ ϕ h v h · n f .
Subtracting Equation (19) from Equation (39) yields
a f ( u h u h , v h ) + b ( v h , p h p h ) b ( u h u h , q h ) G ( p h p h , q h ) + ρ g Γ Ω j ( ϕ h ϕ H ) v h · n f = 0 ( v h , q h ) H f , h ( Ω j ) × Q h ( Ω j ) .
Using Lemma 1, it follows that
u h u h 1 , D j + p h p h 0 , D j c u h u h 0 , Ω j + p h p h 1 , Ω j + | ρ g Γ Ω j ( ϕ h ϕ H ) v h · n f | v h 1 , Ω j c u h u H 0 , Ω j + u H u h 0 , Ω j + p h p H 1 , Ω j + p H p h 1 , Ω j + | ρ g Γ Ω j ( ϕ h ϕ H ) v h · n f | v h 1 , Ω j = c u h u H 0 , Ω j + p h p H 1 , Ω j + e h j 0 , Ω j + η h j 1 , Ω j + | ρ g Γ Ω j ( ϕ h ϕ H ) v h · n f | v h 1 , Ω j .
Now, estimate the last term on the right side of the above inequality. Following the idea in [33], there holds
ρ g Γ Ω j ( ϕ h ϕ H ) v h · n f = Γ Ω j ( ϕ h ϕ H ) K Φ · n p = Ω p ( ϕ h ϕ H ) K Φ · n p = Ω p ( ϕ h ϕ H ) · ( K Φ ) Ω p K · ( ϕ h ϕ H ) · Φ = Ω p K · ( ϕ h ϕ H ) · Φ = Ω p K · ( ϕ h ϕ h ) · Φ Ω p K · ( ϕ h ϕ H ) · Φ .
For the first term on the right side of the above inequality, it can be derived that
Ω p K · ( ϕ h ϕ h ) · Φ c ϕ h ϕ h 1 , Ω i K 1 / 2 Φ 0 , Ω p c H 2 v h 1 , Ω j .
From Equation (11), it is easy to obtain
a p ( ϕ h , ψ H ) = ρ g ( f 2 , ψ H ) + ρ g Γ Ω j ψ H u H · n f .
Taking ( v H , ψ H ) = ( 0 , ψ H ) into Equation (11) and using Equation (44) yields
Ω p K · ( ϕ h ϕ H ) · ψ H = 0 .
Hence,
Ω p K · ( ϕ h ϕ H ) · Φ = Ω p K · ( ϕ h ϕ H ) · ( Φ ψ H ) c ϕ h ϕ H 1 , Ω p inf ψ H H p , H Φ ψ H 1 , Ω p c H ( ϕ h ϕ h 1 , Ω p + ϕ h ϕ H 1 , Ω p ) Φ 2 , Ω p c H 2 v h 1 , Ω j .
By using the above inequalities, it can be derived that
ρ g Γ Ω j ( ϕ h ϕ H ) v h · n f c H 2 v h 1 , Ω j .
Next, a dual problem is introduced to estimate e h j 0 , Ω j and η h j 1 , Ω j . For θ L 2 ( Ω j ) d , φ H 0 1 ( Ω j ) , find ( w , r ) ( H f ( Ω j ) H 2 ( Ω j ) d ) × L 2 ( Ω j ) such that for all ( v , q ) H f ( Ω j ) × L 2 ( Ω j ) ,
a f ( v , w ) + b ( w , q ) b ( v , r ) G ( q , r ) = ( θ , v ) Ω j + ( φ , q ) Ω j .
And there holds
w 2 , Ω j + r 1 , Ω j c ( θ 0 , Ω j + φ 1 , Ω j ) .
Assume ( w μ , r μ ) H f , μ ( Ω j ) × Q μ ( Ω j ) is derived by using the stabilized finite element method; then, there holds
a f ( v , w w μ ) + b ( w w μ , q ) b ( v , r r μ ) G ( q , r r μ ) = 0 ( v , q ) H f , μ ( Ω j ) × Q μ ( Ω j ) ,
where μ = h or H.
Apparently,
w w μ 1 , Ω j + r r μ 0 , Ω j c μ ( w 2 , Ω j + r 1 , Ω j ) c μ ( θ 0 , Ω j + φ 1 , Ω j ) .
Then, there holds
w h w H 1 , Ω j + r h r H 0 , Ω j c H ( θ 0 , Ω j + φ 1 , Ω j ) .
From Equation (17), it is easy to obtain
a f ( u h u H , w H ) + b ( w H , p h p H ) b ( u h u H , r H ) G ( p h p H , r H ) + ρ g Γ Ω j ( ϕ h ϕ H ) w H · n f = 0 ( w H , r H ) H f , H ( Ω j ) × Q H ( Ω j ) .
Taking v = e h j , q = η h j into Equation (48), and together with Equations (40), (50), and (53) yields
( θ , e h j ) Ω j + ( φ , η h j ) Ω j = a f ( e h j , w ) + b ( w , η h j ) b ( e h j , r ) G ( η h j , r ) = a f ( e h j , w h ) + b ( w h , η h j ) b ( e h j , r h ) G ( η h j , r h ) = a f ( u h u H , w h ) + b ( w h , p h p H ) b ( u h u H , r h ) G ( p h p H , r h ) + ρ g Γ Ω j ( ϕ h ϕ H ) w h · n f = a f ( u h u H , w h w H ) + b ( w h w H , p h p H ) b ( u h u H , r h r H ) G ( p h p H , r h r H ) + ρ g Γ Ω j ( ϕ h ϕ H ) · ( w h w H ) · n f .
Based on Equations (12) and (51), it is valid that
( θ , e h j ) Ω j + ( φ , η h j ) Ω j ( u h u H 1 , Ω f + p h p H 0 , Ω f + ϕ h ϕ H 1 , Ω p ) ( w h w H 1 , Ω j + r h r H 0 , Ω j ) c H ( u h u H 1 , Ω f + p h p H 0 , Ω f + ϕ h ϕ H 1 , Ω p ) ( θ 0 , Ω j + φ 1 , Ω j ) c H 2 ( θ 0 , Ω j + φ 1 , Ω j ) .
Consequently,
e h j 0 , Ω j + η h j 1 , Ω j c H 2 .
In the following, the estimate of p h p H 1 , Ω j is deduced. Setting ( v , q ) = ( u h u H , p h p H ) in Equation (48), together with Equations (47), (51), and (53), and using the fact that w H 1 , Ω j w w H 1 , Ω j + w 1 , Ω j c w 2 , Ω j , it is easy to obtain
( θ , u h u H ) Ω j + ( φ , p h p H ) Ω j = a f ( u h u H , w ) + b ( w , p h p H ) b ( u h u H , r ) G ( p h p H , r ) = | a f ( u h u H , w w H ) + b ( w w H , p h p H ) b ( u h u H , r r H ) G ( p h p H , r r H ) ρ g Γ Ω j ( ϕ h ϕ H ) w H · n f | c ( u h u H 1 , Ω j + p h p H 0 , Ω j ) ( w w H 1 , Ω j + r r H 0 , Ω ) + c H 2 w H 1 , Ω j c H 2 ( w 2 , Ω j + r 1 , Ω j ) c H 2 ( θ 0 , Ω j + φ 1 , Ω j ) .
Hence,
u h u H 0 , Ω j + p h p H 1 , Ω j c H 2 .
Therefore, together with Equations (41), (47), (56), and (58), (27) is derived. By combing the triangle inequality with Equations (26) and (27), Equations (28) and (29) could be directly derived. □
Define the following norm as follows:
u h u h 1 , Ω f = ( j = 1 M f u h u h 1 , D j ) 1 / 2 , p h p h 0 , Ω f = ( j = 1 M f p h p h 0 , D j ) 1 / 2 , ϕ h ϕ h 1 , Ω p = ( i = 1 M p ϕ h ϕ h 1 , D i ) 1 / 2 .
Then, the following theoretical results can be derived directly:
Theorem 2.
Based on Theorem 1, there holds
u h u h 1 , Ω f + p h p h 0 , Ω f + ϕ h ϕ h 1 , Ω p c H 2 .
Proof. 
By collecting the sub-domains D j ( D i ), j = 1 , , M f , i = 1 , , M p , the proof is finished. □
Theorem 3.
Assume that the condition of Theorem 2 holds, then for the solutions using Algorithm 2, there holds the following estimate:
u h u H h 1 , Ω f + p h p H h 0 , Ω f + ϕ h ϕ H h 1 , Ω p c H 2 .
Proof. 
Since u μ = j = 1 M f ϕ j f u μ , p μ = j = 1 M f ϕ j f p μ , ϕ μ = i = 1 M p δ i p ϕ μ , μ = h , H , it is easy to obtain that
u h u H h 1 , Ω f + p h p H h 0 , Ω f + ϕ h ϕ H h 1 , Ω p = u h ( u H + j = 1 M f ϕ j f e h j ) 1 , Ω f + p h ( p H + j = 1 M f ϕ j f η h j ) 0 , Ω f + ϕ h ( ϕ H + i = 1 M p δ i p ϵ h i ) 1 , Ω p = j = 1 M f ϕ j f ( u h u H e h j ) 1 , Ω f + j = 1 M f ϕ j f ( p h p H η h j ) 0 , Ω f + i = 1 M p δ i p ( ϕ h ϕ H ϵ h i ) 1 , Ω p j = 1 M f ϕ j f ( u h u h ) 1 , D f j + j = 1 M f ϕ j f ( p h p h ) 0 , D f j + i = 1 M p δ i p ( ϕ h ϕ h ) 1 , D p i j = 1 M f ϕ j f L ( Ω f ) u h u h 1 , D f j + j = 1 M f ϕ j f L ( Ω f ) p h p h 0 , D f j + i = 1 M p δ i p L ( Ω p ) ϕ h ϕ h 1 , D p i c j = 1 M f ( u h u h 1 , D f j + p h p h 0 , D f j ) + c i = 1 M p ϕ h ϕ h 1 , D p i c H 2 .

6. Numerical Results

In this section, two examples are provided to verify the theoretical results and the efficiency and effectiveness of the proposed two parallel algorithms. The first test is a convergence test with a manufactured solution. The second one is a modification of a classical lid-driven cavity flow problem. Since it is difficult to directly solve the coupled scheme (11) as the mesh size tends to 0, we compared our algorithms with two parallel algorithms with P 1 b - P 1 - P 1 finite element pairs presented in [18]. We list some abbreviations and symbols in the following.
  • LPFEM—Local and parallel finite element method with P 1 b - P 1 - P 1 finite element pairs;
  • LPPUFEM—Local and parallel partition of unity finite element method with P 1 b - P 1 - P 1 finite element pairs;
  • LPSFEM—Local and parallel stabilized finite element method;
  • LPPUSFEM—Local and parallel partition of unity stabilized finite element method;
  • ( u ˜ h , p h , ϕ h ) —Solution obtained by LPFEM;
  • ( u ˜ H h , p H h , ϕ H h ) —Solution obtained by LPPUFEM;
  • ( u h , p h , ϕ h ) —Solution obtained by LPSFEM;
  • ( u H h , p H h , ϕ H h ) —Solution obtained by LPPUSFEM;
  • X κ —Implement the method X by dividing the domain Ω f and Ω p into κ = L × L sub-domains.

6.1. Test 1

In this test, one example with the analytical solution was considered to test the convergence order. Let Ω f = [ 0 , 1 ] × [ 1 , 2 ] , Ω p = [ 0 , 1 ] × [ 0 , 1 ] , and Γ = [ 0 , 1 ] × { 1 } . The exact solution is
u 1 = ( 1 2 x ) ( y 1 ) , u 2 = x ( x 1 ) + ( y 1 ) 2 , p = x ( 1 x ) ( y 1 ) + y 3 3 y 2 + y 0.5 , ϕ = x ( 1 x ) ( y 1 ) + y 3 3 y 2 + y 0.5 ,
Then, f 1 , f 2 can be derived by Equations (1) and (2), respectively. It is easy to verify that the solution satisfies the Beavers–Joseph–Saffman interface condition. For simplicity, let α , ν , g , ρ = 1 , K = I .
In the following, we introduce the details for the decomposition of Ω f and Ω p with κ = 2 × 2 sub-domains. In the flow domain, divide Ω f into four disjoint sub-regions
D 1 = ( 0 , 0.5 ) × ( 1 , 1.5 ) D 2 = ( 0.5 , 1 ) × ( 1 , 1.5 ) , D 3 = ( 0 , 0.5 ) × ( 1.5 , 2 ) D 4 = ( 0.5 , 1 ) × ( 1.5 , 2 ) ,
and then enlarge them into
Ω 1 = ( 0 , 0.75 ) × ( 1 , 1.75 ) Ω 2 = ( 0.25 , 1 ) × ( 1 , 1.75 ) , Ω 3 = ( 0 , 0.75 ) × ( 1.25 , 2 ) Ω 4 = ( 0.25 , 1 ) × ( 1.25 , 2 ) .
In the porous media flow domain, divide Ω p into four disjoint sub-regions
D 1 = ( 0 , 0.5 ) × ( 0 , 0.5 ) D 2 = ( 0.5 , 1 ) × ( 0 , 0.5 ) , D 3 = ( 0 , 0.5 ) × ( 0.5 , 1 ) D 4 = ( 0.5 , 1 ) × ( 0.5 , 1 ) ,
and then enlarge them into
Ω 1 = ( 0 , 0.75 ) × ( 0 , 0.75 ) Ω 2 = ( 0.25 , 1 ) × ( 0 , 0.75 ) , Ω 3 = ( 0 , 0.75 ) × ( 0.25 , 1 ) Ω 4 = ( 0.25 , 1 ) × ( 0.25 , 1 ) .
Let us introduce the process to construct partition of unity functions for the fluid region. Let H f i x = 1 / 8 , and generate the uniform mesh triangulation T H f i x ( Ω f ) . Let n d ( n d = 81 ) represent the number of nodes, b f [ i ] stand for the piecewise linear basis function defined on the node i, and the first function is generated as follows:
ϕ 1 f = i G b f [ i ] , G = { 1 i 36 and 1 { i mod 9 } 4 . }
The other three functions could be obtained in the same way. We plot them in Figure 1 along with partition of unity functions for the porous media region.
The configuration between the coarse grid and the fine grid is h = H 2 . In this case, the optimal error convergence rates of the proposed two algorithms could be derived. The uniform mesh is used, and the choice of λ is λ = 50 h.
The numerical results, including errors of the velocity, pressure, and piezometric head, obtained using four numerical methods are presented in Table 1, Table 2, Table 3, Table 4, Table 5 and Table 6. As seen from these tables, we could derive the following conclusions:
(a)
Convergence orders (for the velocity, pressure, and piezometric head) of the four algorithm are all one with respect to the fine mesh size h, which agrees with the theoretical results;
(b)
LPSFEM derives a better approximation than LPFEM since the errors of LPSFEM are less than that of LPFEM. The same conclusion is suitable for the comparison of LPPUSFEM and LPPUFEM;
(c)
LPSFEM and LPPUSFEM exhibit almost the same errors, which indicates that the partition of unity functions scarcely ever affect the error accuracy. The same situation happens to LPFEM and LPPUFEM.
In Table 7, we show the computational time of the four algorithms. As observed from this table, it is clear that LPSFEM 2 × 2 and LPPUSFEM 2 × 2 take less time than LPFEM 2 × 2 and LPPUFEM 2 × 2 , namely, the two algorithms presented in this paper are more efficient.
To show the relation between the computational accuracy and CPU time with numbers of sub-domains, we ran Algorithms 1 and 2 by dividing Ω f ( Ω p ) into 2 × 2 , 3 × 3 , and 4 × 4 sub-domains, respectively. The computing results and CPU time are plotted in Figure 2. It is not hard to see that the numerical results support the theoretical findings from Figure 2a–c. Furthermore, as seen from Figure 2d, as the number of sub-domains increases, the CPU time decreases, which is in accordance with our expectation.

6.2. Test 2

In this test, the computational domain and physical parameters were chosen as in test 1. The following modified lid-driven cavity flow problem was considered
u | Γ f = ( 1 , 0 ) , ( x , y ) [ 0 , 1 ] × { 2 } , ( 0 , 0 ) , ( x , y ) { 0 } × [ 1 , 2 ] { 1 } × [ 1 , 2 ] ,
and
ϕ | Γ p = 0 .
The external forces were set to 0, namely, f 1 = 0 and f 2 = 0 . The mesh sizes were chosen as h = H 2 = ( 1 / 16 ) 2 . Since the exact solution is unknown, we plot out the streamlines of four algorithms in Figure 3 for a comparison. As observed from Figure 3, the four algorithms derived similar results.

7. Conclusions

In this study, by utilizing the two-grid decoupled technique and the overlapping domain decomposition method, two local and parallel stabilized finite element algorithms are proposed and investigated for the mixed Stokes–Darcy model using the lowest equal-order finite element pairs. The algorithms were devised to circumvent the inf-sup condition by offsetting the discrete pressure space using the residual of the simple and symmetry term at the element level. The theoretical results indicate that the two proposed algorithms could arrive at the same error accuracy and convergence rates with the one-level method by properly choosing the configuration between the two mesh sizes. Some numerical results are reported to verify the theoretical findings and illustrate the efficiency and robustness of the proposed two algorithms.

Author Contributions

Conceptualization, G.D.; Methodology, J.H.; Formal analysis, G.D.; Writing—original draft, J.H.; Writing—review & editing, G.D.; Visualization, J.H. All authors have read and agreed to the published version of the manuscript.

Funding

This work was subsidized by NSFC (Grant No. 12172202), the Support Plan for Outstanding Youth Innovation Team in Shandong Higher Education Institutions (No. 2022KJ249), the Natural Science Foundation of Shandong Province (Grant No. ZR2021MA063).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Cao, Y.; Gunzburger, M.; Hu, X.; Hua, F.; Wang, X.; Zhao, W. Finite element approximation for Stokes-Darcy flow with Beavers-Joseph interface conditions. SIAM J. Numer. Anal. 2010, 47, 4239–4256. [Google Scholar] [CrossRef]
  2. Rivire, B.; Yotov, I. Locally conservative coupling of Stokes and Darcy flows. SIAM J. Numer. Anal. 2005, 42, 1959–1977. [Google Scholar] [CrossRef]
  3. Rui, H.; Zhang, R. A unified stabilized mixed finite element method for coupling Stokes and Darcy flows. Comput. Methods Appl. Mech. Eng. 2009, 198, 2692–2699. [Google Scholar] [CrossRef]
  4. Cai, M.; Mu, M.; Xu, J. Numerical solution to a mixed Navier-Stokes/Darcy model by the two-grid approach. SIAM J. Numer. Anal. 2009, 47, 3325–3338. [Google Scholar] [CrossRef]
  5. Du, G.; Zuo, L. A two-grid method with backtracking for the mixed Stokes/Darcy model. J. Numer. Math. 2021, 29, 39–46. [Google Scholar]
  6. Mu, M.; Xu, J. A two-grid method of a mixed Stokes-Darcy model for coupling fluid flow with porous media flow. SIAM J. Numer. Anal. 2007, 45, 1801–1813. [Google Scholar] [CrossRef]
  7. Cai, M.; Mu, M. A multilevel decoupled method for a mixed Stokes/Darcy model. J. Comput. Appl. Math. 2012, 236, 2452–2465. [Google Scholar] [CrossRef]
  8. Chen, W.; Gunzburger, M.; Hua, F.; Wang, X. A parallel Robin-Robin domain decomposition method for the Stokes-Darcy system. SIAM J. Numer. Anal. 2011, 49, 1064–1084. [Google Scholar] [CrossRef]
  9. He, X.; Li, J.; Lin, Y.; Ming, J. A domain decomposition method for the steady-state Navier-Stokes-Darcy model with the Beavers-Joseph interface condition. SIAM J. Sci. Comput. 2015, 37, S264–S290. [Google Scholar] [CrossRef]
  10. Jiang, B. A parallel domain decomposition method for coupling of surface and groundwarter flows. Comput. Methods Appl. Mech. Eng. 2009, 198, 947–957. [Google Scholar] [CrossRef]
  11. Sun, Y.; Sun, W.; Zheng, H. Domain decomposition method for the fully-mixed Stokes-Darcy coupled problem. Comput. Methods Appl. Mech. 2021, 374, 113578. [Google Scholar] [CrossRef]
  12. Xu, J.; Zhou, A. Local and parallel finite element algorithms based on two-grid discretizations. Math. Comput. 2000, 69, 881–909. [Google Scholar] [CrossRef]
  13. Xu, J.; Zhou, A. Local and parallel finite element algorithms based on two-grid discretizations for nonlinear problems. Adv. Comput. Math. 2001, 14, 293–327. [Google Scholar] [CrossRef]
  14. He, Y.; Xu, J.; Zhou, A.; Li, J. Local and parallel finite element algorithms for the Stokes problem. Numer. Math. 2008, 109, 415–434. [Google Scholar] [CrossRef]
  15. He, Y.; Xu, J.; Zhou, A. Local and parallel finite element algorithms for the Navier-Stokes problem. J. Comput. Math. 2006, 24, 227–238. [Google Scholar]
  16. Shang, Y.; He, Y. Parallel iterative finite element algorithms based on full domain partition for the stationary Navier-Stokes equations. Appl. Numer. Math. 2010, 60, 719–737. [Google Scholar] [CrossRef]
  17. Zheng, B.; Shang, Y. Local and parallel stabilized finite element algorithms based on the lowest equal-order elements for the steady Navier-Stokes equations. Math. Comput. Simul. 2020, 178, 464–484. [Google Scholar] [CrossRef]
  18. Du, G.; Zuo, L. Local and parallel finite element methods for the coupled Stokes/Darcy model. Numer. Algor. 2021, 87, 1593–1611. [Google Scholar] [CrossRef]
  19. Zuo, L.; Du, G. A parallel two-grid linearized method for the coupled Navier-Stokes-Darcy problem. Numer. Algor. 2018, 77, 151–165. [Google Scholar] [CrossRef]
  20. Zhang, Y.; Hou, Y.; Shan, L.; Dong, X. Local and parallel finite element algorithm for stationary incompressible magnetohydrodynamics. Numer. Methods Partial Differ. Equ. 2017, 33, 1513–1539. [Google Scholar] [CrossRef]
  21. Du, G.; Zuo, L. A Parallel Partition of Unity Scheme Based on Two-Grid Discretizations for the Navier-Stokes Problem. J. Sci. Comput. 2018, 75, 1445–1462. [Google Scholar] [CrossRef]
  22. Yu, J.; Shi, F.; Zheng, H. Local and parallel finite element algorithms based on the partition of unity for the stokes problem. SIAM J. Sci. Comput. 2014, 36, C547–C567. [Google Scholar] [CrossRef]
  23. Song, L.; Gao, M. A posteriori error estimates for the stabilization of low-order mixed finite elements for the Stokes problem. Comput. Methods Appl. Mech. Eng. 2014, 279, 410–424. [Google Scholar] [CrossRef]
  24. Dohrmann, C.; Bochev, P. A stabilized finite element method for the Stokes problem based on polynomial pressure projections. Int. J. Numer. Meth. Fluids 2004, 46, 183–201. [Google Scholar] [CrossRef]
  25. He, Y.; Li, J. A stabilized finite element method based on local polynomial pressure projection for the stationary Navier-Stokes equations. Appl. Numer. Math. 2008, 58, 1503–1514. [Google Scholar] [CrossRef]
  26. Shang, Y. A parallel stabilized finite element method based on the lowest equal-order elements for incompressible flows. Computing 2020, 102, 65–81. [Google Scholar] [CrossRef]
  27. Li, J.; He, Y.; Chen, Z. A new stabilized finite element method for the transient Navier-Stokes equations. Comput. Methods Appl. Mech. Eng. 2007, 197, 22–35. [Google Scholar] [CrossRef]
  28. Li, J.; He, Y. A stabilized finite element method based on two local Gauss integrations for the Stokes equations. J. Comp. Appl. Math. 2008, 214, 58–65. [Google Scholar] [CrossRef]
  29. Li, R.; Li, J.; Chen, Z.; Gao, Y. A stabilized finite element method based on two local Gauss integrations for a coupled Stokes-Darcy problem. J. Comput. Appl. Math. 2016, 292, 92–104. [Google Scholar] [CrossRef]
  30. Zheng, H.; Hou, Y.; Shi, F.; Song, L. A finite element variational multiscale method for incompressible flows based on two local Gauss integrations. J. Comput. Phys. 2009, 228, 5961–5977. [Google Scholar] [CrossRef]
  31. Melenk, J.M.; Babusˇka, I. The Partition of Unity Finite Element Method: Basic Theory and Applications. Comput. Meth. Appl. Mech. Eng. 1996, 139, 289–314. [Google Scholar] [CrossRef]
  32. Lions, J.L.; Magenes, E. Non-Homogeneous Boundary Value Problems and Applications; Springer: New York, NY, USA; Heidelberg, Germany, 1972; Volume 1. [Google Scholar]
  33. Hou, Y. Optimal error estimates of a decoupled scheme based on two-grid finite element for mixed Stokes-Darcy model. Appl. Math. Lett. 2016, 57, 90–96. [Google Scholar] [CrossRef]
Figure 1. The partition of unity functions for the Stokes region.
Figure 1. The partition of unity functions for the Stokes region.
Mathematics 11 04820 g001
Figure 2. The performance of the solution using different algorithms: (a) velocity in H 1 -norm; (b) pressure in L 2 -norm; (c) piezometric head in H 1 -norm (d) CPU time.
Figure 2. The performance of the solution using different algorithms: (a) velocity in H 1 -norm; (b) pressure in L 2 -norm; (c) piezometric head in H 1 -norm (d) CPU time.
Mathematics 11 04820 g002
Figure 3. Streamlines of four algorithms: (a) streamline of LPSFEM 2 × 2 ; (b) streamline of LPPUSFEM 2 × 2 ; (c) streamline of LPFEM 2 × 2 ; (d) streamline of LPPUFEM 2 × 2 .
Figure 3. Streamlines of four algorithms: (a) streamline of LPSFEM 2 × 2 ; (b) streamline of LPPUSFEM 2 × 2 ; (c) streamline of LPFEM 2 × 2 ; (d) streamline of LPPUFEM 2 × 2 .
Mathematics 11 04820 g003
Table 1. The H 1 -error of the velocity of LPSFEM 2 × 2 , LPFEM 2 × 2 .
Table 1. The H 1 -error of the velocity of LPSFEM 2 × 2 , LPFEM 2 × 2 .
   1 / H    1 / h u u h 1 , Ω f    Rate u u ˜ h 1 , Ω f    Rate
416 7.48065 × 10 2 1.11563 × 10 1
864 1.79323 × 10 2 1.03030 2.65643 × 10 2 1.03515
12144 8.01801 × 10 3 0.99258 1.18060 × 10 2 1.00004
Table 2. The L 2 -error of the pressure of LPSFEM 2 × 2 , LPFEM 2 × 2 .
Table 2. The L 2 -error of the pressure of LPSFEM 2 × 2 , LPFEM 2 × 2 .
   1 / H    1 / h p p h 0 , Ω f    Rate p p ˜ h 0 , Ω f    Rate
416 5.32697 × 10 3 2.38948 × 10 2
864 1.05020 × 10 3 1.17133 4.58095 × 10 3 1.19149
12144 4.42233 × 10 4 1.06655 2.14858 × 10 3 0.93361
Table 3. The H 1 -error of the piezometric head of LPSFEM 2 × 2 , LPFEM 2 × 2 .
Table 3. The H 1 -error of the piezometric head of LPSFEM 2 × 2 , LPFEM 2 × 2 .
   1 / H    1 / h ϕ ϕ h 1 , Ω P    Rate ϕ ϕ ˜ h 1 , Ω P    Rate
416 3.88154 × 10 2 3.88539 × 10 2
864 9.29858 × 10 3 1.03077 9.30783 × 10 3 1.03077
12144 4.11933 × 10 3 1.00400 4.12162 × 10 3 1.00454
Table 4. The H 1 -error of the velocity of LPPUSFEM 2 × 2 , LPPUFEM 2 × 2 .
Table 4. The H 1 -error of the velocity of LPPUSFEM 2 × 2 , LPPUFEM 2 × 2 .
  1 / H   1 / h u u H h 1 , Ω f   Rate u u ˜ H h 1 , Ω f   Rate
416 7.37754 × 10 2 1.0415 × 10 1
864 1.79583 × 10 2 1.01924 2.5565 × 10 2 1.01319
12144 7.91917 × 10 3 1.00966 1.1437 × 10 2 0.99195
Table 5. The L 2 -error of the pressure of LPPUSFEM 2 × 2 , LPPUFEM 2 × 2 .
Table 5. The L 2 -error of the pressure of LPPUSFEM 2 × 2 , LPPUFEM 2 × 2 .
  1 / H   1 / h p p H h 0 , Ω f   Rate p p ˜ H h 0 , Ω f   Rate
416 4.25241 × 10 3 2.45224 × 10 2
864 9.77831 × 10 4 1.06031 4.56773 × 10 3 1.21228
12144 4.18785 × 10 4 1.04569 2.24674 × 10 3 0.87496
Table 6. The H 1 -error of the piezometric head of LPPUSFEM 2 × 2 , LPPUFEM 2 × 2 .
Table 6. The H 1 -error of the piezometric head of LPPUSFEM 2 × 2 , LPPUFEM 2 × 2 .
  1 / H   1 / h ϕ ϕ H h 1 , Ω P   Rate ϕ ϕ ˜ H h 1 , Ω P   Rate
416 3.75083 × 10 2 3.75503 × 10 2
864 9.28420 × 10 3 1.00718 9.29392 × 10 3 1.00723
12144 4.08802 × 10 3 1.0115 4.09047 × 10 3 1.01205
Table 7. The comparison of CPU time.
Table 7. The comparison of CPU time.
1 / h LPSFEM 2 × 2 LPFEM 2 × 2 LPPUSFEM 2 × 2 LPPUFEM 2 × 2
16 0.042 0.064 0.044 0.066
64 0.406 0.547 0.410 0.55
144 2.078 2.672 2.085 2.675
256 6.186 9.279 6.193 9.385
400 17.012 33.258 17.02 33.271
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

Han, J.; Du, G. Local and Parallel Stabilized Finite Element Methods Based on the Lowest Equal-Order Elements for the Stokes–Darcy Model. Mathematics 2023, 11, 4820. https://doi.org/10.3390/math11234820

AMA Style

Han J, Du G. Local and Parallel Stabilized Finite Element Methods Based on the Lowest Equal-Order Elements for the Stokes–Darcy Model. Mathematics. 2023; 11(23):4820. https://doi.org/10.3390/math11234820

Chicago/Turabian Style

Han, Jing, and Guangzhi Du. 2023. "Local and Parallel Stabilized Finite Element Methods Based on the Lowest Equal-Order Elements for the Stokes–Darcy Model" Mathematics 11, no. 23: 4820. https://doi.org/10.3390/math11234820

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