Next Article in Journal
Multiple Reflections for Classical Particles Moving under the Influence of a Time-Dependent Potential Well
Next Article in Special Issue
A Finite Element Approximation for Nematic Liquid Crystal Flow with Stretching Effect Based on Nonincremental Pressure-Correction Method
Previous Article in Journal
An Efficient Supervised Deep Hashing Method for Image Retrieval
Previous Article in Special Issue
AP Shadow Net: A Remote Sensing Shadow Removal Network Based on Atmospheric Transport and Poisson’s Equation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Two-Level Finite Element Iterative Algorithm Based on Stabilized Method for the Stationary Incompressible Magnetohydrodynamics

Hunan Key Laboratory for Computation and Simulation in Science and Engineering, Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education, School of Mathematics and Computational Science, Xiangtan University, Xiangtan 411105, China
*
Author to whom correspondence should be addressed.
Entropy 2022, 24(10), 1426; https://doi.org/10.3390/e24101426
Submission received: 12 August 2022 / Revised: 26 September 2022 / Accepted: 29 September 2022 / Published: 7 October 2022

Abstract

:
In this paper, based on the stabilization technique, the Oseen iterative method and the two-level finite element algorithm are combined to numerically solve the stationary incompressible magnetohydrodynamic (MHD) equations. For the low regularity of the magnetic field, when dealing with the magnetic field sub-problem, the Lagrange multiplier technique is used. The stabilized method is applied to approximate the flow field sub-problem to circumvent the inf-sup condition restrictions. One- and two-level stabilized finite element algorithms are presented, and their stability and convergence analysis is given. The two-level method uses the Oseen iteration to solve the nonlinear MHD equations on a coarse grid of size H, and then employs the linearized correction on a fine grid with grid size h. The error analysis shows that when the grid sizes satisfy h = O ( H 2 ) , the two-level stabilization method has the same convergence order as the one-level one. However, the former saves more computational cost than the latter one. Finally, through some numerical experiments, it has been verified that our proposed method is effective. The two-level stabilized method takes less than half the time of the one-level one when using the second class Nédélec element to approximate magnetic field, and even takes almost a third of the computing time of the one-level one when adopting the first class Nédélec element.

1. Introduction

Consider the following stationary incompressible MHD
R e 1 Δ u + ( u · ) u + p S c curl b × b = f , in Ω , R m 1 S c curl ( curl b ) S c curl ( u × b ) r = g , in Ω , div u = 0 , div b = 0 , in Ω , u = 0 , b · n = 0 , n × curl b = 0 , r = 0 , on Ω ,
where Ω R d ( d = 2 , 3 ) is a bounded Lipschitz domain. R e and R m are the hydrodynamic and magnetic Reynolds numbers, respectively. S c is the coupling number, and f and g are source terms with · g = 0 . n is the unit outward normal vector on Ω .
Incompressible MHD describes the dynamics of a viscous, incompressible, electrically conducting fluid under an external magnetic field. The MHD (1) is a coupled multi-physical system of the classical Navier–Stokes equations and Maxwell’s equations. MHD modelling has a number of applications in physics and engineering technology, such as radio wave propagation in ionosphere in geophysics, MHD engine, control of MHD boundary layer and liquid-metal MHD electricity generation (see [1]). Since MHD equations are strongly nonlinear and have many physical quantities, it is needed to find effective numerical methods to solve them.
For the MHD modelling (1) without the Lagrange multiplier r term, the early study of the exact penalty regularization finite element method on a convex domain is carried out in [2]. Based on this format, the nonconforming mixed finite element methods [3], the Stokes, Newton and Oseen finite element iterative methods [4,5], the penalty based finite element iterative methods [6], and the generalized Arrow–Hurwicz iterative methods [7] are investigated. In view of multi-physical coupling and nonlinearity of system (1), two-level method and finite element iterative algorithms are combined by [8,9,10,11,12] to reduce the computing cost, and local and parallel finite element algorithms based on some iterations are proposed in [13,14,15,16]. On the other hand, a number of effective solvers based on the finite element methods are presented in [17,18,19]. To keep the physical property of the Gauss law of the magnetic field, the constrained transport divergence-free finite element method is designed in [20]. The coupled Stokes, Newton and Oseen-type iteration methods are studied and discussed for the (1) in [21] on a general Lipschitz domain. For the nonsmooth computational domain, the magnetic field belongs to a lower regularity space than H 1 ( Ω ) , and the discrete finite element scheme with the Lagrange multiplier of (1) becomes a double-saddle points problem.
For the mixed finite element method, the component approximations must preserve the compatibility and satisfy the so-called inf-sup condition. It is well known that the lowest equal-order finite element pairs in engineering preferred do not satisfy the inf-sup condition. Numerical experiments show that the break of the inf-sup condition often leads to unphysical pressure oscillations. To avoid the instability problem and use the lowest equal-order elements, the popular stabilized methods based on local Gauss integrations are proposed and studied, for example, for the Stokes problem [22,23], the coupled Stokes–Darcy problem [24], the Stokes eigenvalue system [25], the Navier–Stokes equations [26,27,28,29] and the natural convection problem [30]. However, the stabilized finite element algorithm for MHD with respect to the Lagrange multiplier has not been reported.
In this paper, a two-level finite element iterative algorithm based on the stabilized method is proposed to numerically solve the stationary incompressible MHD equations. Compared to the existing literature, the stabilized scheme with the Lagrange multiplier proposed here have two main benefits. One is that the lowest equal-order finite element pairs can be used to approximate hydrodynamic subproblem, and the other is that our scheme preserve the physical property of Gauss law weakly for magnetic subproblem by adding the Lagrange multiplier. In the next section, the stabilized finite element discretization based on local Gauss integrations is designed and analyzed. To deal with the nonlinear term, the stabilized finite element method based on Oseen iteration is studied. The two-level stabilized finite element algorithm and its convergence are given in Section 3. In the last section, some numerical experiments are tested to support the theoretical analysis of our proposed method.

2. Stabilized Finite Element Discretization Based on Local Gauss Integrations

