Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Next Article in Journal
On Physically Unacceptable Numerical Solutions Yielding Strong Chaotic Signals
Next Article in Special Issue
A Mixed Finite Element Method for Stationary Magneto-Heat Coupling System with Variable Coefficients
Previous Article in Journal
A Fast kNN Algorithm Using Multiple Space-Filling Curves
Previous Article in Special Issue
Numerical Analysis and Comparison of Three Iterative Methods Based on Finite Element for the 2D/3D Stationary Micropolar Fluid Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Optimal Error Estimate of the Fully Discrete Locally Stabilized Finite Volume Method for the Non-Stationary Navier-Stokes Problem

1
School of Mathematical Science, University of Electronic Science and Technology of China, Chengdu 610056, China
2
School of Medical Information and Engineering, Southwest Medical University, Luzhou 646099, China
*
Author to whom correspondence should be addressed.
Current address: West Hi-Tech Zone, Xiyuan Ave, No. 2006, Chengdu 611731, China.
Entropy 2022, 24(6), 768; https://doi.org/10.3390/e24060768
Submission received: 24 April 2022 / Revised: 23 May 2022 / Accepted: 26 May 2022 / Published: 30 May 2022

Abstract

:
This paper proves the optimal estimations of a low-order spatial-temporal fully discrete method for the non-stationary Navier-Stokes Problem. In this paper, the semi-implicit scheme based on Euler method is adopted for time discretization, while the special finite volume scheme is adopted for space discretization. Specifically, the spatial discretization adopts the traditional triangle P 1 P 0 trial function pair, combined with macro element form to ensure local stability. The theoretical analysis results show that under certain conditions, the full discretization proposed here has the characteristics of local stability, and we can indeed obtain the optimal theoretic and numerical order error estimation of velocity and pressure. This helps to enrich the corresponding theoretical results.

1. Introduction

Recently, due to the characteristics of simple implementation, the finite volume method has been widely used in many scientific research and engineering fields. It has obtained many ideal numerical simulation and calculation results, and often used to solve the complex engineering calculation problems well. Nevertheless, compared with a wide range of application scenarios, its theoretical analysis, such as stability and convergence analysis, is far behind, which inevitably shadow benefits of the finite volume method, so it needs to be studied continuously. Among them, the theoretical analysis of Navier Stokes process is one of the important field.
Finite volume method is an effective method to solve differential equations. In the past several decades, the calculation methods used to solve Navier-Stokes problems have developed rapidly. The results are richer and richer, but to our dismay, the theoretical analysis of the algorithm is still insufficient [1,2]. As we all know, based on the current advanced computing equipment, simple numerical methods are easy to distribute and suitable for large-scale computing, which makes them the hope of solving complex problems, such as incompressible Navier-Stokes equations. Among them, using simple coordinated low-order elements and local stabilization method is a good choice [3,4].
However, it is well known that low order coordinated finite volume function pairs, such as P 1 P 0 , are unstable for numerical solution of Navier-Stokes equations. The common way to overcome this shortage is to use local stabilization technique, that is, add “macro element condition” to improve the stability of the algorithm. This kind of low order method has been widely analyzed and applied, and has been proved to be effective in practice [5,6,7,8,9]. The basic idea of this method was first proposed by Boland and Nicolaides, and has been vigorously developed since then. The recent work of Wen [10] and Li [11] paves the way for the numerical analysis of Stokes and Navier Stokes problems. In addition, He [12] and Li [13] have given the locally stable finite volume method for partial spatial discretization of Navier-Stokes problems, which has a good effect except some fully discrete results.
This paper continues to analyze the convergence results of using FVM to solve two-dimensional time-dependent Navier-Stokes equations, so as to enrich the relevant theories. Here we will still focus on P 1 P 0 pairs. For this purpose, let’s assume T h is the uniform and regular triangulation of Ω ¯ . It should be reminded that the finite element space here does not have the inf-sup condition for ( x h , m h ) , so a similar skill in the paper [11,12,13] is required. Because these papers mainly discuss the spatial discrete case, this paper studies a approximation based on time-discretization is Euler semi-implicit and space-discretization is P 1 P 0 Locally stable FVM.
For brevity, this paper assumes T h is a regular triangulation that satisfies the general regular condition [14,15]. Let the mesh size is h and the time step is 0 < Δ t < 1 , the theoretical results of the optimal order convergence of the fully discrete FVM based on the low order coordinated finite element local stabilization are as follows:
For such a finite volume solution ( u h n , p h n ) obtained by the fully discrete locally stabilized FVM, we derive in this paper the following order error estimates:
Δ t k = 1 N A ˜ h 1 2 ( u ( t k ) u h k ) 0 2 + τ ( t n ) A ˜ h 1 2 ( u ( t n ) u h n ) 0 2 κ ( h 2 + Δ t ) ,
Δ t k = 1 N τ ( t k ) p ( t k ) p h k 0 2 + τ 2 ( t n ) p ( t n ) p h n 0 2 κ ( h 2 + Δ t ) ,
where N = T Δ t , t n = n Δ t ( 0 , T ] , τ ( t ) = m i n { 1 , t } .
The rest of the paper is organized as follows. Section 2 introduces some basic concepts and function definitions related to Navier-Stokes problem and the locally stable FVM. Some basic results are prepared in Section 3. Section 4 mainly analyzes the error estimation of time semi-discretization based on Euler semi-implicit scheme. Section 5 proves the error estimations of time and spatial fully discretization. Section 6 contains some numerical results and a summary of the article is included in Section 7.

2. Foundation of Finite Volume Method for the Navier-Stokes Problem