We will introduce some Sobolev spaces, and the norms of the product spaces:
H 1 ( Ω ) = H 1 ( Ω ) d , X : = H 0 1 ( Ω ) = { u H 1 ( Ω ) : u | Ω = 0 } , H ( div ; Ω ) = { u L 2 ( Ω ) d : div u L 2 ( Ω ) } , W : = H 0 ( curl ; Ω ) = { b H ( curl ; Ω ) : b × n | Ω = 0 } , Q : = L 0 2 ( Ω ) = { q L 2 ( Ω ) : Ω q d x = 0 } , S : = H 0 1 ( Ω ) , | | ( u , b ) | | 1 = | | u | | 0 2 + S c | | curl b | | 0 2 1 2 , | | ( p , r ) | | = | | p | | 0 2 + | | r | | 0 2 1 2 , | | ( u , b ) | | 0 = | | u | | 0 2 + S c | | b | | 0 2 1 2 , | | f | | 1 = sup v H 0 1 ( Ω ) f , v | | v | | 0 , | | F | | * = | | f | | 1 2 + S c 1 | | g | | 0 2 1 2 , | | F | | 0 = | | f | | 0 2 + S c 1 | | g | | 0 2 1 2 .
For all w , u , v X , b , c , d W , q Q , s S , let
a s ( u , v ) = R e 1 ( u , v ) , a m ( b , c ) = R m 1 S c ( curl b , curl c ) , c 0 ( w , u , v ) = ( w · u , v ) = 1 2 ( w · u , v ) 1 2 ( w · v , u ) , c 1 ( d , v , b ) = S c ( curl b × d , v ) , b s ( q , v ) = ( q , · v ) , b m ( s , c ) = ( s , c ) , A ( u , b ; v , c ) = a s ( u , v ) + a m ( b , c ) , C ( w , d ; u , b ; v , c ) = c 0 ( w , u , v ) c 1 ( d , v , b ) + c 1 ( d , u , c ) , B ( q , s ; v , c ) = b s ( q , v ) + b m ( s , c ) , F , ( v , c ) = f , v + ( g , c ) .
By the Lagrange multiplier technique, the variational form of system (1) is [31]: Find ( u , b , p , r ) X × W × Q × S , for all ( v , c , q , s ) X × W × Q × S such that
a s ( u , v ) b s ( p , v ) + b s ( q , u ) + c 0 ( u , u , v ) c 1 ( b , v , b ) = f , v ,
a m ( b , c ) b m ( r , c ) + b m ( s , b ) + c 1 ( b , u , c ) = ( g , c ) .
The compact form of (2) and (3) is read as
A ( u , b ; v , c ) + C ( u , b ; u , b ; v , c ) B ( p , r ; v , c ) + B ( q , s ; u , b ) = F , ( v , c ) .
The properties of the bilinear and trilinear forms from [32,33,34] are useful for our analysis. For all u , v X , b , c W , q Q , r S , there have
| A ( u , b ; v , c ) | v ¯ | | ( u , b ) | | 1 | | ( v , c ) | | 1 , v ¯ = max { R e 1 , R m 1 } ,
A ( u , b ; u , b ) v ̲ | | ( u , b ) | | 1 2 , v ̲ = min { R e 1 , R m 1 λ 0 } ,
B ( q , s ; v , c ) d | | ( q , s ) | | | | ( v , c ) | | 1 ,
C ( w , d ; u , b ; u , b ) = 0 ,
| C ( w , d ; u , b ; v , c ) | N ^ | | ( w , d ) | | 1 | | ( u , b ) | | 1 | | ( v , c ) | | 1 ,
where N ^ and λ 0 are positive constants that depend only on Ω . In the next content, we use C to represent a general positive constant independent of mesh sizes H and h.
H and h ( h H ) are now two real positive parameters that tend to 0. T H is a uniformly regular partition of Ω into triangular ( d = 2 ) or tetrahedral ( d = 3 ) element K with diameters bounded by H, and T h is the fine mesh generated by a mesh refinement process to T H . Let T μ ( μ = H , h ) is a partition. P k ( K ) is the space of polynomials of degree k (positive integers) over K. P 1 element is utilized to approximate the velocity field, pressure and Lagrange multiplier, and two kinds of lowest order Nédélec elements are applied to approximate the magnetic field. The subspaces of X , W , Q , S are
X μ : = { u μ H 0 1 ( Ω ) : u μ | K P 1 ( K ) d , K T μ } , W μ : = { b μ H 0 ( curl ; Ω ) : b μ | K N 1 ( l ) ( K ) , K T μ } , l = 1 , 2 , Q μ : = { q μ L 0 2 ( Ω ) : q μ | K P 1 ( K ) , K T μ } , S μ : = { r μ H 0 1 ( Ω ) : r μ | K P 1 ( K ) , K T μ } , V μ : = { u μ X μ : b s ( q μ , u μ ) = 0 , q μ Q μ } , C μ : = { b μ W μ : b m ( s μ , b μ ) = 0 , s μ S μ } .
Here, Nédélec elements of the first family and the second one are as follows [35]
N k ( 1 ) ( K ) = [ P k 1 ( K ) ] d D k ( K ) , D k ( K ) = p [ P ˜ k ( K ) ] d p ( x ) · x = 0 , in K , N k ( 2 ) ( K ) = [ P k ( K ) ] d ,
where [ P ˜ k ( K ) ] d is the homogeneous polynomials of degree k.
W μ and S μ satisfy the discrete inf-sup condition [31]
sup c μ W μ b m ( s μ , c μ ) curl c μ 0 β ^ s μ 0 , s μ S μ ,
where the constant β ^ > 0 is independent of μ .
Denote P μ and R 0 μ by the L 2 -orthogonal projectors
P μ : L 2 ( Ω ) V μ , R 0 μ : L 2 ( Ω ) C μ .
Define the discrete Stokes operator by A 1 μ = P μ Δ μ , in which Δ μ is defined by (see [32,33])
( Δ μ u μ , v ) = ( u μ , v ) , u μ , v X μ ,
and the discrete norm u μ k , μ = A 1 μ k 2 u μ 0 of the k R order, where
u μ 1 , μ = u μ 0 , u μ 2 , μ = A 1 μ u μ 0 , u μ X μ .
Meanwhile, A 2 μ b μ = R 0 μ ( μ × × b μ + b μ ) is defined as [33]:
( μ × × b μ , c ) = ( × b μ , × c ) , c W μ .
It is necessary to introduce some discrete estimates [33,34]
v μ L 3 + v μ L v μ 0 1 2 A 1 μ v μ 0 1 2 , v μ L 6 C A 1 μ v μ 0 , v μ X μ .
The trilinear form C ( · , · , · ) has the properties [34]: for all w μ , u μ , v μ X μ , d μ , b μ , c μ W μ ,
| C ( w μ , d μ ; u μ , b μ ; v μ , c μ ) | + | C ( u μ , b μ ; w μ , d μ ; v μ , c μ ) | N ^ ( A 1 μ w μ , A 2 μ d μ ) 0 ( u μ , b μ ) 0 ( v μ , c μ ) 1 .
It is apparent that the discrete inf-sup condition is not valid to the subspace X μ and Q μ . To meet the needs of this property, as in [22,26], a mixed stability term with the universal bilinear form is added:
D μ ( u μ , p μ ; v μ , q μ ) = a s ( u μ , v μ ) b s ( p μ , v μ ) + b s ( q μ , u μ ) + G ( p μ , q μ ) ,
where
G ( p μ , q μ ) = K T μ K , k p μ q μ d ξ K , 1 p μ q μ d ξ , k 2 ,
for all p μ , q μ Q μ , K , i p μ q μ d ξ means that makes use of an i-order ( i = 1 , 2 ) local Gauss integral to calculate it over the element K.
Let Π μ : L 2 ( Ω ) P 0 be a L 2 -projection with the properties as follows [22,36]:
( p , q μ ) = ( Π μ p , q μ ) , p L 2 ( Ω ) , q μ Q μ , Π μ p 0 C p 0 , p L 2 ( Ω ) , p Π μ p 0 C μ min { 1 , γ } p γ , p H 1 ( Ω ) H γ ( Ω ) .
As a consequence, the local Gauss integral can be restated as:
G ( p μ , q ) = ( p μ Π μ p μ , q Π μ q ) , p μ , q Q μ .
D μ ( · , · ; · , · ) satisfies the following important properties (see [22,26]): For all ( u μ , p μ ) , ( v μ , q μ ) X μ × Q μ ,
sup ( v , q ) ( X μ , Q μ ) | D μ ( u μ , p μ ; v , q ) | v 0 + q 0 β ^ ( R e 1 u μ 0 + p μ 0 ) .
The stabilized discrete scheme reads: Find ( u μ , b μ , p μ , r μ ) X μ × W μ × Q μ × S μ , for all ( v , c , q , s ) X μ × W μ × Q μ × S μ , such that
a s ( u μ , v ) + c 0 ( u μ , u μ , v ) c 1 ( b μ , v , b μ ) b s ( p μ , v ) + b s ( q , u μ ) + G ( p μ , q ) + σ μ R e 1 a s ( u μ , v ) = f , v , a m ( b μ , c ) + c 1 ( b μ , u μ , c ) b m ( r μ , c ) + b m ( s , b μ ) = ( g , c ) ,
where σ > 0 is an artificial viscosity parameter, (17) can be rewritten as:
A ( u μ , b μ , v , c ) + C ( u μ , b μ ; u μ , b μ ; v , c ) + σ μ R e 1 a s ( u μ , v ) + G ( p μ , q ) B ( p μ , r μ ; v , c ) + B ( q , s ; u μ , b μ ) = F , ( v , c ) .
Let
A μ ( u μ , b μ ; v , c ) = A ( u μ , b μ ; v , c ) + σ μ R e 1 a s ( u μ , v ) .
Then the bilinear form A μ satisfies the following coercive and continuous properties:
| A μ ( u μ , b μ ; v , c ) | C m a x ( u μ , b μ ) 1 ( v , c ) 1 ,
A μ ( u μ , b μ ; u μ , b μ ) C m i n ( u μ , b μ ) 1 2 ,
where
C m a x = { R e 1 + σ μ , R m 1 } , C m i n = { R e 1 + σ μ , R m 1 λ 0 } .
Rewrite (18) as
A μ ( u μ , b μ , v , c ) + C ( u μ , b μ ; u μ , b μ ; v , c ) + G ( p μ , q ) B ( p μ , r μ ; v , c ) + B ( q , s ; u μ , b μ ) = F , ( v , c ) .
In order to derive error estimates, we introduce two projections. The Stokes projection is defined as follows [26,36] : Find R ( u , p ) X μ , Q ( u , p ) Q μ such that
a s ( u R ( u , p ) , v ) b s ( p Q ( u , p ) , v ) + b s ( q , u R ( u , p ) ) = 0 ,
for all ( v , q ) X μ × Q μ . If u H 1 + γ ( Ω ) , p H γ ( Ω ) , γ > 1 2 , there holds [26,36]
u R ( u , p ) 0 + μ ( ( u R ( u , p ) ) 0 + p Q ( u , p ) 0 ) C μ min { 2 , γ + 1 } ( u 1 + γ + p γ ) .
The Maxwell’s projection is defined by [37]: Assume that b H τ ( Ω ) , curl b H τ ( Ω ) , τ > 1 2 , find Λ b W μ , Λ r S μ such that
a m ( b Λ b , c ) b m ( r Λ r , c ) + b m ( s , b Λ b ) = 0 , b W , r S .
By the property of Λ , it can be shown that
curl b curl Λ b 0 + b Λ b 0 + ( r Λ r ) 0 C μ min { 1 , τ } b τ + curl b τ + r τ + 1 .
Now, we will give the stability and error estimate for the problem (21).
Lemma 1.
Suppose the condition σ 1 : = N ^ F * ( C m i n ) 2 < 1 holds, the solution of the problem (21) satisfies
C m i n ( u μ , b μ ) 1 F * ,
C m i n ( 1 σ 1 ) ( A 1 μ u μ , A 2 μ b μ ) 0 F 0 .
Proof. 
For (21), taking ( v , b , q , s ) = ( u μ , b μ , p μ , r μ ) X μ × W μ × Q μ × S μ , then by (8), we have
A μ ( u μ , b μ , u μ , b μ ) + G ( p μ , p μ ) = F , ( u μ , b μ ) .
Using (20) and (15), we can easily receive (26).
Replacing ( v , c ) = ( A 1 μ u μ , A 2 μ b μ ) , q = 0 , s = 0 in (21), and applying (12) to have
C m i n ( A 1 μ u μ , A 2 μ b μ ) 0 F 0 + N ^ ( A 1 μ u μ , A 2 μ b μ ) 0 ( u μ , b μ ) 1 F 0 + N ^ ( A 1 μ u μ , A 2 μ b μ ) 0 F * C m i n .
Furthermore, we arrive at (27).    □
Theorem 1.
Let ( u , b , p , r ) be the solution of the problem (4) satisfying u H 1 + γ ( Ω ) , p H γ ( Ω ) , b H τ ( Ω ) , curl b H τ ( Ω ) , r H 1 + τ ( Ω ) , γ , τ > 1 2 . Then, the error estimate u u μ , b b μ and ( p p μ , r r μ ) of the solution (18) satisfying the upper bound
( u u μ , b b μ ) 1 C μ min { 1 , γ , τ } ( u 1 + γ + b τ + curl b τ + p γ + r 1 + τ ) + C σ μ F * .
( p p μ , r r μ ) C μ min { 1 , γ , τ } ( u 1 + γ + b τ + curl b τ + p γ + r 1 + τ ) + C σ μ F * .
( u u μ , b b μ ) 0 C μ min { 2 , γ + 1 , τ + 1 } ( u 1 + γ + b τ + curl b τ + p γ + r 1 + τ ) + C μ 2 .
The proof of Theorem 1 is shown in the section of Appendix A.
In the following, the Oseen iteration is used to linearize the stabilized finite element discrete form (17). The stability and convergence is proven. The stabilized finite element algorithm based on Oseen iteration is stated as follows: Given ( u μ n 1 , b μ n 1 , p μ n 1 , r μ n 1 ) , find ( u μ n , b μ n , p μ n , r μ n ) X μ × W μ × Q μ × S μ such that
a s ( u μ n , v ) + c 0 ( u μ n 1 , u μ n , v ) c 1 ( b μ n 1 , v , b μ n ) b s ( p μ n , v ) + b s ( q , u μ n ) + G ( p μ n , q ) + σ μ R e 1 a s ( u μ n , v ) = f , v ,
a m ( b μ n , c ) + c 1 ( b μ n 1 , u μ n , c ) b m ( r μ n , c ) + b m ( s , b μ n ) = ( g , c ) .
Here, the initial value ( u μ 0 , b μ 0 , p μ 0 , r μ 0 ) X μ × W μ × Q μ × S μ is given by
a s ( u μ 0 , v ) b s ( p μ 0 , v ) + b s ( q , u μ 0 ) + G ( p μ 0 , q ) + σ μ R e 1 a s ( u μ 0 , v ) = f , v ,
a m ( b μ 0 , c ) b m ( r μ 0 , c ) + b m ( s , b μ 0 ) = ( g , c ) .
Rewrite (31) and (32) in compact form as
A μ ( u μ n , b μ n , v , c ) + C ( u μ n 1 , b μ n 1 ; u μ n , b μ n ; v , c ) + G ( p μ n , q ) B ( p μ n , r μ n ; v , c ) + B ( q , s ; u μ n , b μ n ) = F , ( v , c ) ,
for n = 1 , 2 , , for all ( v , c , q , s ) X μ × W μ × Q μ × S μ .
Lemma 2.
If the condition 0 < σ 1 < 1 holds, for all m 0 , then the solution ( u μ m , b μ m , p μ m , r μ m ) of (35) satisfies
C m i n ( u μ m , b μ m ) 1 + ( p μ m , r μ m ) C F * ,
( A 1 μ u μ m , A 2 μ b μ m ) 0 C F 0 .
Proof. 
For m = 0 , taking ( v , b , q , s ) = ( u μ 0 , b μ 0 , p μ 0 , r μ 0 ) X μ × W μ × Q μ × S μ in (33) and (34), we can access
a s ( u μ 0 , u μ 0 ) + a m ( b μ 0 , b μ 0 ) + G ( p μ 0 , p μ 0 ) + σ μ R e 1 a s ( u μ 0 , u μ 0 ) = f , u μ 0 + ( g , b μ 0 ) ,
Using (20), we have
C m i n ( u μ 0 , b μ 0 ) 1 F * .
For m = J , assuming that (36) holds, it is sufficient to prove that it also holds for m = J + 1 . Let m = J + 1 take ( v , c , q , s ) = ( u μ J + 1 , b μ J + 1 , p μ J + 1 , r μ J + 1 ) X μ × W μ × Q μ × S μ in (33) and (34), using (8), we get
a s ( u μ J + 1 , u μ J + 1 ) + a m ( b μ J + 1 , b μ J + 1 ) + G ( p μ J + 1 , p μ J + 1 ) + σ μ R e 1 a s ( u μ J + 1 , u μ J + 1 ) = ( f , u μ J + 1 ) + ( g , b μ J + 1 ) .
and by applying (20) and (8), we derive that
C m i n ( u μ J + 1 , b μ J + 1 ) 1 F * .
Thus, the proof of the first part of (36) has been finished.
Applying (16) to (31), and using (10) in (32) with s = 0 , we have
β ^ R e 1 u μ m 0 + p μ m 0 + β ^ r μ m 0 C N ^ ( u μ m 1 , b μ m 1 ) 1 ( u μ m , b μ m ) 1 + C σ μ C m a x ( u μ m , b μ m ) 1 + F * .
Combining with the stability of ( u μ m , b μ m ) 1 , we can complete the proof of (36). Similar to (27), (37) can be derived. The proof ends.    □
Next, we will establish the upper bound of error ( u μ u μ m , b μ b μ m , p μ p μ m , r μ r μ m ) . For convenience, let ( e m , b m , η m , τ m ) = ( u μ u μ m , b μ b μ m , p μ p μ m , r μ r μ m ) .
Theorem 2.
Suppose that 0 < σ 1 < 1 , for all m 0 , ( e m , b m , η m , τ m ) satisfies
C m i n ( e m , b m ) 1 σ 1 m F * , ( η m , τ m ) C 1 σ 1 m F * ,
( u u μ m , b b μ m ) 1 + ( p p μ m , r r μ m ) C μ min { 1 , γ , τ } + C σ 1 m .
Proof. 
Subtracting (35) from (21), there holds
A μ ( e m , b m ; v , c ) + C ( e m 1 , b m 1 ; u μ , b μ ; v , c ) + C ( u μ m 1 , b μ m 1 ; e m , b m ; v , c ) + G ( η m , q ) B ( η m , τ m ; v , c ) + B ( q , s ; e m , b m ) = 0 .
Choose ( v , c , q , s ) = ( e m , b m , η m , τ m ) to obtain
A μ ( e m , b m ; e m , b m ) + C ( e m 1 , b m 1 ; u μ , b μ ; e m , b m ) + G ( η m , η m ) = 0 .
It follows from (20), (9) and Lemma 2 that
C m i n ( e m , b m ) 1 N ^ ( e m 1 , b m 1 ) 1 ( u μ , b μ ) 1 σ 1 C m i n ( e m 1 , b m 1 ) 1 σ 1 m C m i n ( e 0 , b 0 ) 1 σ 1 m F * .
Subtracting (31) from (16), we have
D μ ( e m , η m ; v , q ) + c 0 ( e m 1 , u μ , v ) + c 0 ( u μ m 1 , e m , v ) c 1 ( b m 1 , v , b μ ) + c 1 ( b μ m 1 , v , b m ) + σ μ R e 1 a s ( e m , v ) = 0 .
Using the second equation of (17) minus equation (32) and choosing s = 0 , we get
b m ( τ m , c ) = a m ( b m , c ) + c 1 ( b m 1 , u μ , c ) + c 1 ( b μ m 1 , e m , c ) .
Applying (16) and (10) to the above two equations, respectively, there holds
β ^ R e 1 e m 0 + η m 0 + β ^ η m 0 N ^ ( e m 1 , b m 1 ) 1 ( u μ , b μ ) 1 + N ^ ( u μ m 1 , b μ m 1 ) 1 ( e m , b m ) 1 + σ μ ( e m , b m ) 1 C σ 1 m F * .
The result (39) can be obtained by (38) and Theorem 1. The proof ends.    □

3. Two-Level Stabilized Finite Element Algorithm

In this section, motivated by [38], two-level stabilized finite element algorithm for incompressible MHD equations is presented. The stability analysis and the optimal error estimation with respect to the mesh size H and h and the iterative step m are obtained.
It is evident that in Steps 2–5 of Algorithm 1 the iteration is controlled by ( u H u H m , b H b H m ) 1 C ( u H m u H m 1 , b H m b H m 1 ) 0 (see Theorem 5 of [4]), which provides an operable way to acquire the desired solution ( u H m , b H m ) .
Algorithm 1 Two-level stabilized finite element algorithm
1:
Give the initial value ( u H 0 , b H 0 , p H 0 , r H 0 ) X H × W H × Q H × S H by (33) and (34) with μ = H .
2:
while ( u H m u H m 1 , b H m b H m 1 ) 0 > ϵ do
3:
    Solve MHD on the coarse grid: Find ( u H m , b H m , p H m , r H m ) X H × W H × Q H × S H by (35) with μ = H .
4:
     ( u H m 1 , b H m 1 , p H m 1 , r H m 1 ) = ( u H m , b H m , p H m , r H m ) .
5:
end while
6:
Find ( u m h , b m h , p m h , r m h ) X h × W h × Q h × S h on the fine grid, for any ( v , c , q , s ) X h × W h × Q h × S h , such that
a s ( u m h , v ) + c 0 ( u H m , u m h , v ) c 1 ( b H m , v , b m h ) b s ( p m h , v ) + b s ( q , u m h ) + G ( p m h , q ) + σ h R e 1 a s ( u m h , v ) = f , v ,
a m ( b m h , c ) + c 1 ( b H m , u m h , c ) b m ( r m h , c ) + b m ( s , b m h ) = ( g , c ) .
Theorem 3.
Under the assumption of Theorem 2, the solutions ( u m h , b m h ) obtained from (41) and (42) satisfy
C m i n ( u m h , b m h ) 1 F * ,
( u u m h , b b m h ) 1 + ( p p m h , r r m h ) C ( H 2 + H 2 min { 1 , γ , τ } + H min { 2 , γ + 1 , τ + 1 } + h + h min { 1 , γ , τ } + σ 1 m ) .
Proof. 
Taking ( v , c , q , s ) = ( u m h , b m h , p m h , r m h ) X h × W h × Q h × S h in (41) and (42), by using of (8) and (20), we can easily derive (43).
Subtracting (41) and (42) from (2) and (3), respectively, we have
A ( u u m h , b b m h ; v , c ) + C ( u u H m , b b H m ; u , b ; v , c ) + C ( u H m , b H m ; u u m h , b b m h ; v , c ) B ( p p m h , r r m h ; v , c ) + B ( q , s ; u u m h , b b m h ) G ( p m h , q ) = σ h R e 1 a s ( u m h , v ) .
By the two projection operators of (22) and (24) with μ = h , letting e u h = R ( u , p ) u m h , e b h = Λ b b m h , e p h = Q ( u , p ) p m h , e r h = Λ r r m h , and then taking v = e u h , c = e b h , q = e p h , s = e r h , there holds
A μ ( e u h , e b h ; e u h , e b h ) + G ( e p h , e p h ) = C ( u H m u , b H m b ; u u H m , b b H m ; e u h , e b h ) + C ( u H m u , b H m b ; u H m , b H m ; e u h , e b h ) + C ( u H m , b H m ; R ( u , p ) u , Λ b b ; e u h , e b h ) + σ h R e 1 a s ( u , e u h ) + σ h R e 1 a s ( R ( u , p ) u , e u h ) + G ( p , e p h ) + G ( Q ( u , p ) p , e p h ) .
The left-hand side of (46) can be estimated as
l . h . s C m i n ( e u h , e b h ) 1 2 + e p h Π h e p h 0 2 min { C m i n , 1 } ( e u h , e b h ) 1 2 + e p h Π h e p h 0 2 .
Making use of (14), the right-hand side of (46) for G ( · , · ) can be estimated as
G ( p , e p h ) = ( p Π h p , e p h Π h e p h ) C h min { 1 , γ } p γ e p h Π h e p h 0 ,
G ( Q ( u , p ) p , e p h ) C Q ( u , p ) p 0 e p h Π h e p h 0 C h min { 1 , γ } ( u 1 + γ + p γ ) e p h Π h e p h 0 .
Using (9), (12) and (37), as well as Theorems 1, 2 and Lemma 2, the right-hand side of (46) can be estimated that
r . h . s N ^ ( u u H m , b b H m ) 1 2 ( e u h , e b h ) 1 + N ^ ( u u H , b b H ) 0 ( A 1 H u H m , A 2 H b H m ) 0 ( e u h , e b h ) 1 + N ^ ( u H u H m , b H b H m ) 1 ( u H m , b H m ) 1 ( e u h , e b h ) 1 + N ^ ( u H m , b H m ) 1 ( u R ( u , p ) , b Λ b ) 1 ( e u h , e b h ) 1 + σ h ( u , b ) 1 ( e u h , e b h ) 1 + σ h ( u R ( u , p ) , b Λ b ) 1 ( e u h , e b h ) 1 + C h min { 1 , γ } ( u 1 + γ + p γ ) e p h Π h e p h 0 . C ( H 2 min { 1 , γ , τ } + σ 1 2 m + C H min { 2 , γ + 1 , τ + 1 } + H 2 + σ 1 m + h + h min { 1 , γ , τ } ) · ( e u h , e b h ) 1 2 + e p h Π h e p h 0 2 1 2 ,
Combining (23), (25) and (47) with (50), we can get the first part of (44).
To estimate the pressure, we rewrite (45) with s = 0 as
D μ ( u u m h , p p m h ; v , q ) + c 0 ( u u H m , u , v ) + c 0 ( u H m , u u m h , v ) c 1 ( b b H m , v , b ) c 1 ( b H m , v , b b m h ) σ h R e 1 a s ( u m h , v ) = G ( p , q ) ,
b m ( r r m h , c ) = a m ( b b m h , c ) + c 1 ( b b H m , u u H m , c ) + c 1 ( b b H m , u H m , c ) + c 1 ( b H m , u u H m , c ) .
Applying (16), (10) and the standard technique to the above two equations, we can derive the second part of (44). We complete the proof.   □