This article consider the follow non-stationary Navier-Stokes equations
u t ν Δ u + ( u · ) u + p = f , d i v u = 0 ( x , t ) Ω × ( 0 , T ] , u ( x , 0 ) = u 0 ( x ) x Ω ; u ( x , t ) | Ω = 0 t ( 0 , T ] ,
where Ω be a bounded domain in R 2 assumed to have a common continuous boundary Ω (stronger than Lipschitz continuity) [14,16]; u = u ( x , t ) = ( u 1 ( x , t ) , u 2 ( x , t ) ) are the velocity vector and p = p ( x , t ) is the pressure, f = f ( x , t ) is the body force, u 0 ( x ) is the initial velocity, and ν > 0 is the viscosity.
For the convenience of analysis of problem (3), we introduce the following common abbreviations
X = H 0 1 ( Ω ) 2 , Y = L 2 ( Ω ) 2 , M = L 0 2 ( Ω ) = { q L 2 ( Ω ) ; Ω q d x = 0 } ,
H = { v Y ; div v = 0 , v · n | Γ = 0 } . V = { v X ; d i v v = 0 } .
where V is the closed subset of X and H is denote the closed subset of Y, respectively. The spaces L 2 ( Ω ) m , m = 1 , 2 , 4 , are endowed with the common norm denoted by ( · , · ) and · 0 , respectively. The norms of the Hilbert space H 0 1 ( Ω ) and X are
( ( u , v ) ) = ( u , v ) , u = ( ( u , u ) ) 1 / 2 .
For more information about the above marks, we refer the reader to [14,16,17]. We also need to denote A = Δ as the Laplace operator and A ¯ = P Δ as the Stokes operator, where P is the L 2 -orthogonal projection of Y onto H.
It is known [17] that
A v 0 2 v 2 2 c A ¯ v 0 2 v H 2 ( Ω ) 2 V ,
v 0 2 γ 0 v 2 v X , v 2 γ 0 v 2 2 c A v 0 2 v D ( A ) ,
where D ( A ) = H 2 ( Ω ) 2 X , γ 0 is positive constant depending only on Ω . C, like the quantities C i , i = 1 , 2 , , appear subsequently, is a positive constant depending on Ω .
This paper uses following kind of continuous bilinear forms a ( · , · ) and d ( · , · ) on X × X and X × M , respectively,
a ( u , v ) = ν ( ( u , v ) ) u , v X ,
d ( v , q ) = ( v , q ) = ( q , div v ) v X , q M .
and a trilinear form on X × X × X
b ( u , v , w ) = 1 2 ( ( u · ) v , w ) 1 2 ( ( u · ) w , v ) u , v , w X .
With the above notations, the general variational formulation of problem (3) is: get ( u , p ) L ( 0 , T ; H ) L 2 ( 0 , T ; X ) × L 2 ( 0 , T ; M ) satisfy:
( u t , v ) + a ( u , v ) d ( v , p ) + d ( u , q ) + b ( u , u , v ) = ( f , v ) , t ( 0 , T ] , u ( 0 ) = u 0 .
for all ( v , q ) ( X , M ) .
In order to get the fully dispersed error estimates, we need the following smoothness.
Theorem 1.
Assume some continuity of u 0 and f ( x ) are valid [14,17]. Then problem (6) admits a unique solution ( u , p ) satisfying the following estimates:
u ( t ) 2 + 0 t u t 0 2 + A u 0 2 + p 1 2 d s κ , τ ( t ) A u ( t ) 0 2 + p ( t ) 1 2 + u t ( t ) 0 2 + 0 t τ ( s ) u t 2 d s κ , τ 2 ( t ) u t ( t ) 2 + 0 t τ 2 ( s ) ( u t t 0 2 + A u t 0 2 + p t 1 2 ) d s κ ,
for all t [ 0 , T ] , where κ is a positive constant.
Now, we consider the fully discrete locally stabilized FVM for two-dimensional time-dependent incompressible Navier-Stokes Equation (3). For convenience, let τ h = τ h ( Ω ) a partitioning of Ω ¯ into triangles satisfied the regular in the usual sense (see [5,14]). ( X h , M h ) are the corresponding finite element subspace of ( X , M ) . Γ h is the set of all interelement boundaries.
In order to define the finite volume method for Equation (3), We need introduce a popular configuration of dual partition T h * for T h : the interior point p i is chosen to the barycenter of element K i T h , and the midpoint m i j on side of v i v j ¯ . See Figure 1. This type of dual partition is locally regular if T h is locally regular.
Corresponding to Hilbert space V , H , we define the following finite element velocity subspaces
X h = { v X : v i | K P 1 ( K ) , i = 1 , 2 K τ h } ,
and the pressure subspace
M h = { q M : q | K P 0 ( K ) K τ h } .
The finite volume dual of velocity is X h *
X h * = { v L 2 ( Ω ) 2 : v i | K * P 0 ( K * ) , i = 1 , 2 K * T h * } .
Let interpolation operator I h * : X h X h * .
I h * u h = x i N h u h ( x i ) χ i ( x ) .
The L 2 dimensional reduction P h : X X h and J h : M M h are defined as follows:
( P h v , v h ) = ( v , v h ) v Y , v h X h , ( J h q , q h ) = ( q , q h ) q M , q h M h .
The finite volume forms of velocity a ˜ ( · , · ) on X h × X h is,
a ˜ ( u h , I h * v h ) = ν ( ( u h , I h * v h ) ) = ν K i * T h * K i * v h ( x i ) u h n d s u h , v h X h ,
where n is the unit outnormal vector. The finite volume form d ˜ ( · , · ) of pressure on X h × M h is defined as
d ˜ ( I h * v h , p h ) = ( I h * v h , p h ) = K i * T h * K i * p h v h ( x i ) · n d s u h X h , p h M h ,
To facilitate the analysis, we need the following two trilinear forms.
b ˜ ( u h , v h , I h * w h ) = ( ( u h · ) v h , I h * w h ) + 1 2 ( ( div u h ) v h , I h * w h ) , b ¯ ( u h , v h , w h I h * w h ) = ( ( u h · ) v h , I h * w h I h * w h ) + 1 2 ( ( div u h ) v h , w h I h * w h ) u h , v h , w h X h ,
The last time difference part is
( u h t , I h * v h ) = K i * T h * K i * v h ( x i ) u h t d x v h X h .
The finite volume form of the right side is
( f , I h * v h ) = K i * T h * K i * v h ( x i ) f d x v h X h .
For the convenience of reading, we introduce the following generalized form
B ˜ ( ( u h , p h ) ; ( I h * v h , q h ) ) = a ˜ ( u h , I h * v h ) d ˜ ( I h * v h , p h ) + d ( u h , q h ) .
In this paper, the norms are defined as following:
u h 0 , h , K = S Q 3 ( u P i 2 + u P j 2 + u P k 2 ) 1 / 2 , A ˜ h 1 / 2 u h 0 , h , K = u h ( Q ) x 2 + u h ( Q ) y 2 S Q 1 / 2 ,
u h 0 , h = K T h u h 0 , h , K 2 1 / 2 , A ˜ h 1 / 2 u h 0 = K T h A ˜ h 1 / 2 u h 0 , h , K 2 1 / 2 , u h 1 , h = u h 0 , h 2 + A ˜ h 1 / 2 u h 0 2 1 / 2 ,
where S Q is the area of P i P j P k (see Figure 2).
To describe the locally stabilized formulation of the non-stationary Navier-Stokes problem, we use the classic not overlap macroelement partitioning  Λ h [18]. For every macroelement K in Λ h , the set of interelement(small finite element) edges is denoted by Γ K , and the length of an edge e Γ K is denoted by h e .
With the above definitions, a locally stabilized formulation of the non-stationary Navier-Stokes problem (3) can be stated as follows.
Definition 1.
Locally stabilized finite volume formulation for non-stationary Navier-Stokes: Find ( u h , p h ) ( X h , M h ) , such that for all ( v , q ) ( X h , M h )
( u h t , I h * v ) + B ˜ h ( ( u h , p h ) ; ( I h * v , q ) ) + b ˜ ( u h , u h , I h * w h ) = ( f , I h * v ) , u h ( 0 ) = u 0 h .
where
B ˜ h ( ( u h , p h ) ; ( I h * v , q ) ) = B ˜ ( ( u h , p h ) ; ( I h * v , q ) ) + β C h ( p h , q ) ( u h , p h ) , ( v , q ) ( X h , M h ) ,
C h ( p , q ) = K Λ h e Γ K h e e [ p ] e [ q ] e d s ,
for all p , q in the algebraic sum H 1 ( Ω ) + M h , and [ · ] e is the jump operator across e Γ K and β > 0 is the local stabilization parameter.
In order get the regularity of the above definitions, we need the following stability results [5,8,9,12].
Theorem 2.
For any two neighboring macroelements K 1 and K 2 with K 1 K 2 d s 0 , if there exists v X h such that
s u p p v K 1 K 2 and K 1 K 2 v · n d s 0 .
Then
| B ˜ h ( ( u , p ) ; ( I h * v , q ) ) | c ( u + p 0 ) ( v + q 0 ) ( u , p ) , ( v , q ) ( X , M ) , α ( A ˜ h 1 2 u h 0 + p h 0 ) sup ( v h , q h ) ( X h , M h ) B ˜ h ( ( u h , p h ) ; ( I h * v h , q h ) ) A ˜ h 1 2 v h 0 + q h 0
for all ( u h , p h ) ( X h , M h ) , and
C h ( p , q h ) = 0 , C h ( p h , q ) = 0 , C h ( p , q ) = 0 p , q H 1 ( Ω ) , p h , q h M h ,
where β β 0 > 0 and α > 0 are two constant.

3. Technical Preliminaries