4. Numerical Examples

In this section, some numerical experiments are shown to verify the correctness and effectiveness of the one-level stabilized finite element method and the two-level stabilized one. Here, the velocity, pressure and quasi-pressure are approximated by P 1 and the magnetic field by the first (or second) class Nédélec edge element. SFEM denotes by the stabilized finite element method (31) and (32). The software FEAlPy V1.0 [39] created by Huayi Wei, Xiangtan University, Xiangtan, China is used in the numerical examples.
Smooth solution in 2D: Set Ω = [ 0 , 1 ] 2 and R e = R m = S = 1 , σ = 0.01 . Given the source terms f , g such that the exact solution is
u 1 = 10 x 1 2 ( x 1 1 ) 2 x 2 ( x 2 1 ) ( 2 x 2 1 ) , u 2 = 10 x 1 ( x 1 1 ) ( 2 x 1 1 ) x 2 2 ( x 2 1 ) 2 , b 1 = cos ( π x 1 ) sin ( π x 2 ) , b 2 = sin ( π x 1 ) cos ( π x 2 ) , p = 10 ( 2 x 1 1 ) ( 2 x 2 1 ) , r = 0 .
Table 1 and Table 2 display the errors of SFEM and two-level SFEM for 2D MHD Equation (1). It is shown that the corresponding errors are smaller and smaller along with the grid getting finer and finer, the convergence order is optimal. When h = O ( H 2 ) , the error accuracy of the two methods is almost the same. From CPU time, compared to SFEM, two-level SFEM save much computational cost.
The numerical results are listed in Table 3 and Table 4 when the magnetic field is approximated by the second class Nédélec element. Clearly, the convergence order of | | b b h | | 0 is one higher than that in Table 1 and Table 2, which is consistent with the general theoretical analysis results of the Nédélec element.
Smooth solution in 3D: Set Ω = [ 0 , 1 ] 3 and R e = R m = S = 1 , σ = 0.01 . Given f , g such that the exact solution is:
u 1 = 0.5 sin ( π x 1 ) c o s ( π x 2 ) c o s ( π x 3 ) , u 2 = 0.5 cos ( π x 1 ) s i n ( π x 2 ) c o s ( π x 3 ) , u 3 = cos ( π x 1 ) c o s ( π x 2 ) s i n ( π x 3 ) , b 1 = 0.5 cos ( π x 1 ) sin ( π x 2 ) sin ( π x 3 ) , b 2 = sin ( π x 1 ) cos ( π x 2 ) sin ( π x 3 ) , b 3 = 0.5 sin ( π x 1 ) sin ( π x 2 ) cos ( π x 3 ) , p = cos ( π x 1 ) cos ( π x 2 ) cos ( π x 3 ) , r = 0 .
In Table 5 and Table 6, the variable quantity ( u , b , p , r ) is approximated by P 1 , the first class Nédélec element, P 1 and P 1 , respectively. Table 7 and Table 8 list the results when ( u , b , p , r ) is approximated by P 1 , the second class Nédélec element, P 1 and P 1 . It is observed that the numerical results agree well with the theoretical results of Theorems 1–3. On the other hand, from Table 7 and Table 8, we find that SFEM (35) does not work when H = 1 / 16 , however two-level SFEM (41) and (42) is valid in the current computing environment for our computer. On the other hand, the stability results of (43) are checked by Figure 1.
2D MHD problem with a singular solution: We consider 2D MHD system (1) in the L-type domain Ω : = [ 1 , 1 ] 2 \ ( [ 0 , 1 ] × [ 1 , 0 ] ) . Set R e = S = 1 , R m = 0.001 , the analytical solution in polar coordinates ( ρ , φ ) is given by [40]
u ( ρ , φ ) = ρ λ ( 1 + λ ) sin ( φ ) ψ ( ϕ ) + cos ( φ ) ψ ( φ ) ρ λ ( 1 + λ ) cos ( φ ) ψ ( φ ) + sin ( φ ) ψ ( φ ) , b ( ρ , φ ) = ρ 2 / 3 sin ( 2 / 3 φ ) , p ( ρ , φ ) = ρ λ 1 ( 1 + λ ) 2 ψ ( φ ) + ψ ( φ ) / ( 1 λ ) , r = 0 , ψ ( φ ) = sin ( ( 1 + λ ) φ ) cos ( λ ω ) / ( 1 + λ ) cos ( ( 1 + λ ) φ ) sin ( ( 1 λ ) φ ) cos ( λ ω ) / ( 1 λ ) + cos ( ( 1 λ ) φ ) , ω = 3 2 π , λ 0.54448373678246 .
In the 2D case, there holds the regularity u H 1 + λ ( Ω ) , b H 2 3 ( Ω ) and p H λ ( Ω ) .
In Table 9 and Table 10, ( u , b , p , r ) is approximated by P 1 , the second class Nédélec element, P 1 and P 1 . Because the regularity of velocity, magnetic field and pressure is low, the convergence of | | u u h | | 0 , | | ( u u h ) | | 0 , | | p p h | | 0 , | | b b h | | 0 , | | b b h | | curl keep the rate of 1.4, 0.54, 0.59, 0.66, 0.66, respectively, which verify the correctness of the theoretical analysis (Theorems 2 and 3) results. In Figure 2 we display the streamlines of the velocity field and magnetic field, and the contours of the pressure, which are consistent with the numerical results in the literature [40].

5. Conclusions

Based on the stabilization and the Lagrange multiplier techniques, the stabilized finite element algorithm is designed for the stationary incompressible MHD. The Lagrange multiplier technique idea helps us in dealing with the low regular magnetic field sub-problem by H ( curl ; Ω ) -conforming element. The stabilized one by using local Gauss integration allow us to adopt the lowest equal-order elements to approximate the flow field sub-problem. The stability and optimal convergence analysis are given. Furthermore, the two-level stabilized finite element algorithms are presented. In the first step we combine the stabilized finite element method with the Oseen iteration for the nonlinear MHD equations on a coarse grid. For the second step, we employ the linearized correction on a fine grid. We give the optimal error analysis, which shows that when the grid sizes satisfy h = O ( H 2 ) , the two-level stabilization method not only has the optimal convergence order, but also can save more computational cost than the one-level method. These theoretical analysis results have been verified by some numerical experiments.

Author Contributions

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

Funding

The research was funded by the National Natural Science Foundation of China (Nos: 12071404, 11701151), Young Elite Scientist Sponsorship Program by Cast of CAST (No: 2020QNRC001), China Postdoctoral Science Foundation (Nos: 2018T110073), the Natural Science Foundation of Hunan Province (No: 2019JJ40279), Excellent Youth Program of Scientific Research Project of Hunan Provincial Department of Education (Nos: 20B564), and International Scientific and Technological Innovation Cooperation Base of Hunan Province for Computational Science (No: 2018WK4006).

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. Proof of Theorem 1