The main task of this section is to prepare many basic estimates which will help the error analyses for the finite volume solution ( u h , p h ) .
Since the bilinear forms ( ( u h , v h ) ) and ( ( u h , I h * v h ) ) are coercive on X h × X h , they generate invertible operators A h : X h X h and A ˜ h : X h X h respectively through the condition:
( A h u h , v h ) = ( A h 1 / 2 u h , A h 1 / 2 v h ) = ( ( u h , v h ) ) u h , v h X h , ( A ˜ h u h , I h * v h ) = ( ( u h , I h * v h ) ) u h , v h X h .
Moreover, we also need the discrete gradient operators:
( v h , h q h ) = d ( v h , q h ) ( v h , q h ) ( X h , M h ) ,
Firstly, we have the following classical properties (see [8,19])
v h c h 1 v h 0 , v h c | ln h | 1 / 2 v h v h X h , P h v c v v X . v I h v 0 + h v I h v c h 2 v 2 v D ( A ) , v I h * v 0 c h v v X ,
where v = v L = ess . sup x Ω v ( x ) 0 . For the P 1 P 0 triangular element, It follows from (4), (5) and (13) that [20,21]
v h 0 γ 0 v h , v h γ 0 A h v h 0 , A h v h 0 c h 1 v h v h X h , v h 0 , h γ 0 A ˜ h 1 2 v h 0 , A ˜ h 1 2 v h 0 γ 0 A ˜ h v h 0 v h X h , A ˜ h 1 2 v h 0 c h 1 v h 0 , h , A ˜ h v h 0 c h 1 A ˜ h 1 2 v h 0 v h X h , c 1 v h 0 v h 0 , h c 1 v h 0 , c 1 A h v h 0 A ˜ h v h 0 c 1 A h v h 0 v h X h .
As for the trilinear forms b ˜ and b ¯ ,we can deduce the following results.
Lemma 1.
If u h , v h , w h X h , we have
| b ˜ ( u h , v h , I h * w h ) | +   | b ¯ ( u h , v h , w h I h * w h ) | c 2 A ˜ h 1 2 u h 0 A ˜ h 1 2 v h 0 A ˜ h 1 2 w h 0 , | b ˜ ( u h , v h , I h * w h ) | c 2 u h 0 A ˜ h 1 2 v h 0 A ˜ h 1 2 w h 0 1 / 2 A ˜ h w h 0 1 2 , | b ˜ ( u h , v h , I h * w h ) | c 2 A ˜ h 1 2 u h 0 1 / 2 A ˜ h u h 0 1 2 A ˜ h 1 2 v h 0 w h 0 . | b ˜ ( u h , v h , I h * w h ) | c 2 | ln h | 1 2 A ˜ h 1 2 u h 0 A ˜ h 1 2 v h 0 w h 0 ,
Proof. 
Since the following discrete analogue of the Sobolev inequality holds [17]
ϕ h L 4 c ϕ h 0 1 / 2 A h 1 / 2 ϕ h 0 1 / 2 ϕ h X h .
If u h , v h , w h X h , , we have
b ˜ ( u h , v h , I h * w h ) c u h L 4 A h 1 / 2 v h 0 w h L 4 ,
combining the above formula with (14) and (16), we can get the first formula in (15).
To prove the others in (15), we need the follow discrete results [17,22], namely for any h > 0 ,
ϕ h L c 3 | ln h | 1 / 2 v h , ϕ h L 6 c 3 ϕ h ϕ h X h , ϕ h L + ϕ h L 3 c 3 ϕ h 1 / 2 A h ϕ h 0 1 / 2 ϕ h X h .
For any u h , v h , w h X h , we have [9]
| b ˜ ( u h , v h , I h * w h ) | c 4 u h L A ˜ h 1 2 v h 0 w h 0 + c 4 u h L 3 v h L 6 w h 0 , | b ˜ ( v h , u h , I h * w h ) | c 4 v h L 6 u h L 3 w h 0 + c 4 A ˜ h 1 2 v h 0 u h L w h 0 , | b ˜ ( u h , v h , I h * w h ) | c 4 u h 0 A ˜ h 1 2 v h w h L + c 4 u h 0 v h L 3 w h L 6 ,
which together with (14), (17) imply (15).  □
Similar to the results in [12], we also need to define the projection operator ( R ˜ h , Q ˜ h ) : ( X , Y ) ( X h , M h ) as
B ˜ h ( ( R ˜ h ( u , p ) , Q ˜ h ( u , p ) ) ; ( I h * v h , q h ) ) = B ˜ h ( ( u , p ) ; ( I h * v h , q h ) ) ( u , p ) ( X , M ) , ( v h , q h ) ( X h , M h ) .
Due to Theorem 2, we know that ( R ˜ h , Q ˜ h ) is well defined and have the properties [12]:
A ˜ h 1 2 ( R ˜ h ( u , p ) u ) 0 + Q ˜ h ( u , p ) p 0 c h ( u 2 + p 1 ) ,
for all ( u , p ) ( H 2 ( Ω ) 2 X , H 1 ( Ω ) M ) .
Beside, we need the specific result in He et al. [12].
Theorem 3.
Under the assumptions of Theorems 1 and 2, ( u h , p h ) satisfies
0 t A ˜ h 1 2 ( u u h ) 0 2 d s + τ ( t ) A ˜ h 1 2 ( u ( t ) u h ( t ) ) 0 2 + τ 2 ( t ) p ( t ) p h ( t ) 0 2 κ h 2 ,
for all t [ 0 , T ] .
Since our error analysis for the time discretization depends heavily on these regularity estimates, we then provide some smoothness estimates of ( u h , p h ) . The main idea is similar to the work in He et al. [9,23].
Theorem 4.
Under the assumptions of Theorems 3, the finite volume solution ( u h , p h ) satisfies
A ˜ h 1 2 u h ( t ) 0 2 + 0 t ( A ˜ h 1 ( u h t t + h p h t ) 0 2 + u h t 0 2 + A ˜ h u h 0 2 ) d s κ , τ 2 ( t ) A ˜ h 1 2 u h t ( t ) 2 + 0 τ τ 2 ( s ) ( u h t t + h p h t 0 2 + A ˜ h u h t 0 2 ) d s κ , τ 2 ( t ) A ˜ h 1 2 u h t ( t ) 2 + 0 τ τ 2 ( s ) ( u h t t + h p h t 0 2 + A ˜ h u h t 0 2 ) d s κ ,
for all t [ 0 , T ] .
Proof. 
Note from (13) and (14) we can deduce the following estimates:
A ˜ h 1 2 u h ( t ) 0 A ˜ h 1 2 ( u h ( t ) A h 1 / 2 P h u ( t ) ) 0 + c u ( t ) c h 1 u h ( t ) u ( t ) 0 + c u ( t ) , A ˜ h u h 0 = sup v h X h | ( A ˜ h u h , I h * v h ) | I h * v h 0 ( c h 1 A ˜ h 1 2 ( u u h ) 0 + A u 0 ) .
and from Theorems 1 and 3, we have
A ˜ h 1 2 u h ( t ) 0 2 + 0 t A ˜ h u h 0 2 d s c u ( t ) 2 + 0 t A u 0 2 d s + c h 2 u ( t ) u h ( t ) 0 , h 2 + 0 t A ˜ h 1 2 ( u u h ) 0 2 d s κ , τ ( t ) A ˜ h u h ( t ) 0 2 c τ ( t ) ( h 2 A ˜ h 1 2 ( u ( t ) u h ( t ) ) 0 2 + A u ( t ) 0 2 ) κ ,
for all t [ 0 , T ] . Then using the similar method in [9], we can get these estimates (20).  □
Finally, in order to get the upper bounders of velocity and pressure in the time related case, we state the classical Gronwall lemma used in [24].
Lemma 2.
Let C 0 and a k , b k , c k , d k , for integers k 0 , be nonnegative numbers such that
a n + Δ t k = 0 n b k Δ t k = 0 n 1 d k a k + Δ t k = 0 n 1 c k + C 0 n 1 .
Then,
a n + Δ t k = 0 n b k exp Δ t k = 0 n 1 d k Δ t k = 0 n 1 c k + C 0 n 1 .
The following is dual Gronwall lemma.
Lemma 3.
Given integer m > 0 and let C and a k , b k , c k , d k , for integers 0 k m , be nonnegative numbers such that
a n + Δ t k = n + 1 m b k Δ t k = n + 1 m d k a k + Δ t k = n + 1 m c k + C , 0 n m .
Then,
a n + Δ t k = n + 1 m b k exp Δ t k = n + 1 m d k Δ t k = n + 1 m c k + C , 0 n m .

4. Error Estimates for Semi-Discrete for Time Depended Navier-Stokes Equations