In this part, we will give the detail proof of Theorem 1.
Proof. 
Let e u = R ( u , p ) u μ , e b = b b μ , e p = Q ( u , p ) p μ , e r = r r μ . Subtract (18) from (4) and choose v = e u , c = e b , q = e p , s = e r , we get
A μ ( e u , e b ; e u , e b ) + C ( e u , e b ; u , b ; e u , e b ) + G ( e p , e p ) = C ( R ( u , p ) u , b b ; u , b ; e u , e b ) + C ( u μ , b μ ; R ( u , p ) u , b b ; e u , e b ) + σ μ R e 1 a s ( u , e u ) + σ μ R e 1 a s ( R ( u , p ) u , e u ) + G ( p , e p ) + G ( Q ( u , p ) p , e p ) .
Using (9) and (20) and Cauchy-Schwarz inequality, the left-hand side of (A1) can be bounded by
l . h . s . C m i n N ^ F * v ̲ ( e u , e b ) 1 2 + e p Π μ e p 0 2 v ̲ ( 1 σ 0 ) ( e u , e b ) 1 2 + e p Π μ e p 0 2 min { v ̲ ( 1 σ 0 ) , 1 } ( e u , e b ) 1 2 + e p Π μ e p 0 2 ,
where σ 0 = N ^ F * v ̲ 2 .
By (14), the two terms of the right-hand side of (A1) with respect to G ( · , · ) can be estimated as
G ( p , e p ) p Π μ p 0 e p Π μ e p 0 C μ min { 1 , γ } p γ e p Π μ e p 0 ,
G ( Q ( u , p ) p , e p ) C Q ( u , p ) p 0 e p Π μ e p 0 C μ min { 1 , γ } ( u 1 + γ + p γ ) e p Π μ e p 0 .
Thus, from (5), (9), (23), (25) and Lemma 1, the right-hand side of (A1) can be estimated as
r . h . s N ^ ( u , b ) 1 + ( u μ , b μ ) 1 ( u R ( u , p ) , b Λ b ) 1 ( e u , e b ) 1 + σ μ ( u , b ) 1 + ( u R ( u , p ) , b Λ b ) 1 ( e u , e b ) 1 + C μ min { 1 , γ } ( u 1 + γ + p γ ) e p Π μ e p 0 N ^ F * v ̲ + F * C m i n ( u R ( u , p ) , b Λ b ) 1 ( e u , e b ) 1 + σ μ F * v ̲ + ( u R ( u , p ) , b Λ b ) 1 ( e u , e b ) 1 + C μ min { 1 , γ } ( u 1 + γ + p γ ) e p Π μ e p 0 C ( μ min { 1 , γ , τ } u 1 + γ + p γ + b τ + curl b τ + r τ + 1 + σ v ̲ 1 μ F * ) ( e u , e b ) 1 2 + e p Π μ e p 0 2 1 2 .
It follows from (A2)–(A5) that
( e u , e b ) 1 C μ min { 1 , γ , τ } ( u 1 + γ + p γ + b τ + curl b τ + r τ + 1 ) + C σ v ̲ 1 μ F * .
Using triangle inequality, (23), (25) and (A6) to obtain (28).
From (2) and (17), we have
a s ( u u μ , v ) b s ( p p μ , v ) + b s ( q , u u μ ) + G ( p p μ , q ) = c 0 ( u μ u , u , v ) + c 0 ( u μ , u μ u , v ) + c 1 ( b b μ , v , b ) + c 1 ( b μ , v , b b μ ) + σ μ R e 1 a s ( u μ , v ) + G ( p , q ) .
Using (16), (5), (9), (14) and Lemma 1 to derive
β ^ R e 1 ( u u μ ) 0 + p p μ 0 N ^ ( u , b ) 1 + ( u μ , b μ ) 1 ( u u μ , b b μ ) 1 + C m a x σ μ ( u μ , b μ ) 1 + C p Π μ p 0 N ^ F * v ̲ + F * C m i n ( u u μ , b b μ ) 1 + σ μ C m a x C m i n F * + c 2 μ min { 1 , γ } p γ 2 v ̲ σ 0 ( u u μ , b b μ ) 1 + C σ μ F * + C μ min { 1 , γ } p γ .
From (3) and (17), and taking s = 0 to get
b m ( r r μ , c ) = a m ( b b μ , c ) + c 1 ( b b μ , u , c ) + c 1 ( b μ , u u μ , c ) .
Applying (10), (5), (9) and Lemma 1, we have
β ^ ( r r μ ) 0 C m a x ( u u μ , b b μ ) 1 + N ^ ( u u μ , b b μ ) 1 ( u , b ) 1 + N ^ ( u μ , b μ ) 1 ( u u μ , b b μ ) 1 C m a x ( u u μ , b b μ ) 1 + v ̲ σ 0 ( u u μ , b b μ ) 1 + C m i n σ 1 ( u u μ , b b μ ) 1 .
Combining (28) and (A8) with (A10), we can obtain (29).
Further, to obtain (30), we need to introduce the dual problem [11]: For all ( v , c , q , l ) X × W × Q × S , find ( w , Φ , s , t ) X × W × Q × S such that
A ( v , c ; w , Φ ) + C ( u μ , b μ ; v , c ; w , Φ ) + C ( v , c ; u , b ; w , Φ ) B ( s , t ; v , c ) + B ( q , l ; w , Φ ) = ( u u μ , b b μ ; v , c ) .
Taking ( v , c ; q , l ) = ( w , Φ ; s , t ) in (A11) and using (9), then
C m i n ( 1 σ 1 ) ( w , Φ ) 1 ( u u μ , b b μ ) 0 .
Assuming that the region Ω is sufficiently smooth (see Theorem 2 of [11]), then the following regularity error estimates are available
( w , Φ ) 2 + ( s , t ) 1 C ( u u μ , b b μ ) 0 + N ^ ( u , b ) 1 + ( u μ , b μ ) 1 ( w , Φ ) 1 1 2 ( w , Φ ) 2 1 2 C ( u u μ , b b μ ) 0 + 2 C m i n σ 1 ( w , Φ ) 1 1 2 ( w , Φ ) 2 1 2 C ( u u μ , b b μ ) 0 + C σ 1 2 ( w , Φ ) 1 + 1 2 ( w , Φ ) 2 C ( u u μ , b b μ ) 0 + 1 2 ( w , Φ ) 2 ,
thereby
( w , Φ ) 2 + ( s , t ) 1 C ( u u μ , b b μ ) 0 .
Finding v = u u μ , c = b b μ , q = l = 0 such that
A ( u u μ , b b μ ; w , Φ ) + C ( u μ , b μ ; u u μ , b b μ ; w , Φ ) + C ( u u μ , b b μ ; u , b ; w , Φ ) B ( s , t ; u u μ , b b μ ) = ( u u μ , b b μ ; u u μ , b b μ ) .
Subtracting (2) and (3) from (18), and taking q = l = 0 , for all ( v , c ) X μ × W μ , we have
A ( u u μ , b b μ ; v , c ) + C ( u μ , b μ ; u u μ , b b μ ; v , c ) + C ( u u μ , b b μ ; u , b ; v , c ) B ( p p μ , r r μ ; v , c ) σ μ R e 1 a s ( u μ , v ) = 0 .
Subtract (A15) from (A14) to get
A ( u u μ , b b μ ; w v , Φ c ) + C ( u μ , b μ ; u u μ , b b μ ; w v , Φ c ) + C ( u u μ , b b μ ; u , b ; w v , Φ c ) + B ( q μ s , l μ t ; u u μ , b b μ ) B ( p p μ , r r μ ; w v , Φ c ) + σ μ R e 1 a s ( u μ , v ) = ( u u μ , b b μ ) 0 2 ,
where q μ Q μ and l μ S μ are the approximation of s and t, respectively.
Similar to the derivation in the literature [41] (see the proof of Theorem 3.2), we get
( w , Φ ) 1 C μ ( w , Φ ) 2 , w H 2 ( Ω ) , Φ H 2 ( Ω ) .
Taking v = R ( w , s ) , c = Λ Φ in (A16), Applying (5), (7), (9), (23), (25), (A13) to get
( u u μ , b b μ ) 0 2 v ¯ ( u u μ , b b μ ) 1 ( w R ( w , s ) , Φ Λ Φ ) 1 + N ^ ( ( u , b ) 1 ( u u μ , b b μ ) 1 ( w R ( w , s ) , Φ Λ Φ ) 1 + N ^ ( u μ , b μ ) 1 ( u u μ , b b μ ) 1 ( w R ( w , s ) , Φ Λ Φ ) 1 + ( u u μ , b b μ ) 1 ( s q μ , t l μ ) + ( w R ( w , s ) , Φ Λ Φ ) 1 ( p p μ , r r μ ) + σ μ ( u μ , b μ ) 1 ( ( w R ( w , s ) , Φ Λ Φ ) 1 + ( w , Φ ) 1 ) C μ ( u u μ , b b μ ) 1 ( u u μ , b b μ ) 0 + C μ ( p p μ , r r μ ) ( u u μ , b b μ ) 0 + C μ 2 ( u u μ , b b μ ) 0 ,
which together with (28) and (29) yield the desired result (30). The proof ends.   □

References

  1. Gerbeau, J.; Le Bris, C.; Lelièvre, T. Mathematical Methods for the Magnetohydrodynamics of Liquid Metals; Clarendon Press: Oxford, UK, 2006. [Google Scholar]
  2. Gunzburger, M.; Meir, A.; Peterson, J. On the existence, uniqueness, and finite element approximation of solutions of the equations of stationary, incompressible magnetohydrodynamics. Math. Comput. 1991, 56, 523–563. [Google Scholar] [CrossRef]
  3. Shi, D.; Yu, Z. Nonconforming mixed finite element methods for stationary incompressible magnetohydrodynamics. Int. J. Numer. Anal. Model. 2013, 10, 904–919. [Google Scholar]
  4. Dong, X.; He, Y.; Zhang, Y. Convergence analysis of three finite element iterative methods for the 2D/3D stationary incompressible magnetohydrodynamics. Comput. Meth. Appl. Math. Eng. 2014, 276, 287–311. [Google Scholar] [CrossRef]
  5. Dong, X.; He, Y. The Oseen type finite element iterative method for the stationary incompressible magnetohydrodynamics. Adv. Appl. Math. Mech. 2017, 9, 775–794. [Google Scholar] [CrossRef]
  6. Mao, S.; Feng, X.; Su, H. Optimal error estimates of penalty based iterative methods for steady incompressible magnetohydrodynamics equations with different viscosities. J. Sci. Comput. 2019, 79, 1078–1110. [Google Scholar]
  7. Du, B.; Huang, J. The generalized Arrow-Hurwicz method with applications to fluid computation. Commun. Comput. Phys. 2019, 25, 752–780. [Google Scholar] [CrossRef] [Green Version]
  8. Layton, W.; Meir, A.; Schmidtz, P. A two-level discretization method for the stationary MHD equations. Electron. Trans. Numer. Anal. 1997, 6, 198–210. [Google Scholar]
  9. Su, H.; Xu, J.; Feng, X. Optimal convergence analysis of two-level nonconforming finite element iterative methods for 2D/3D MHD equations. Entropy 2022, 24, 587. [Google Scholar] [CrossRef]
  10. Su, H.; Feng, X.; Zhao, J. On two-level Oseen penalty iteration methods for the 2D/3D stationary incompressible magnetohydronamics. J. Sci. Comput. 2020, 83, 11. [Google Scholar] [CrossRef]
  11. Dong, X.; He, Y. Convergence of some finite element iterative methods related to different Reynolds numbers for the 2D/3D stationary incompressible magnetohydrodynamics. Sci. China Math. 2016, 59, 589–608. [Google Scholar] [CrossRef]
  12. Dong, X.; He, Y. Two-level Newton iterative method for the 2D/3D stationary incompressible magnetohydrodynamics. J. Sci. Comput. 2015, 63, 426–451. [Google Scholar] [CrossRef]
  13. Tang, Q.; Huang, Y. Local and parallel finite element algorithm based on Oseen-type iteration for the stationary incompressible MHD flow. J. Sci. Comput. 2017, 70, 149–174. [Google Scholar]
  14. Dong, X.; He, Y.; Wei, H.; Zhang, Y. Local and parallel finite element algorithm based on the partition of unity method for the incompressible MHD flow. Adv. Comput. Math. 2018, 44, 1295–1319. [Google Scholar] [CrossRef]
  15. Tang, Q.; Huang, Y. Analysis of local and parallel algorithm for incompressible magnetohydrodynamics flows by finite element iterative method. Commun. Comput. Phys. 2019, 25, 729–751. [Google Scholar] [CrossRef]
  16. Dong, X.; He, Y. A parallel finite element method for incompressible magnetohydrodynamics equations. Appl. Math. Lett. 2020, 102, 106076. [Google Scholar] [CrossRef]
  17. Li, L.; Zheng, W. A robust solver for the finite element approximation of stationary incompressible MHD equations in 3D. J. Comput. Phys. 2017, 351, 254–270. [Google Scholar] [CrossRef] [Green Version]
  18. Ma, Y.; Hu, K.; Hu, X.; Xu, J. Robust preconditioners for incompressible MHD models. J. Comput. Phys. 2016, 316, 721–746. [Google Scholar] [CrossRef] [Green Version]
  19. Zhang, G.; Yang, M.; He, Y. Block preconditioners for energy stable schemes of magnetohydrodynamics equations. Numer. Methods Partial Differ. Eq. 2022. [Google Scholar] [CrossRef]
  20. Li, L.; Zhang, D.; Zheng, W. A constrained transport divergence-free finite element method for incompressible MHD equations. J. Comput. Phys. 2021, 428, 109980. [Google Scholar] [CrossRef]
  21. Zhang, G.; He, Y.; Yang, D. Analysis of coupling iterations based on the finite element method for stationary magnetohydrodynamics on a general domain. Comput. Math. Appl. 2014, 68, 770–788. [Google Scholar] [CrossRef]
  22. Li, J.; He, Y. A stabilized finite element method based on two local Gauss integrations for the Stokes equations. J. Comput. Appl. Math. 2008, 214, 58–65. [Google Scholar] [CrossRef] [Green Version]
  23. Zheng, H.; Shan, L.; Hou, Y. A quadratic equal-order stabilized method for Stokes problem based on two local Gauss integrations. Numer. Methods Partial Differ. Eq. 2010, 26, 1180–1190. [Google Scholar] [CrossRef]
  24. Li, R.; Li, J.; Chen, Z. 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]
  25. Huang, P.; He, Y.; Feng, X. Two-level stabilized finite element method for Stokes eigenvalue problem. Appl. Math. Mech. 2012, 33, 621–630. [Google Scholar] [CrossRef]
  26. Li, J. Investigations on two kinds of two-level stabilized finite element methods for the stationary Navier-Stokes equations. Appl. Math. Comput. 2006, 182, 1470–1481. [Google Scholar] [CrossRef]
  27. Li, J.; He, Y.; Chen, Z. A new stabilized finite element method for the transient Navier-Stokes equations. Comput. Meth. Appl. Math. Eng. 2007, 197, 22–35. [Google Scholar] [CrossRef]
  28. 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]
  29. Jiang, Y.; Mei, L.; Wei, H. A stabilized finite element method for transient Navier-Stokes equations based on two local Gauss integrations. Int. J. Numer. Meth. Fluids 2012, 70, 713–723. [Google Scholar] [CrossRef]
  30. Huang, P.; Zhao, J.; Feng, X. Highly efficient and local projection-based stabilized finite element method for natural convection problem. Int. J. Heat Mass Tran. 2015, 83, 357–365. [Google Scholar] [CrossRef]
  31. Schötzau, D. Mixed finite element methods for stationary incompressible magnetohydrodynamics. Numer. Math. 2004, 96, 771–800. [Google Scholar] [CrossRef]
  32. Heywood, J.; Rannacher, R. Finite-element approximation of the nonstationary Navier-Stokes problem. Part IV: Error analysis for second-order time discretization. SIAM J. Numer. Anal. 1990, 27, 353–384. [Google Scholar] [CrossRef]
  33. Sermange, M.; Temam, R. Some mathematical questions related to the MHD equations. Comm. Pure Appl. Math. 1984, 34, 635–664. [Google Scholar]
  34. He, Y.; Zhang, G.; Zou, J. Fully discrete finite element approximation of the MHD flow. Comput. Methods Appl. Math. 2022, 22, 357–388. [Google Scholar] [CrossRef]
  35. Nédélec, J. A new family of mixed finite elements in R3. Numer. Math. 1986, 50, 57–81. [Google Scholar] [CrossRef]
  36. Girault, V.; Raviart, P. Finite Element Approximation of the Navier-Stokes Equations; Springer: Berlin/Heidelberg, Germany, 1979. [Google Scholar]
  37. Monk, P. Finite Element Methods for Maxwell’s Equations; Oxford University Press: Oxford, UK, 2003. [Google Scholar]
  38. Huang, P.; Feng, X.; He, Y. Two-level defect-correction Oseen iterative stabilized finite element methods for the stationary Navier-Stokes equations. Appl. Math. Model. 2013, 37, 728–741. [Google Scholar] [CrossRef]
  39. FEALPy Help and Installation. Available online: https://www.weihuayi.cn/fly/fealpy.html (accessed on 24 March 2022).
  40. Greif, C.; Li, D.; Schötzau, D.; Wei, X. A mixed finite element method with exactly divergence-free velocities for incompressible magnetohydrodynamics. Comput. Meth. Appl. Math. Eng. 2010, 199, 2840–2855. [Google Scholar] [CrossRef]
  41. Layton, W.; Lee, H.; Peterson, J. A defect-correction method for the incompressible Navier-Stokes equations. Appl. Math. Comput. 2002, 129, 1–19. [Google Scholar] [CrossRef]