In this section we consider the time discretization of the locally stabilized and get some useful estimates. Let T time to stop calculation and N the time corresponding step. So we have
Δ t = T N , t n = n Δ t , n = 0 , 1 , , N .
For the first part, we need to analysis the errors of finite element Original case. It’s well known that the common Euler semi-implicit scheme applied to the spatially discrete problem (9) can be described as:
( d t u h n , I h * v h ) + B ˜ h ( ( u h n , p h n ) ; ( I h * v h , q h ) ) + b ˜ ( u h n 1 , u h n , I h * v h ) = ( f n , I h * v h ) ,
for all ( v h , q h ) ( X h , M h ) , where u h 0 = u 0 h is starting value and
d t u h n = 1 Δ t ( u h n u h n 1 ) , f n = 1 Δ t t n 1 t n f ( t ) d t ,
p ¯ h ( t n ) = 1 Δ t t n 1 t n p h ( t ) d t .
To deduce the discretization error ( e h n , μ h n ) = ( u h ( t n ) u h n , p ¯ h ( t n ) p h n ) , we integrate and differentiate (9), respectively, to get
1 Δ t ( u h ( t n ) u h ( t n 1 ) , I h * v h ) + 1 Δ t t n 1 t n B ˜ h ( ( u h ( t ) , p h ( t ) ) ; ( I h * v h , q h ) ) ) d t + 1 Δ t t n 1 t n b ˜ ( u h ( t ) , u h ( t ) , I h * v h ) d t = ( f n , I h * v h ) ,
( u h t t + h p h t , I h * v h ) + a ˜ ( u h t , I h * v h ) d ˜ ( I h * v h , u h t ) + d ( u h t , q h ) + h ( p h t , q h ) + b ˜ ( u h t , u h , I h * v h ) + b ˜ ( u h , u h t , I h * v h ) = ( f t , I h * v h ) ,
for all ( v h , q h ) ( X h , M h ) .
Subtracting (25) from (26) and using (27) and the relation:
ϕ ( t n ) 1 Δ t t n 1 t n ϕ ( t ) d t = 1 Δ t t n 1 t n ( t t n 1 ) ϕ t ( t ) d t
for all ϕ H 1 ( t n 1 , t n ; F ) for some Hilbert space F, we have
( d t e h n , v h ) + B ˜ h ( ( e h n , μ h n ) ; ( I h * v h , q h ) ) + b ˜ ( e h n 1 , u h ( t n ) , I h * v h ) + b ˜ ( u h n 1 , e h n , I h * v h ) = ( E n , I h * v h ) ,
for all ( v h , q h ) ( X h , M h ) , where ( e h 0 , μ h 0 ) = ( 0 , 0 ) and
( E n , I h * v h ) = 1 Δ t t n 1 t n ( t t n 1 ) ( u h t t + h p h t , I h * v h ) d t + b ˜ t n 1 t n u h t d t , u h ( t n ) , I h * v h .
Lemma 4.
Under the assumptions of Theorem 3 the error E n satisfies the following bounds:
Δ t n = 1 m A ˜ h 1 E n 0 2 κ Δ t 2 , 1 m N , Δ t n = 1 m τ i ( t n ) A ˜ h 1 / 2 E n 0 2 κ Δ t i + 1 , 1 m N , i = 0 , 1 , Δ t n = 1 m τ i ( t n ) E n 0 , h 2 κ Δ t i , 1 m N , i = 0 , 1 , 2 .
Proof. 
By using (14), (15) and (29), we derive
A ˜ h 1 E n 0 1 Δ t t n 1 t n ( t t n 1 ) A ˜ h 1 ( u h t t + h p h t ) 0 d t + c A ˜ h 1 2 u h ( t n ) 0 t n 1 t n u h t 0 d t c Δ t 1 / 2 t n 1 t n A ˜ h 1 ( u h t t + h p h t ) 0 2 + A ˜ h 1 2 u h ( t n ) 0 2 u h t 0 2 d t 1 / 2 .
Applying Theorem 4 in (39), we obtain
Δ t A ˜ h 1 E n 0 2 c Δ t 2 t n 1 t n A ˜ h 1 ( u h t t + h p h t ) 0 2 + u h t 0 2 d t .
Utilizing Theorem 4, if we sum (32) from n = 1 to n = m , we can derive the first inequality in (30) directly.
Next, we deduce from (19) and (29) that
A ˜ h 1 / 2 E n 0 1 Δ t t n 1 t n ( t t n 1 ) A ˜ h 1 / 2 ( u h t t + h p h t ) 0 d t + c t n 1 t n A ˜ h u h ( t n ) 0 u h t t 0 d t c ( t n 1 t n ( t t n 1 ) A ˜ h 1 / 2 ( u h t t + h p h t ) 0 2 + Δ t A ˜ h u h ( t n ) 0 2 u h t 0 2 d t ) 1 / 2 .
Because
τ ( t n ) τ ( t ) + Δ t , Δ t τ ( t n ) , t t n 1 τ ( t ) , t [ t n 1 , t n ] ,
We can deduce from (33) and Theorem 4 to get
τ i ( t n ) A ˜ h 1 / 2 E n 0 2 Δ t c Δ t 1 + i t n 1 t n ( τ ( t ) A ˜ h 1 / 2 ( u h t t + h p h t ) 0 2 + u h t 0 2 ) d t ,
for i = 0 , 1 . Summing (35) from n = 1 to n = m , we derive the second inequality in (30).
As for the last one, Deriving from (14) and (29), we have
E n 0 , h 1 Δ t t n 1 t n ( t t n 1 ) u h t t + h p h t 0 d t + c A ˜ h u h ( t n ) 0 A ˜ h 1 2 ( u h ( t n ) u h ( t n 1 ) ) 0 .
Hence, Formula (36) and Theorem 4 imply that
τ i ( t n ) E n 0 , h 2 Δ t c τ i ( t n ) t n 1 t n ( t t n 1 ) 2 u h t t + h p h t 0 2 d t + c τ i ( t n ) A ˜ h u h ( t n ) 0 2 A ˜ h 1 2 ( u h ( t n ) u h ( t n 1 ) ) 0 2 Δ t .
Similarly, summing (37) from n = 1 to n = m and using Theorem 4 deduces
Δ t n = 1 m τ i ( t n ) E n 0 , h 2 c n = 1 m τ i ( t n ) t n 1 t n ( t t n 1 ) 2 u h t t + h p h t 0 2 d t + c τ i ( t 1 ) A ˜ h u h ( t 1 ) 0 2 A ˜ h 1 2 ( u h ( t 1 ) u h ( t 0 ) ) 0 2 Δ t + c Δ t 2 n = 2 m τ i ( t n ) A ˜ h u h ( t n ) 0 2 t n 1 t n A ˜ h 1 2 u h t 0 2 d t c Δ t i n = 1 m t n 1 t n τ 2 ( t ) u h t t + h p h t 0 2 d t + c A ˜ h 1 2 ( u h ( t 1 ) u h ( t 0 ) ) 0 2 Δ t i + c Δ t i n = 2 m t n 1 t n τ ( t ) A ˜ h 1 2 u h t 0 2 d t κ Δ t i ,
for i = 0,1,2, which yields the third one in (30).  □
Now, let’s discuss the second part: the error of time discrete duality argument corresponding to (25). Firstly, the dual problem corresponding to (25) usually describes as: find ( Φ h n 1 , Ψ h n 1 ) ( X h , M h ) such that, for all ( v h , q h ) ( X h , M h ) ,
( v h , I h * ( d t Φ h n ) ) B ˜ h ( ( v h , q h ) ; ( I h * Φ h n 1 , Ψ h n 1 ) ) b ˜ ( v h , u h ( t n ) , I h * Φ h n 1 ) b ˜ ( u h ( t n 1 ) , v h , I h * Φ h n 1 ) = ( v h , I h * z n ) ,
where Φ h m = 0 .
For the dual part, we also need the existence, uniqueness and regularity of problem (38), so we introduce the following results:
P h B ( u h ( t n ) , · ) * = sup v h X h P h B ( u h ( t n ) , v h ) 0 A ˜ h 1 2 v h 0 , P h B ( · , u h ( t n ) ) * = sup v h X h P h B ( v h , u h ( t n ) ) 0 A ˜ h 1 2 v h 0 .
With the similar method in He [9], we have the following two lemmas.
Lemma 5.
Assume that the assumptions of Theorem 3 is valid and Δ t satisfies
8 ν c 2 2 | ln h | max t [ 0 , T ] A ˜ h 1 2 u h ( t ) 0 2 Δ t 1 .
Then,
Δ t n = 1 N P h B ( u h ( t n 1 ) , · ) * 2 + P h B ( · , u h ( t n ) * 2 κ .
Lemma 6.
Assume that the assumptions of Theorem 3 are valid and that Δ t satisfies (39). Then, problem (38) admits a unique solution ( Φ h n 1 , Ψ h n 1 ) ( X h , M h ) for a given Φ h n . Furthermore, the solution sequence { Φ h n , Ψ h n } n = 0 m 1 of problem (38) satisfies the following bound
sup 0 r m A ˜ h 1 2 Φ h r 0 2 + Δ t n = 1 m 1 d t Φ h n 0 2 + Δ t n = 0 m 1 A ˜ h Φ h n 0 2 κ Δ t n = 1 m z n 0 2 .

5. Error Analysis for Time and Spacial Discrete

In this section we proof the upper bounds for the error ( e h n , μ h n ) = ( u h ( t n ) u h n , p ¯ h ( t n ) p h n ) in L 2 and H 1 norms, and deduce the last optimal order estimates. Firstly, we have
Lemma 7.
Assume that the assumptions of Theorem 3 are valid and Δ t satisfies (39). Then, the error ( e h n , μ h n ) , 1 n N , satisfies the following bound:
e h m 0 , h 2 + Δ t n = 1 m A ˜ h 1 2 e h n 0 2 + β C h ( μ h n , μ h n ) κ Δ t , 1 m N .
Proof. 
Setting v h = e h n , q h = μ h n in (28) and using (14) we obtain
c 1 2 Δ t ( e h n 0 2 + e h n e h n 1 0 2 e h n 1 0 2 ) + ν A ˜ h 1 2 e h n 0 2 + β C h ( μ h n , μ h n ) + b ˜ ( e h n 1 , u ( t n ) , I h * e h n ) + b ˜ ( u ( t n ) , e h n , I h * e h n ) = ( E n , e h n ) ν 4 A ˜ h 1 2 e h n 0 2 + ν 1 A h 1 / 2 E n 0 2 .
From (14) and (15), we deduce that
| b ˜ ( e h n 1 , u h ( t n ) , I h * e h n ) | c e h n 1 0 P h B ( · , u h ( t n ) ) * A ˜ h 1 2 e h n 0 ν 8 A ˜ h 1 2 e h n 0 2 + κ P h B ( · , u h ( t n ) ) * 2 e h n 1 0 2 , | b ˜ ( u ( t n ) , e h n , I h * e h n ) | c e h n 0 P h B ( · , u h ( t n ) ) * A ˜ h 1 2 e h n 0 ν 8 A ˜ h 1 2 e h n 0 2 + κ P h B ( · , u h ( t n ) ) * 2 e h n 0 2 .
Combining (43) with the above estimate yields
e h n 0 2 e h n 1 0 2 + ( ν A ˜ h 1 2 e h n 0 2 + β C h ( μ h n , μ h n ) ) Δ t κ P h B ( · , u h ( t n ) ) * 2 ( e h n 1 0 , h 2 + e h n 0 , h 2 ) + A ˜ h 1 / 2 E n 0 2 Δ t .
Summing (44) from n = 1 to n = m , we obtain
e m 0 , h 2 + Δ t n = 1 m ( ν A ˜ h 1 2 e h n 0 2 + β C h ( μ h n , μ h n ) ) κ Δ t n = 1 m P h B ( · , u h ( t n + 1 ) ) * 2 ( e h n 1 0 , h 2 + e h n 0 , h 2 ) + n = 1 m A ˜ h 1 / 2 E n 0 2 .
Applying Lemmas 3 and 6 in (45) and by (14) yields (43).  □
Lemma 8.
Under the assumptions of Lemma 7, we have
A ˜ h 1 2 e h m 2 + Δ t n = 1 m d t e h n 0 , h 2 κ , 1 m N .
Proof. 
We derive from (28) that
( d t e h n , I h * v h ) + a ˜ ( e h n , I h * v h ) d ˜ ( I h * v h , μ h n ) + d ( d t e h n , q h ) + β C h ( d t μ h n , q h ) + b ˜ ( e h n 1 , u h ( t n ) , I h * v h ) + b ˜ ( u h n 1 , e h n , I h * v h ) = ( E n , I h * v h ) ,
for all ( v h , q h ) ( X h , M h ) . Setting ( v h , q h ) = ( d t e h n , μ h n ) Δ t in (47), we obtain
Δ t d t e h n 0 , h 2 + ν 2 ( A ˜ h 1 2 e h n 0 2 A ˜ h 1 2 e h n 1 0 2 ) + β 2 ( C h ( μ h n , μ h n ) C h ( μ h n 1 , μ h n 1 ) ) + b ˜ ( e h n 1 , u h ( t n ) , I h * d t e h n ) Δ t + b ˜ ( u h ( t n 1 ) , e h n 1 , I h * d t e h n ) Δ t + b ˜ ( e h n 1 , e h n , I h * d t e h n ) Δ t = ( E n , I h * d t e h n ) Δ t
From (5) and Lemma 1, we get that
| b ˜ ( e h n 1 , u h ( t n ) , I h * d t e h n ) | + | b ˜ ( u h ( t n 1 ) , e h n 1 , I h * d t e h n ) | 1 8 d t e h n 0 , h 2 + κ P h B ( · , u h ( t n ) ) * 2 + P h B ( u h ( t n 1 ) , · ) * 2 A ˜ h 1 2 e h n 1 0 2 , | b ( e h n 1 , e h n , I h * d t e h n ) | Δ t c A ˜ h 1 2 e h n 0 A ˜ h 1 2 e h n 1 0 2 + κ A ˜ h 1 2 e h n 0 2 A ˜ h 1 2 e h n 1 0 , | ( E n , I h * d t e h n ) | 1 4 d t e h n 0 , h 2 + c E n 0 2 .
Combining (48) with the above estimates and using Lemma 7 yields
A ˜ h 1 2 e h n 0 2 A ˜ h 1 2 e h n 1 0 2 + ν 1 β ( C h ( μ h n , μ h n ) C h ( μ h n 1 , μ h n 1 ) ) + ν 1 d t e h n 0 , h 2 Δ t κ ( ( P h B ( · , u h ( t n ) ) * 2 + P h B ( u h ( t n 1 ) , · ) * 2 ) + A ˜ h 1 2 e h n 0 A ˜ h 1 2 e h n 1 0 2 + c A ˜ h 1 2 e h n 0 2 A ˜ h 1 2 e h n 1 0 + c E n 0 , h 2 ) Δ t .
Summing (48) from n = 1 to n = m and applying Lemmas 5 and 7, we obtain
A ˜ h 1 2 e m 0 2 + ν 1 Δ t n = 1 m ( d t e h n 0 , h 2 κ n = 1 m ( Δ t ( P h B ( · , u h ( t n ) ) * 2 + P h B ( u h ( t n 1 ) , · ) * 2 ) A ˜ h 1 2 e h n 1 0 2 A ˜ h 1 2 e h n 0 A ˜ h 1 2 e h n 1 0 2 + A ˜ h 1 2 e h n 0 2 A ˜ h 1 2 e h n 1 0 + Δ t E n 0 , h 2 ) κ .
Combining the above estimate with (14) which yields(46).  □
Lemma 9.
Under the assumptions of Lemma 7, we have that
τ ( t m ) e h m 0 , h 2 + Δ t n = 1 m e h n 0 , h 2 + τ ( t n ) A ˜ h 1 2 e h n 0 2 + τ ( t n ) C h ( μ h n , μ h n ) κ Δ t 2 .
for all 1 m N .
Proof. 
Setting v = e h n , q = μ h n , z n = e h n in (38) and v h = Φ h n 1 , q h = Ψ h n 1 in (28) we obtain
( e h n , I h * d t Φ h n ) B ˜ h ( ( e h n , μ h n ) ; ( I h * Φ h n 1 , Ψ h n 1 ) ) b ˜ ( e h n , u h ( t n ) , I h * Φ h n 1 ) b ˜ ( u h ( t n 1 ) , e h n , I h * Φ h n 1 ) = ( e h n , I h * e h n ) ,
( d t e n , I h * Φ h n 1 ) + B ˜ h ( ( e h n , μ h n ) ; ( I h * Φ h n 1 , Ψ h n 1 ) ) + b ˜ ( u h n 1 , e h n , I h * Φ h n 1 ) + b ˜ ( e h n 1 , u h ( t n ) , I h * Φ n 1 ) = ( E n , I h * Φ h n 1 ) .
Adding (52) to (51), we obtain
e h n 0 , h 2 = 1 Δ t ( ( e h n , I h * Φ n ) ( e h n 1 , I h * Φ n 1 ) ) b ˜ ( d t e h n , u h ( t n ) , I h * Φ n 1 ) Δ t b ˜ ( e n 1 , e n , I h * Φ h n 1 ) ( E n , I h * Φ h n 1 ) .
It follows from (14) and (15) that
| b ˜ ( e h n 1 , e h n , I h * Φ h n 1 ) | c A ˜ h 1 2 e h n 1 0 A ˜ h 1 2 e h n 0 A ˜ h 1 2 Φ h n 1 0 , | b ˜ ( d t e h n , u h ( t n ) , I h * Φ h n 1 ) | c d t e h n 0 , h P h ( · , u h ( t n ) ) * A ˜ h 1 2 Φ h n 1 0 , ( E n , I h * Φ h n 1 ) 0 A ˜ h 1 E n 0 A ˜ h Φ h n 1 0 .
Combining (53) with the above estimates yields
e h n 0 , h 2 Δ t = ( e h n , I h * Φ h n ) ( e h n 1 , I h * Φ h n 1 ) + c A ˜ h 1 2 e h n 1 0 A ˜ h 1 2 e h n 0 A ˜ h 1 2 Φ n 1 0 Δ t + c Δ t 2 d t e h n 0 , h P h B ( · , u h ( t n ) ) * A ˜ h 1 2 Φ h n 1 0 + A ˜ h 1 E n 0 A ˜ h Φ h n 1 0 Δ t ,
with e h 0 = Φ m = 0 . Summing (54) from n = 1 to n = m and applying Lemma 6, we obtain
Δ t n = 1 m e h n 0 , h 2 κ Δ t n = 1 m A ˜ h 1 2 e h n 0 2 + n = 1 m A ˜ h 1 E n 0 2 + c Δ t 2 n = 1 m d t e h n 0 , h 2 Δ t n = 1 m P h B ( · , u h ( t n ) ) * 2 Δ t .
Applying Lemmas 4, 5, 7 and 8 in (55), we get and
Δ t n = 1 m e h n 0 , h 2 κ Δ t 2 , 1 m N .
Now, multiplying (55) by τ ( t n ) and noting
τ ( t n ) Δ t + τ ( t n 1 ) , Δ t τ ( t n 1 ) , 2 n N , e h n 1 = 0 , f o r n = 1 ,
we get
τ ( t n ) e h n 0 2 τ ( t n 1 ) e h n 1 0 2 + τ ( t n ) ( ν A ˜ h 1 2 e h n 0 2 + β C h ( μ h n , μ h n ) ) Δ t c P h B ( · , u h ( t n ) ) * 2 τ ( t n 1 ) e h n 1 0 2 Δ t + c e h n 1 0 2 + τ ( t n ) A ˜ h 1 / 2 E n 0 2 Δ t .
Summing (57) from n = 1 to n = m and applying Lemmas 3 and 5, we deduce that
τ ( t m ) e h m 0 , h 2 + Δ t n = 1 m τ ( t n ) ( ν A ˜ h 1 2 e h n 0 2 + β C h ( μ h n , μ h n ) ) κ Δ t n = 1 m e h n 1 0 , h 2 + τ ( t n ) A h 1 / 2 E n 0 2 .
Applying Lemma 4 and (56) in (58), we have
τ ( t m ) e h m 0 , h 2 + Δ t n = 0 m τ ( t n ) ν A ˜ h 1 2 e h n 0 2 + β C h ( μ h n , μ h n ) κ Δ t 2 .
this and (56) yield (50).  □
Lemma 10.
Under the assumptions of Lemma 7, the error ( e h n , μ h n ) satisfies the following bound:
τ 2 ( t m ) A ˜ h 1 2 e h m 0 2 + Δ t n = 1 m τ 2 ( t n ) d t e h n 0 , h 2 κ Δ t 2 , 1 m N .
Proof. 
Multiplying (49) by τ 2 ( t n ) , noting τ 2 ( t n ) τ 2 ( t n 1 ) + 3 τ ( t n 1 ) Δ t and using Theorem 4, we have that
τ 2 ( t n ) ( A ˜ h 1 2 e h n 0 2 + ν 1 β C h ( μ h n , μ h n ) ) τ 2 ( t n 1 ) ( A ˜ h 1 2 e h n 1 0 2 + ν 1 β C h ( μ h n 1 , μ h n 1 ) ) + ν 1 τ 2 ( t n ) d t e h n 0 , h 2 Δ t c τ 2 ( t n ) E n 0 , h 2 Δ t + c τ ( t n 1 ) ( A ˜ h 1 2 e h n 1 0 2 + ν 1 β C h ( μ h n 1 , μ h n 1 ) ) Δ t .
Summing (61) from n = 1 to n = m and applying Lemmas 4 and 9, we have
τ 2 ( t m ) A ˜ h 1 2 e h m 0 2 + Δ t n = 1 m τ 2 ( t n ) d t e h n 0 , h 2 κ Δ t 2 .
 □
Lemma 11.
Under the assumptions of Lemma 7, the error μ h n = p ¯ h ( t n ) p h n satisfies the following bound:
τ 2 ( t n ) p ¯ h ( t n ) p h n 0 2 κ Δ t , 1 m N .
Proof. 
From Theorem 2, (5), (14) and (28), we deduce that
μ h n 0 c A ˜ h 1 2 e h n 0 + c d t e h n 0 , h + c A ˜ h 1 2 e h n 1 0 + A ˜ h 1 2 u h ( t n 1 ) 0 A ˜ h 1 2 e h n 0 + c A ˜ h 1 2 u h ( t n ) 0 A ˜ h 1 2 e h n 1 0 + c E n 0 , h .
Hence
τ 2 ( t n ) μ h n 0 2 Δ t κ τ ( t n ) A ˜ h 1 2 e h n 0 2 + τ ( t n 1 ) A ˜ h 1 2 e h n 1 0 2 Δ t + κ A ˜ h 1 2 e h n 1 0 2 Δ t 2 + c τ 2 ( t n ) d t e h n 0 , h 2 Δ t + c τ 2 ( t n ) E n 0 , h 2 Δ t .
Summing (64) for n from n = 1 to n = m and applying Lemmas 4, 9 and 10, we deduce that
Δ t n = 1 m τ 2 ( t n ) μ h n 0 2 κ Δ t 2 , 0 m N ,
which yields (63).  □
Theorem 5.
Under the assumptions of Lemma 7, the error ( u ( t n ) u h n , p ( t n ) p h n ) satisfies the following optimal bounds:
Δ t n = 1 N A ˜ h 1 2 ( u ( t n ) u h n ) 0 2 + τ ( t m ) A ˜ h 1 2 ( u ( t m ) u h m ) 0 2 κ ( h 2 + Δ t ) , Δ t n = 1 N τ ( t n ) p ( t n ) p h n 0 2 + τ 2 ( t m ) p ( t m ) p h m 0 2 κ ( h 2 + Δ t ) ,
for all t m ( 0 , T ] .
Proof. 
Integration by parts directly can show
Δ t A ˜ h 1 2 ( u ( t n ) u h ( t n ) ) 0 2 2 t n 1 t n A ˜ h 1 2 ( u u h ) 0 2 d t + t n 1 t n ( t t n 1 ) 2 A ˜ h 1 2 ( u t u h t ) 0 2 d t .
Summing (67) from n = 1 to n = N , using (19) and noting t t n 1 τ ( t ) , we obtain
Δ t n = 1 N A ˜ h 1 2 ( u ( t n ) u h ( t n ) ) 0 2 2 0 T A ˜ h 1 2 ( u u h ) 0 2 d t + κ h 2 ,
Combining (68) with (14), Theorem 3, Lemmas 7 and 9 yields the first estimate in (66).
Δ t n = 1 N A ˜ h 1 2 ( u ( t n ) u h n ) 0 2 + τ ( t m ) A ˜ h 1 2 ( u ( t m ) u h m ) 0 2 κ ( h 2 + Δ t ) ,
Moreover, by (5), (9), (11), (14) and (20), we deduce that
0 t p h 0 2 d s c 0 t u h t 0 2 + A ˜ h 1 2 u h 0 4 + f 0 2 d s κ , 0 t T .
Hence, we obtain from Theorems 1 and 3 that
τ ( t 1 ) p ( t 1 ) p ¯ h ( t 1 ) 0 Δ t 1 / 2 τ 1 / 2 ( t 1 ) p ( t 1 ) 0 + 0 t 1 p h 0 2 d s 1 / 2 κ Δ t 1 / 2 ,
τ ( t n ) p ( t n ) p ¯ h ( t n ) 0 τ ( t n ) p ( t n ) p ¯ ( t n ) 0 + τ ( t n ) p ¯ ( t n ) p ¯ h ( t n ) 0 2 Δ t t n 1 t n ( t t n 1 ) τ ( t ) p t 0 d t + 2 Δ t t n 1 t n τ ( t ) p p h 0 d t c Δ t 1 / 2 t n 1 t n τ 2 ( t ) p t 0 2 d t 1 / 2 + κ h κ h + Δ t 1 / 2 .
Combining (63) with (65)–(72) yields
τ 2 ( t m ) p ( t m ) p h m 0 2 κ h 2 + Δ t ,
for all t m ( 0 , T ] .
Besides, noting that
Δ t n = 2 N τ ( t n ) p ( t n ) p ¯ h ( t n ) 0 2 n = 2 N 2 τ ( t n ) Δ t ( t n 1 t n ( p ( t n ) p ( t ) ) d t 0 2 + t n 1 t n ( p p h ) d t 0 2 ) 4 Δ t t 1 T τ 2 ( t ) p t 0 2 d t + 4 t 1 T τ ( t ) p p h 0 2 d t .
Recalling (Lemma 4.3) in [12], we have
( u t u h t , I h * v ) + B ˜ h ( ( e h , μ h ) ; ( I h * v , q ) ) + b ˜ ( u , u u h , I h * v ) + b ˜ ( u u h , u , I h * v ) b ˜ ( u u h , u u h , I h * v ) = 0 ( v , q ) ( X h , M h ) ,
where e h = R ˜ h ( u , p ) u h , μ h = Q ˜ h ( u , p ) p h . Using (9), (11), (14) and (75), we obtain
0 T τ ( t ) μ h 0 2 d t c 0 T τ ( t ) u t u h t 0 2 + A ˜ h 1 2 ( u u h ) 0 2 ( u 2 + A ˜ h 1 2 u h 0 2 ) d t .
It follows from (5), (7), (18)–(20), and the above estimate that
0 T τ ( t ) p p h 0 2 d t 2 0 T τ ( t ) ( p Q ˜ h ( u , p ) 0 2 + μ h 0 2 ) d t c h 2 0 T ( A u 0 2 + p 1 2 ) d t + κ h 2 κ h 2 .
Substituting (76) into (74) and using (73) and Theorem 1, we get
Δ t n = 1 N τ ( t n ) p ( t n ) p ¯ h ( t n ) 0 2 κ ( h 2 + Δ t ) .
Combining (77) with (65), we have
Δ t n = 1 N τ ( t n ) p ( t n ) p h n 0 2 κ ( h 2 + Δ t ) .
This and (69) yield (66).  □

6. Single Numerical Example

In this section, some numerical results are computed to test the rationality of the theoretical analysis. Because it is difficult to obtain the analytical solution of the general problem governed by the Navier-Stokes equation, we show the relevant numerical results through an example with analytical solution for simplicity. So we consider the following model problem in the unit square area [ 0 , 1 ] × [ 0 , 1 ] . Here this example might as well takes ν as 0.01. Only the velocities and pressure are given here. The right term f of the equations can be obtained by bringing the relationship between p ( x ) and u ( x , y ) = ( u 1 ( x , y ) , u 2 ( x , y ) ) into the NS equations, and the initial values of u 1 ( x , y ) , u 2 ( x , y ) and p ( x , y ) can be obtained by bringing t = 0 into the calculation.
Now, consider a unit square domain with an exact solution given by
u ( x , y ) = ( u 1 ( x , y ) , u 2 ( x , y ) ) , u 1 ( x , y ) = e 8 π 2 ν 10 x 2 ( x 1 ) 2 y ( y 1 ) ( 2 y 1 ) , u 2 ( x , y ) = e 8 π 2 ν 10 x ( x 1 ) ( 2 x 1 ) y 2 ( y 1 ) 2 , p ( x , y ) = e 16 π 2 ν 10 ( 2 x 1 ) ( 2 y 1 ) .
f is determined by (3). It can be verified that such u 1 ( x , y ) , u 2 ( x , y ) satisfy the non divergence condition.
For simplicity, we can record the time and spatial discretization of the problem as follows:
A u n + 1 + N u n u n + 1 + B p n + 1 = f n + 1 , B u n + 1 + β C = 0 .
where the matrices in (80) correspond to the differential operators: A diag ( v Δ + 1 / Δ t ) , N u n u n · , B , C J h div , C C h ( · , · ) , and I is the identity matrix. The right-hand side f n + 1 contains the source term.
To make the next iterations less complex, here are a few new notations. Let W = u n + 1 , q = p n + 1 , then we can further record the above equation as follows:
v A + N ( w ) w + B q = f B T w + β C = 0 .
Besides, in order to improve the calculation efficiency, we can generally adopt Newton iterative method to solve the above nonlinear problems. The typical calculation steps are as follows:
( 1 ) R = f v A v old + N v old v old B q old , r = B T v old ; ( 2 ) v A v mid + N v old v mid + N v mid v old + B q mid = R , B T v mid = r ; ( 3 ) v new = v old + v mid , q new = q old + q mid .
It is worth noting that since Newton iterative method requires high initial values, we need to use the following Picard method to obtain the initial values of Newton iterative method:
( 1 ) R = f v A v old + N v old v old B q old , r = B T v old ; ( 2 ) v A v mid + N v old v mid + B q mid = R , B T v mid = r ; ( 3 ) v new = v old + v mid , q new = q old + q mid .
In this way, we can finally transform the time-dependent Navier Stokes problem into a large-scale linear system of equations and solve it through such links: Euler time discretization → finite volume space discretization → Newton iterative transformation → Picard format transformation → large linear equations → solving equations.
Based on the above description, we can get some simulation results ( β = 6 ). The following Figure 3 is the result of one iteration based on the initial value. The time step here is Δ t = 0.001 , and the spatial grid is divided into two congruent triangles on the basis of 100 × 100 equidistant rectangular grid. We only pay attention to that only 1 / 5 of the data in both X and Y directions are selected.
The following Figure 4 is the result after 1000 iterations with time step Δ t = 0.001 . Here, the reference value of streamline is the same as that when t = 0.001 .
Compared Figure 2 with Figure 3, it can be seen from Figure 3 that the streamline and flow field are weakened accordingly. It is easy to understand that since the interpretation constructed here is decaying, both velocity and pressure show a decaying trend. This also shows that our numerical method maintains strong robustness, and the calculation results are more intuitive.
The following table shows the L 2 error order of velocity and pressure after 1000 iterations with 20 × 20 , 40 × 40 , 80 × 80 grids selected under the condition of Δ t = 0.001 .
From the above Table 1, we can see the optimal L 2 convergence rate, almost 2 for velocities and 1 for pressure are really obtained, which confirm the numerical analysis above.
The following Figure 5 shows the error curve calculated based on 100 × 100 spatial grid with different time steps: Δ t = 0.01 , 0.005 , 0.0025 , 0.00125 (`dt’ in Figure 5 is Δ t ). It can be seen from here that the initial error tends to increase, but the error also decreases with the decrease of flow field energy, which shows that the time iteration is stable.
The following Table 2 shows the error ratio of different time steps: d t = 0.01, 0.005, 0.0025, 0.00125:
The error ratio curve in the Figure 6 below shows the convergence of one section of time and is relatively stable.
Table 2 and Figure 6 tell us the optimal convergence rate of time is 1 which is consistent with the theoretical analysis.
Due to time constraints, our numerical results only show these. It is also worth noting that if the solution does not decay but increases, and if the growth rate is fast, the error of numerical results will increase with the increase of numerical calculation time. At that time, the method may not converge or inefficient. This requires a little attention in specific applications.

7. Conclusions

After detailed theoretical analysis, this article finally proves that if we use the finite volume method based on P 1 P 0 element to approximate the non-stationary Navier-Stokes equation, we can achieve the follow optimal numerical error estimation:
Δ t n = 1 N A ˜ h 1 2 ( u ( t n ) u h n ) 0 2 + τ ( t m ) A ˜ h 1 2 ( u ( t m ) u h m ) 0 2 κ ( h 2 + Δ t ) , Δ t n = 1 N τ ( t n ) p ( t n ) p h n 0 2 + τ 2 ( t m ) p ( t m ) p h m 0 2 κ ( h 2 + Δ t ) .
The optimal error estimate (83) shows that the time discretization of Euler method is 1 order and the space discretization is 2 order in this space-time full discretization finite volume method, which is consistent with the theoretical optimal order error estimation of P 1 P 0 element in solving differential equations. Although the proof process is challenging and cumbersome, the optimal result is also obvious and certain. However, this work is still helpful to reveal some special aspects of the finite volume method which is different from finite element and other methods in solving complex differential equations. Therefore, it is helpful to improve the corresponding numerical analysis theory.
In addition, with the continuous research and exploration of using neural network to solve differential equations recently [25,26,27], although very gratifying numerical results have been obtained, but the effectiveness and convergence of neural network-based methods for solving differential equations are still unclear, and there is a lack of theory. However, we know gradually that the key point of neural network in the calculation of differential equations is to use low-order functions for numerical approximation, which is similar to the basic principle of using low-order continuous functions to discretize and approximate differential equations, except that the former is global approximation while the latter is piecewise approximation. Therefore, improving and enriching the low-order function approximation theory also provides some important reference in further understanding the neural network in solving differential equations efficiently, It is worth studying.

Author Contributions

Individual contributions: theoretical analysis, G.H.; formal analysis, G.H. and Y.Z.; writing—original draft preparation, G.H. and Y.Z.; writing—review and editing, G.H.; visualization, Y.Z.; project administration, G.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Science Foundation of China, grant number: 10926133, 60973015.

Acknowledgments

The author is very grateful for the inspiration of relevant literature and the valuable opinions put forward by reviewers. Thank the research team of computing science and engineering for their enlightening suggestions in the process of study.

Conflicts of Interest

The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

References

  1. Carstensen, C.; Dond, A.K.; Nataraj, N.; Pani, A.K. Three First-Order Finite Volume Element Methods for Stokes Equations under Minimal Regularity Assumptions. SIAM J. Numer. Anal. 2018, 56, 2648–2671. [Google Scholar] [CrossRef]
  2. Feireisl, E.; Lukáčová-Medviďová, M.; Mizerová, H.; She, B. On the Convergence of a Finite Volume Method for the Navier-Stokes-Fourier System. IMA J. Numer. Anal. 2021, 41, 2388–2422. [Google Scholar] [CrossRef]
  3. 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] [Green Version]
  4. 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]
  5. Kechkar, N.; Silvester, D. Analysis of Locally Stabilized Mixed Finite Element Methods for the Stokes Problem. Math. Comput. 1992, 58, 1–10. [Google Scholar] [CrossRef]
  6. Kay, D.; Silvester, D. A Posteriori Error Estimation for Stabilized Mixed Approximations of the Stokes Equations. Siam J. Sci. Comput. 2000, 21, 1321–1337. [Google Scholar] [CrossRef]
  7. Norburn, S.; Silvester, D. Stabilised vs. Stable Mixed Methods for Incompressible Flow. Comput. Methods Appl. Mech. Eng. 1998, 166, 1–10. [Google Scholar] [CrossRef]
  8. He, Y.; Lin, Y.; Sun, W. Stabilized Finite Element Method for the Non-stationary Navier-Stokes Problem. Discret. Contin. Dyn. Syst.-Ser. S 2006, 6, 41–68. [Google Scholar] [CrossRef]
  9. He, Y. A Full Discrrete Stabilized Finite-Element Method for the Time-Dependent Navier-Stokes Equations. IMA J. Numer. Anal. 2003, 23, 665–691. [Google Scholar] [CrossRef]
  10. Wen, J.; He, Y.; Zhao, X. Analysis of a New Stabilized Finite Volume Element Method Based on Multiscale Enrichment for the Navier-Stokes Problem. Int. J. Numer. Methods Heat Fluid Flow 2016, 26, 2462–2485. [Google Scholar] [CrossRef]
  11. Li, J.; Lin, X.; Zhao, X. Optimal Estimates on Stabilized Finite Volume Methods for the Incompressible Navier-Stokes Model in Three Dimensions. Numer. Methods Part. Differ. Equ. 2018, 35, 28–154. [Google Scholar] [CrossRef] [Green Version]
  12. He, G.; He, Y. The Finite Volume Method Based on Stabilized Finite Element for the Stationary Navier-Stokes Problem. Numer. Methods Part. Differ. Equ. 2007, 23, 1167–1191. [Google Scholar] [CrossRef]
  13. Li, J.; Chen, Z. On the Semi-Discrete Stabilized Finite Volume Method for the Transient Navier-Stokes Equations. Adv. Comput. Math. 2013, 38, 281–320. [Google Scholar] [CrossRef]
  14. Girault, V.; Raviart, P.A. Finite Element Method for Navier-Stokes Equations: Theory and Algorithms; Springer: Berlin/Heidelberg, Germany, 1987; pp. 5–47. [Google Scholar]
  15. Boland, J.; Nicolaides, R.A. Stability of Finite Elements under Divergence Constraints. SIAM J. Numer. Anal. 1983, 20, 722–731. [Google Scholar] [CrossRef]
  16. Bercovier, J.; Pironneau, O. Error Estimates for Finite Element Solution of the Stokes Problem in the Primitive Variables. Numer. Math. 1979, 33, 211–226. [Google Scholar] [CrossRef]
  17. Heywood, J.G.; Rannacher, R. Finite Element Approximation of the Nonstationary Navier-Stokes Problem I: Regularity of Solutions and Second-Order Error Estimates for Spatial Discretization. SIAM J. Numer. Anal. 1982, 19, 275–311. [Google Scholar] [CrossRef]
  18. Stenberg, R. Analysis of Mixed Finite Elements for the Stokes Problem: A Unified Approach. Math. Comput. 1984, 42, 9–23. [Google Scholar]
  19. Bramble, J.H.; Xu, J. Some Estimates for a Weighted L2 Projection. Math. Comput. 1991, 56, 463–576. [Google Scholar]
  20. Li, R. Generalized difference methods for a nonlinear dirichlet problem. SIAM J. Numer. Anal. 1987, 24, 77–88. [Google Scholar]
  21. Ewing, R.E.; Lin, T.; Lin, Y. On the Accuracy of The Finite Volume Element Method Based on Picewise Linear Polynomails. SIAM J. Numer. Anal. 2002, 39, 1865–1888. [Google Scholar] [CrossRef]
  22. Hill, A.T.; Suli, E. Approximation of the Global Attractor for the Incompressible Navier-Stokes Problem. IMA J. Numer. Anal. 2000, 20, 633–667. [Google Scholar] [CrossRef]
  23. Discacciati, M.; Oyarzúa, R. A Conforming Mixed Finite Element Method for the Navier-Stokes/Darcy Coupled Problem. Numer. Math. 2017, 135, 1–36. [Google Scholar] [CrossRef] [Green Version]
  24. Shen, J. Long Time Stability and Convergence for Fully Discrete Nonlinear Galerkin Methods. Appl. Anal. 1990, 38, 201–229. [Google Scholar] [CrossRef]
  25. Baymani, M.; Effati, S.; Niazmand, H.; Kerayechian, A. Artificial Neural Network Method for Solving the Navier-Stokes Equations. Neural Comput. Appl. 2015, 26, 765–773. [Google Scholar] [CrossRef]
  26. Jin, X.; Cai, S.; Li, H.; Karniadakis, G.E. NSFnets (Navier-Stokes Flow nets): Physics-Informed Neural Networks for the Incompressible Navier-Stokes Equations. J. Comput. Phys. 2021, 426, 109951. [Google Scholar] [CrossRef]
  27. Christopher, J.; King, A.P. Active Training of Physics-Informed Neural Networks to Aggregate and Interpolate Parametric Solutions to the Navier-Stokes Equations. J. Comput. Phys. 2021, 438, 1–17. [Google Scholar]
Figure 1. The finite volume partition of geometric region.
Figure 1. The finite volume partition of geometric region.
Entropy 24 00768 g001
Figure 2. The area of partition of triangular.
Figure 2. The area of partition of triangular.
Entropy 24 00768 g002
Figure 3. Preliminary calculated velocity and pressure.
Figure 3. Preliminary calculated velocity and pressure.
Entropy 24 00768 g003
Figure 4. The calculated velocity and pressure at T = 1 .
Figure 4. The calculated velocity and pressure at T = 1 .
Entropy 24 00768 g004
Figure 5. Velocity error of different time steps.
Figure 5. Velocity error of different time steps.
Entropy 24 00768 g005
Figure 6. 1 order convergence ratio in time direction.
Figure 6. 1 order convergence ratio in time direction.
Entropy 24 00768 g006
Table 1. Convergence order of spatial solution the FVM ( ν = 0.01 , β = 6 ).
Table 1. Convergence order of spatial solution the FVM ( ν = 0.01 , β = 6 ).
h A ˜ h 1 2 ( u u h ) 0 A ˜ h 1 2 u 0 u u h 0 u 0 p p h 0 p 0
1/200.06991110.00357120.0771281
1/400.03942810.00095110.0440669
1 / 20 1 / 40 1.7733.7541.750
1/800.02095340.00026380.0241342
1 / 40 1 / 80 1.7183.6051.673
Table 2. Numerical results of the FVM ( ν = 0.005 , β = 10 ).
Table 2. Numerical results of the FVM ( ν = 0.005 , β = 10 ).
t12345678
Δ t = 0.01 Δ t = 0.005 1.95131.95131.94561.94241.94041.93901.93801.9373
Δ t = 0.05 Δ t = 0.0025 1.92531.92531.92251.92101.92001.91931.91881.9184
Δ t = 0.0025 Δ t = 0.00125 1.91261.91261.91121.91041.90991.90961.90931.9092
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

He, G.; Zhang, Y. The Optimal Error Estimate of the Fully Discrete Locally Stabilized Finite Volume Method for the Non-Stationary Navier-Stokes Problem. Entropy 2022, 24, 768. https://doi.org/10.3390/e24060768

AMA Style

He G, Zhang Y. The Optimal Error Estimate of the Fully Discrete Locally Stabilized Finite Volume Method for the Non-Stationary Navier-Stokes Problem. Entropy. 2022; 24(6):768. https://doi.org/10.3390/e24060768

Chicago/Turabian Style

He, Guoliang, and Yong Zhang. 2022. "The Optimal Error Estimate of the Fully Discrete Locally Stabilized Finite Volume Method for the Non-Stationary Navier-Stokes Problem" Entropy 24, no. 6: 768. https://doi.org/10.3390/e24060768

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