Figure 1. Stability of 2D (left) and 3D (right) problems.
Figure 1. Stability of 2D (left) and 3D (right) problems.
Entropy 24 01426 g001
Figure 2. Numerical approximations of 2D singular solution. (a) velocity field; (b) magnetic field; (c) pressure.
Figure 2. Numerical approximations of 2D singular solution. (a) velocity field; (b) magnetic field; (c) pressure.
Entropy 24 01426 g002
Table 1. Convergence of u h and p h (first class Nédélec element).
Table 1. Convergence of u h and p h (first class Nédélec element).
hH | | u u h | | 0 order | | ( u u h ) | | 0 order | | p p h | | 0 orderCPU(s)
SFEM1/164.31 × 10 3 7.14 × 10 2 1.19 × 10 1 0.49
1/161/44.28 × 10 3 7.15 × 10 2 1.28 × 10 1 0.36
SFEM1/368.80 × 10 4 1.962.62 × 10 2 1.242.93 × 10 2 1.732.79
1/361/68.76 × 10 4 1.962.64 × 10 2 1.233.36 × 10 2 1.651.70
SFEM1/642.81 × 10 4 1.981.36 × 10 2 1.131.10 × 10 2 1.7111.13
1/641/82.81 × 10 4 1.981.38 × 10 2 1.131.36 × 10 2 1.576.16
SFEM1/1001.15 × 10 4 1.998.43 × 10 3 1.085.21 × 10 3 1.6735.79
1/1001/101.16 × 10 4 1.978.53 × 10 3 1.086.99 × 10 3 1.4917.78
Table 2. Convergence of b h and r h (first class Nédélec element).
Table 2. Convergence of b h and r h (first class Nédélec element).
hH | | b b h | | 0 order | | b b h | | curl order | | r r h | | 0 CPU(s)
SFEM1/164.01 × 10 2 2.09 × 10 1 1.22 × 10 14 0.49
1/161/44.01 × 10 2 2.09 × 10 1 1.42 × 10 14 0.36
SFEM1/361.78 × 10 2 1.009.30 × 10 2 1.005.20 × 10 14 2.79
1/361/61.78 × 10 2 1.009.31 × 10 2 1.005.03 × 10 14 1.70
SFEM1/641.00 × 10 2 1.005.23 × 10 2 1.001.33 × 10 13 11.13
1/641/81.00 × 10 2 1.005.24 × 10 2 1.001.43 × 10 13 6.16
SFEM1/1006.41 × 10 3 1.003.35 × 10 2 1.002.28 × 10 13 35.79
1/1001/106.41 × 10 3 1.003.35 × 10 2 1.002.27 × 10 13 17.78
Table 3. Convergence of u h and p h (second class Nédélec element).
Table 3. Convergence of u h and p h (second class Nédélec element).
hH | | u u h | | 0 order | | ( u u h ) | | 0 order | | p p h | | 0 orderCPU(s)
SFEM1/164.31 × 10 3 7.14 × 10 2 1.20 × 10 1 0.78
1/161/44.28 × 10 3 7.15 × 10 2 1.28 × 10 1 0.47
SFEM1/368.80 × 10 4 1.962.62 × 10 2 1.242.94 × 10 2 1.737.63
1/361/68.76 × 10 4 1.962.64 × 10 2 1.233.36 × 10 2 1.653.33
SFEM1/642.81 × 10 4 1.981.36 × 10 2 1.131.10 × 10 2 1.7048.23
1/641/82.81 × 10 4 1.981.38 × 10 2 1.131.36 × 10 2 1.5718.00
SFEM1/1001.15 × 10 4 1.998.43 × 10 3 1.085.59 × 10 3 1.53205.89
1/1001/101.16 × 10 4 1.988.53 × 10 3 1.086.99 × 10 3 1.4971.25
Table 4. Convergence of b h and r h (second class Nédélec element).
Table 4. Convergence of b h and r h (second class Nédélec element).
hH | | b b h | | 0 order | | b b h | | curl order | | r r h | | 0 CPU(s)
SFEM1/164.19 × 10 3 2.05 × 10 1 1.44 × 10 14 0.78
1/161/44.10 × 10 3 2.05 × 10 1 1.78 × 10 14 0.47
SFEM1/368.33 × 10 4 1.999.13 × 10 2 1.006.62 × 10 14 7.63
1/361/68.39 × 10 4 1.989.31 × 10 2 1.007.60 × 10 14 3.33
SFEM1/642.63 × 10 4 2.005.14 × 10 2 1.001.49 × 10 13 48.23
1/641/82.71 × 10 4 1.965.14 × 10 2 1.001.74 × 10 13 18.00
SFEM1/1001.08 × 10 4 1.993.28 × 10 2 1.002.71 × 10 13 205.89
1/1001/101.15 × 10 4 1.913.29 × 10 2 1.003.85 × 10 13 71.25
Table 5. Convergence of u h and p h (first class Nédélec element).
Table 5. Convergence of u h and p h (first class Nédélec element).
hH | | u u h | | 0 order | | ( u u h ) | | 0 order | | p p h | | 0 orderCPU(s)
SFEM1/47.86 × 10 2 1.17 1.39 2.03
1/41/27.86 × 10 2 1.17 1.39 1.44
SFEM1/91.67 × 10 2 1.915.33 × 10 1 0.973.26 × 10 1 1.7928.05
1/91/31.67 × 10 2 1.915.34 × 10 1 0.973.29 × 10 1 1.7816.26
SFEM1/165.34 × 10 3 1.982.99 × 10 1 1.001.08 × 10 1 1.91577.84
1/161/45.38 × 10 3 1.982.99 × 10 1 1.001.12 × 10 1 1.86189.50
Table 6. Convergence of b h and r h (first class Nédélec element).
Table 6. Convergence of b h and r h (first class Nédélec element).
hH | | b b h | | 0 order | | b b h | | curl order | | r r h | | 0 CPU(s)
SFEM1/41.38 × 10 1 8.38 × 10 1 7.86 × 10 16 2.03
1/41/21.38 × 10 1 8.39 × 10 1 9.82 × 10 16 1.44
SFEM1/96.16 × 10 2 1.003.81 × 10 1 0.974.24 × 10 15 28.05
1/91/36.17 × 10 2 0.993.83 × 10 1 0.964.71 × 10 15 16.26
SFEM1/163.47 × 10 2 1.002.14 × 10 1 1.001.59 × 10 14 577.84
1/161/43.47 × 10 2 1.002.18 × 10 1 0.981.42 × 10 14 189.50
Table 7. Convergence of u h and p h (second class Nédélec element).
Table 7. Convergence of u h and p h (second class Nédélec element).
hH | | u u h | | 0 order | | ( u u h ) | | 0 order | | p p h | | 0 orderCPU(s)
SFEM1/47.86 × 10 2 1.17 1.39 2.39
1/41/27.86 × 10 2 1.17 1.40 1.85
SFEM1/91.67 × 10 2 1.915.33 × 10 1 0.973.26 × 10 1 1.7999.42
1/91/31.67 × 10 2 1.915.34 × 10 1 0.973.30 × 10 1 1.7842.96
SFEM1/16\\\\\\\
1/161/45.35 × 10 3 1.982.99 × 10 1 1.001.11 × 10 1 1.862877.53
Table 8. Convergence of b h and r h (second class Nédélec element).
Table 8. Convergence of b h and r h (second class Nédélec element).
hH | | b b h | | 0 order | | b b h | | curl order | | r r h | | 0 CPU(s)
SFEM1/46.64 × 10 2 8.29 × 10 1 8.89 × 10 16 2.39
1/41/26.64 × 10 2 8.30 × 10 1 1.10 × 10 15 1.85
SFEM1/91.40 × 10 2 1.913.76 × 10 1 0.985.60 × 10 15 99.42
1/91/31.41 × 10 2 1.913.76 × 10 1 0.976.19 × 10 15 42.96
SFEM1/16\\\\\\
1/161/44.61 × 10 3 1.952.12 × 10 1 1.002.26 × 10 14 2877.53
Table 9. Convergence of u h and p h .
Table 9. Convergence of u h and p h .
hH | | u u h | | 0 order | | ( u u h ) | | 0 order | | p p h | | 0 orderCPU(s)
SFEM1/49.97 × 10 2 1.55 1.74 0.16
1/41/29.96 × 10 2 1.55 1.76 0.16
SFEM1/161.27 × 10 2 1.487.41 × 10 1 0.547.74 × 10 1 0.591.89
1/161/41.29 × 10 2 1.477.41 × 10 1 0.547.80 × 10 1 0.591.11
SFEM1/363.95 × 10 3 1.454.78 × 10 1 0.545.00 × 10 1 0.5412.03
1/361/64.06 × 10 3 1.434.78 × 10 1 0.545.22 × 10 1 0.496.04
SFEM1/641.77 × 10 3 1.393.50 × 10 1 0.543.76 × 10 1 0.4949.61
1/641/81.84 × 10 3 1.373.50 × 10 1 0.543.93 × 10 1 0.4922.80
Table 10. Convergence of b h and r h .
Table 10. Convergence of b h and r h .
hH | | b b h | | 0 order | | b b h | | curl order | | r r h | | 0 CPU(s)
SFEM1/41.91 × 10 1 1.91 × 10 1 5.98 × 10 4 0.16
1/41/21.90 × 10 1 1.91 × 10 1 5.98 × 10 4 0.16
SFEM1/167.88 × 10 2 0.647.88 × 10 2 0.641.47 × 10 4 1.89
1/161/47.88 × 10 2 0.647.88 × 10 2 0.641.47 × 10 4 1.11
SFEM1/364.63 × 10 2 0.654.63 × 10 2 0.655.84 × 10 5 12.03
1/361/64.63 × 10 2 0.654.63 × 10 2 0.655.84 × 10 5 6.04
SFEM1/643.17 × 10 2 0.663.17 × 10 2 0.662.97 × 10 5 49.61
1/641/83.17 × 10 2 0.663.17 × 10 2 0.662.97 × 10 5 22.80
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Tang, Q.; Hou, M.; Xiao, Y.; Yin, L. Two-Level Finite Element Iterative Algorithm Based on Stabilized Method for the Stationary Incompressible Magnetohydrodynamics. Entropy 2022, 24, 1426. https://doi.org/10.3390/e24101426

AMA Style

Tang Q, Hou M, Xiao Y, Yin L. Two-Level Finite Element Iterative Algorithm Based on Stabilized Method for the Stationary Incompressible Magnetohydrodynamics. Entropy. 2022; 24(10):1426. https://doi.org/10.3390/e24101426

Chicago/Turabian Style

Tang, Qili, Min Hou, Yajie Xiao, and Lina Yin. 2022. "Two-Level Finite Element Iterative Algorithm Based on Stabilized Method for the Stationary Incompressible Magnetohydrodynamics" Entropy 24, no. 10: 1426. https://doi.org/10.3390/e24101426

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