Abstract
This paper studies several decoupled penalty methods to overcome the saddle point system of the steady state 2D/3D incompressible magnetohydronamics (MHD). These approaches combine the Oseen iteration and two-level technique with strong uniqueness condition \(0<\frac{\sqrt{2}C_{0}^{2}\max \{1,\sqrt{2}S_{c}\}\Vert {\mathbf{F }}\Vert _{-1}}{(\min \{R_{e}^{-1},S_{c}C_{1}R_{m}^{-1}\})^2}\le 1-\left( \frac{\Vert \mathbf{F }\Vert |_{-1}}{\Vert |\mathbf{F }\Vert _{0}}\right) ^{\frac{1}{2}}<1\) satisfied. For the convenience of implementation, we employ two different simple Lagrange finite element pairs \(P_{1}b-P_{1}-P_{1}b\) and \(P_{1}-P_{0}-P_{1}\) for velocity field, pressure and magnetic field, respectively. Rigorous analysis of the optimal error estimate and stability are provided. We present comprehensive numerical experiments, which indicate the effectiveness of the proposed methods for both two dimensional and three-dimensional problems.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The purpose of this work is to devise some decoupled penalty schemes for solving the following 2D/3D stationary incompressible MHD equations:
Here \(\Omega \) is a convex polygonal/polyhedral domain in \({\mathbb {R}}^d\), \(d=\) 2 or 3, with boundary \(\partial \Omega \). \(\mathbf{u }\) the velocity of the fluid, p the pressure, \(\mathbf{B }\) the magnetic field, \(\mathbf{f }\) and \(\mathbf{g }\) the external force terms, \(R_e\) the hydrodynamic Reynolds number, \(R_m\) the magnetic Reynolds number, \(S_c\) the coupling number and \(\mathbf{n }\) is the outer unit normal of \(\partial \Omega \). The system is supplemented with the boundary conditions:
The incompressible MHD model is a system of PDEs, which are prescribed by the Navier–Stokes equations and coupled with the pre-Maxwell equations. Incompressible MHD has many industrial applications such as metallurgical engineering, electromagnetic pumping, stirring of liquid metals, and measuring flow quantities based on induction [1]. Therefore, it is an important research topic to provide effective numerical methods for solving such flow problem. We refer to [2, 3] for more detailed information of physical background, Furthermore, there are many research works which use finite element methods to simulate the incompressible MHD flows in recent years. We refer to [2, 4,5,6,7,8,9,10,11,12,13,14,15] and many references therein.
The coupled system (1) involves nonlinear terms and the incompressible constraint, which requires much larger numbers of degrees of freedom to resolve numerically. Hence, the Stokes, Newton and Oseen iterative methods are considered for the stationary 2D/3D MHD equations to deal with the nonlinearity in [16,17,18]. And it can be concluded that Stokes iteration and Newton iteration are suitable to small Reynolds number such that the strong uniqueness conditions \(0<\sigma :\frac{\sqrt{2}C_{0}^{2}\max \{1,\sqrt{2}S_{c}\}\Vert {\mathbf{F }}\Vert _{-1}}{(\min \{R_{e}^{-1},S_{c}C_{1}R_{m}^{-1}\})^2}\le \frac{2}{5}\) and \(0<\sigma \le \frac{5}{11}\) hold, respectively. And the Oseen method is suitable for each Reynolds number such that \(0<\sigma <1\) holds.
The penalty method, the pressure stabilization method, the artificial compressibility method and the projection method [19,20,21,22,23,24,25,26], etc. are usually used to handle the incompressible constrain. Besides, we also proposed some decoupling method with Uzawa-type idea for the incompressible MHD equations in [27,28,29]. In this study, we mainly consider the penalty method to decouple the strong-coupled stationary incompressible MHD equations. The penalty method applied to (1) is to approximate the solution \((\mathbf{u },p,\mathbf{B })\) by \((\mathbf{u }_{\epsilon },p_{\epsilon },\mathbf{B }_{\epsilon })\) satisfying the following equations:
with the homogeneous boundary conditions:
where \(0<\epsilon <1\) is penalty parameter.
Although, the penalty method is to decouple \((\mathbf{u} ,\mathbf{B} )\) and p, the resulting system is still large. Two-level scheme, which was put forward by Xu for the nonlinear elliptic boundary value problem in [30, 31] which is efficient to save a large amount of computing time and give reasonable results. Under the strong uniqueness condition \(\sigma \le 1-\left( \frac{\Vert \mathbf{F }\Vert |_{-1}}{\Vert |\mathbf{F }\Vert _{0}}\right) ^{\frac{1}{2}}<1\), we focus on the two-level Oseen penalty finite element methods for 2D/3D steady state incompressible MHD equations in this article. And, we mainly explore the finite element space pair \(\mathbf{X }_{h}\times \text{ M }_{h}\times \mathbf{W }_{h}\) which does not satisfy the discrete inf-sup condition (\(P_{1}-P_{0}-P_{1}\)) and the one satisfies the discrete inf-sup condition (\(P_{1}b-P_{1}-P_{1}b\)). In general, the rigorous analysis shows that the proposed methods can get the optimal accuracy with appropriate relationship between \(\epsilon \), H and h. Numerical results confirming theoretical findings are presented for several 2D/3D examples. And we know that, the magnetic variables may have regularity below \(H^1\) with the domain \(\Omega \) is a non-convex polygon (polyhedron), and the continuous nodal finite element spaces may fail to approximate the singular magnetic solution. Then the magnetic field of our ongoing work is discretized by curl-conforming \(N\acute{e}d\acute{e}lec\) elements to deal with the situations of singular magnetic fields.
The paper is organized as follows. In Sect. 2, some basic results are given. Penalty mixed finite element method is given in Sect. 3. Section 4 is devoted to uniform stability and convergence of the two-level penalty iterative methods. Section 5 is reported to show numerical performance and accuracy of our algorithms. Finally, the article is concluded in Sect. 6.
2 Functional Setting of the Stationary MHD Equations
To derive the variational form, we introduce the following spaces
Throughout this work, space \(\mathbf{W }_{0n}=\mathbf{X }\times \mathbf{W }\) equipped with the graph norm \(\Vert (\mathbf{v },\mathbf{B })\Vert _1\), where \(\Vert (\mathbf{v },\mathbf{B })\Vert _i=(\Vert \mathbf{v }\Vert _i^2+\Vert \mathbf{B }\Vert _i^2)^{\frac{1}{2}}\) for all \(\mathbf{v }\in H^i(\Omega )^d\cap \mathbf{X }, \mathbf{B }\in H^i(\Omega )^d\cap \mathbf{W }\)\((i=0,1,2)\). And \(H^{-1}(\Omega )^d\) is the dual of \(\mathbf{X }\) with norm \(\Vert \mathbf{f }\Vert _{-1}=\sup _{0\ne \mathbf{w }\in \mathbf{X }}\frac{\langle \mathbf{f },\mathbf{w }\rangle }{\Vert \mathbf{w }\Vert _1},\) where \(\langle \cdot ,\cdot \rangle \) denotes duality product. Besides, we set \(\Vert \mathbf{F }\Vert _{-1}=\sup _{ (0,0)\ne (\mathbf{v },\varvec{\Psi })\in \mathbf{W }_{0n}}\frac{\langle \mathbf{F },(\mathbf{v },\varvec{\Psi }) \rangle }{\Vert (\mathbf{v },\varvec{\Psi })\Vert _1}\) and \(\Vert \mathbf{F }\Vert ^2_{*}=\Vert \mathbf{f} \Vert ^2_{-1}+\Vert \mathbf{g} \Vert ^2_{0}\).
Then, we arrive at an equivalent variational formulation for (1): find \(((\mathbf{u },\mathbf{B }),p)\in \mathbf{W }_{0n}\times \text{ M }\) such that
for all \(((\mathbf{v },\varvec{\Psi }),q)\in \mathbf{W }_{0n}\times \text{ M }\) and the variational formulation of (3) reads: find \(((\mathbf{u }_{\epsilon },\mathbf{B }_{\epsilon }),p_{\epsilon })\in \mathbf{W }_{0n}\times \text{ M }\) such that for all \(((\mathbf{v },\varvec{\Psi }),q)\in \mathbf{W }_{0n}\times \text{ M }\),
where \(\nu _{e}\) is the reciprocal of \(R_{e}\) and
Besides, we need the following properties of \(A_0(\cdot ,\cdot )\) and \(A_1(\cdot ,\cdot ,\cdot )\) in [2]: \(\forall \)\((\mathbf{u },\mathbf{B })\), \((\mathbf{v },\varvec{\Psi })\), \((\mathbf{w },\varvec{\Phi })\in \mathbf{W }_{0n}\), there holds
And we introduce the properties of trilinear form in [32]:
For the sake of convenience, C or c (with or without a subscript) will denotes a generic positive constant throughout the paper and denote
Then, we set \({\underline{\gamma }}:=\min \{R_{e}^{-1},S_{c}C_{1}R_{m}^{-1}\},~ {\overline{\gamma }}:=\max \{R_{e}^{-1},(2+d)S_{c}R_{m}^{-1}\},~ N:=\sqrt{2}C_{0}^{2}\max \{1,\sqrt{2}S_{c}\}\) in the following sections.
First, recall the following existence and uniqueness results in [16] for (5) and (6).
Theorem 2.1
Let \(\mathbf{f} \in H^{-1}(\Omega )^d\), \(\mathbf{g} \in L^{2}(\Omega )^d\) and \(R_e\), \(R_{m}\) and \(S_{c}\) satisfy the uniqueness condition
the problem (5) admits a unique solution \(((\mathbf{u },\mathbf{B }),p)\in \mathbf{W }_{0n}\times {\mathrm{M}}\) such that
Moreover, suppose that \(0< \sigma <1\) and \(\mathbf{f },\ \mathbf{g }\in {L}^{2}(\Omega )^d\), then solution \(((\mathbf{u },\mathbf{B }),p)\) such that
Theorem 2.2
If \(R_e\), \(R_{m}\) and \(S_{c}\) satisfy the uniqueness condition (14) and \(\epsilon c_{0}\le 1\) with \(c_{0}>0\), then the problem (6) has a unique solution \(((\mathbf{u }_{\epsilon },\mathbf{B }_{\epsilon }),p_{\epsilon })\in \mathbf{W }_{0n}\times {\mathrm{M}}\) which satisfies
Then, suppose that \(\mathbf{f },\ \mathbf{g }\in L^{2}(\Omega )^d\) and \(\epsilon c_{0}\le 1\), solution \(((\mathbf{u }_{\epsilon },\mathbf{B }_{\epsilon }),p_{\epsilon })\) of the problem (6) satisfies the following regularity
Theorem 2.3
Under the assumptions of Theorem 2.2, we have the following error bounds
Proof
Refer to [16] for details. \(\square \)
3 Penalty Finite Element Galerkin Discretization
Let \(\{\tau _\mu \}\) be a family of triangulations or tetrahedrons of \(\Omega \) into quasi-uniform finite elements K with \({\bar{\Omega }}=\bigcup _{K\in \tau _{\mu }}K\), mesh size \(\mu =h ~or ~ H\). Consider finite element space \(\mathbf{X} _{\mu }\subset \mathbf{X} \), \(\text{ M }_{\mu }\subset \text{ M }\), \(\mathbf{W} _{\mu }\subset \mathbf{W} \) and \((\mathbf{X} _{H},\text{ M }_{H},\mathbf{W} _{H})\subset (\mathbf{X} _{h},\text{ M }_{h},\mathbf{W} _{h})\). \(P_{l}(K)\) denote the set of all polynomials on K with order \(l\ge 0\) and \(\mathbf{W} _{0n}^{\mu }=\text{ X }_{\mu }\times \text{ W }_{\mu }\). Next, we introduce the discrete analogue of space \(\mathbf{V} \) as
The discrete Stokes operator \({\mathcal {A}}_{1\mu }=-P_{\mu }\Delta _{\mu }\), and \(\Delta _{\mu }\) defined as (see [33])
where \(P_{\mu }: L^2(\Omega )^d\rightarrow \mathbf{V} _{\mu }\) defined by \((P_{\mu }\mathbf{u} ,\mathbf{v} _{\mu })=(\mathbf{u} ,\mathbf{v} _{\mu })\) for all \(\mathbf{v} _{\mu } \in \mathbf{V} _{\mu }\) and define discrete operator \({\mathcal {A}}_{2\mu }\mathbf{B} _{\mu }=R_{0\mu } (\nabla _{\mu }\times \nabla \times \mathbf{B }_{\mu }+\nabla _{\mu }\nabla \cdot \mathbf{B }_{\mu })\in \mathbf{W} _{\mu }\) as follows (see [34])
where \(R_{0\mu }: L^2(\Omega )^d\rightarrow \mathbf{W} _{\mu }\) defined by \((R_{0\mu }\mathbf{B} ,\varvec{\Psi }_{\mu })=(\mathbf{B} ,\varvec{\Psi }_{\mu })\) for all \(\varvec{\Psi }_{\mu } \in \mathbf{W} _{\mu }\).
The following two finite element pairs are mainly considered to explore the relation between penalty parameter and the algorithms in this article:
- \(({\mathcal {P}}_{1})\).:
The unstable finite element pair
$$\begin{aligned} \begin{array}{lll} \mathbf{X} _{\mu } =\left\{ \mathbf{u }\in C^{0}({\bar{\Omega }})^d\cap \mathbf{X} : \mathbf{u }|_{K}\in P_{1}(K)^d,~ \forall K \in \tau _{\mu }\right\} ,\\ \text{ M }_{\mu }=\left\{ q\in \text{ M }: q|_{K}\in P_{0}(K),~ \forall K \in \tau _{\mu }\right\} ,\\ \mathbf{W} _{\mu }=\left\{ \mathbf{B }\in C^{0}({\bar{\Omega }})^d\cap \mathbf{W} : \mathbf{B }|_{K}\in P_{1}(K)^d,~ \forall K \in \tau _{\mu }\right\} . \end{array} \end{aligned}$$- \(({\mathcal {P}}_{2})\):
. The stable finite element pair
$$\begin{aligned} \begin{array}{lll} \mathbf{X} _{\mu }=\left( P_{1,\mu }^{b}\right) ^d\cap \mathbf{X} ,\\ \text{ M }_{\mu }=\{q\in C^{0}\left( {\bar{\Omega }}\right) \cap \text{ M }: q|_{K}\in P_{1}(K), ~\forall K \in \tau _{\mu }\},\\ \mathbf{W} _{\mu }=\left( P_{1,\mu }^{b}\right) ^d\cap \mathbf{W} , \end{array} \end{aligned}$$where \(P_{1,\mu }^{b}=\{v_{\mu }\in C^{0}({\bar{\Omega }}): v_{\mu }|_{K}\in P_{1}(K)\oplus span\{{\hat{b}}\},~\forall K\in \tau _{\mu }\}\), \({\hat{b}}\) is a bubble function.
The following properties of \({\mathcal {P}}_{1}\) and \({\mathcal {P}}_{2}\) are stated in [9, 22, 32, 34, 35].
Lemma 3.1
The finite element pair \({\mathcal {P}}_{1}\) satisfies the key relation
Besides, there exists mappings \(\pi _{\mu }: H^2(\Omega )^d\cap \mathbf{X} \rightarrow \mathbf{X} _{\mu }\) and \(\rho _{\mu }: \text{ M }\rightarrow \text{ M }_{\mu }\) satisfy
for all \(\mathbf{v} \in H^{2}(\Omega )^{d}\cap \mathbf{X} \), \(q\in H^{1}(\Omega )\cap \text{ M }\), and a mapping \(R_{\mu }:H^{2}(\Omega )^d\cap \mathbf{V} _{n}\rightarrow \mathbf{W} _{\mu }\) satisfy
Lemma 3.2
The finite element pair \({\mathcal {P}}_{2}\) satisfies the discrete inf-sup condition
Besides, there exists mappings \(\pi _{\mu }:H^{2}(\Omega )^d\cap \mathbf{X} \rightarrow \mathbf{X} _{\mu }\), \(\rho _{\mu }:\text{ M }\rightarrow \text{ M }_{\mu }\) satisfy (21) and
And mapping \(R_{\mu }: H^{2}(\Omega )^d\cap \mathbf{V} _{n}\rightarrow \mathbf{W} _{\mu }\) satisfies (22).
Then, the penalty finite element discretization of (6) is: find \(((\mathbf{u }_{\epsilon \mu },\mathbf{B }_{\epsilon \mu }),p_{\epsilon \mu })\in \mathbf{W} _{0n}^{\mu }\times \text{ M }_{\mu }\) such that
Recalling the following stability and optimal error estimate (see [16]).
Theorem 3.1
Under the assumptions of Theorem 2.2 and if \(\text{ X }_{\mu }\times \text{ M }_{\mu }\) satisfies property \({\mathcal {P}}_{k}\), \(k=1,2\), then (25) admits a unique solution \(((\mathbf{u }_{\epsilon \mu },\mathbf{B }_{\epsilon \mu }),p_{\epsilon \mu })\in \mathbf{W} _{0n}^{\mu }\times \text{ M }_{\mu } \) such that
Theorem 3.2
Under the assumptions of Theorem 2.2 and if \(\text{ X }_{\mu }\times \text{ M }_{\mu }\) satisfies property \({\mathcal {P}}_{k}\), \(k=1,2\) and assume that \(\mu \le \left( \frac{\Vert \mathbf{F }\Vert _{-1}}{\Vert \mathbf{F }\Vert _{0}}\right) ^{\frac{1}{2}}(1-\sigma )\), then we have the following error estimate
for \({\mathcal {P}}_{1}\) and \({\mathcal {P}}_{2}\), respectively.
Remark 3.1
On account of the important relation (20), the discrete penalty finite element form for \({\mathcal {P}}_{1}\) can be defined as follows
But the finite element space \(\mathbf{X} _{h}\times M_{h}\) for \({\mathcal {P}}_{2}\) does not have property (20). Therefore, we have to employ the projection \(\rho _{\mu }\) to rewrite the penalty finite element discretization as
Then, the dimension of the stiffness matrix reduces greatly and leads to a relatively small definite positive stiffness matrix. However, it is very difficult to compute \(\rho _{\mu }\text{ div }\mathbf{v} \) for the functions in \(M_{\mu }\) are globally discontinuous and \(\rho _{\mu }\) is a local projection operator, which acting separately element by element (refer to [33] for details).
4 Penalty Iterative Methods for the 2D/3D Stationary MHD Equations
The Oseen iterative methods in penalty idea which based on finite element pair \({\mathcal {P}}_{1}\) and \({\mathcal {P}}_{2}\) and several two-level schemes are introduced as follows.
Method 0 (Oseen iterative method). Find \(((\mathbf{u }_{\epsilon \mu }^{n},\mathbf{B }_{\epsilon \mu }^{n}),p_{\epsilon \mu }^{n})\in \mathbf{W} ^{\mu }_{0n}\times \text{ M }_{\mu }\) such that for all \(((\mathbf{v} ,\varvec{\Psi }),q)\in \mathbf{W} ^{\mu }_{0n}\times \text{ M }_{\mu }\)
Here, \(((\mathbf{u }_{\epsilon \mu }^{0},\mathbf{B }_{\epsilon \mu }^{0}),p_{\epsilon \mu }^{0})\) is defined by the discrete penalty equation:
for all \(((\mathbf{v} ,\varvec{\Psi }),q)\in \mathbf{W} ^{\mu }_{0n}\times \text{ M }_{\mu }\).
Based on our previous work [16, 17], we have the following stability estimate of the iterative method.
Theorem 4.1
Under the assumptions of Theorem 3.2 and uniqueness condition \(0<\sigma <1\) valid, suppose that \({\mathcal {P}}_{1}\) and \({\mathcal {P}}_{2}\) are valid, then \((\mathbf{u }_{\epsilon \mu }^{m},\mathbf{B }_{\epsilon \mu }^{m})\) and \(p_{\epsilon \mu }^{m}\) defined by the Method 0 satisfy
and satisfy the following error bounds: for \({\mathcal {P}}_{1}\)
and for \({\mathcal {P}}_{2}\)
for all \(m\ge 0\).
4.1 Two-Level Oseen Penalty Iterative Methods
In this section, we consider the two-level Oseen penalty finite element methods under the strong uniqueness condition \(\sigma \le 1-\left( \frac{\Vert \mathbf{F }\Vert _{-1}}{\Vert \mathbf{F }\Vert _{0}}\right) ^{\frac{1}{2}}<1\). The methods includes two algorithms: m iteration steps by Oseen technique on the coarse mesh H and once correction by the three corresponding iteration on the fine mesh h.
Method 1.
Step I. Find a coarse grid penalty iterative solution \(((\mathbf{u} _{\epsilon H}^m,\mathbf{B} _{\epsilon H}^m),p_{\epsilon H}^{m})\in \mathbf{W} _{0n}^{H}\times \text{ M }_{H}\) such that
for \(n=1,2,\ldots ,m\), where \(((\mathbf{u} _{\epsilon H}^0,\mathbf{B} _{\epsilon H}^0),p_{\epsilon H}^{0})\) is determined by
for all \(((\mathbf{v} ,\varvec{\Psi }),q)\in \mathbf{W} _{0n}^{H}\times \text{ M }_{H}\).
Step II. Find a fine grid solution \(((\mathbf{u} _{\epsilon mh},\mathbf{B} _{\epsilon mh}),p_{\epsilon mh})\in \mathbf{W} _{0n}^{h}\times \text{ M }_{h}\) defined by the following Stokes correction.
for all \(((\mathbf{v} ,\varvec{\Psi }),q)\in \mathbf{W} _{0n}^{h}\times \text{ M }_{h}\).
Theorem 4.2
Under the assumptions of Theorem 4.1 and \(\sigma \le 1-\left( \frac{\Vert \mathbf{F }\Vert _{-1}}{\Vert \mathbf{F }\Vert _{0}}\right) ^{\frac{1}{2}}<1\), then \(((\mathbf{u} _{\epsilon mh},\mathbf{B} _{\epsilon mh}),p_{\epsilon mh})\) provided by Method 1 satisfies the following stability and error estimates:
and satisfy the following error bounds: for \({\mathcal {P}}_{1}\)
\(\epsilon \) and H can be taken as \(\epsilon =O(h^{\frac{1}{2}})\), \(H^2=O(\epsilon ^{\frac{1}{2}}h)\) and the convergence rate is \(O(h^{\frac{1}{2}})\); for \({\mathcal {P}}_{2}\), the optimal error estimates are
\(\epsilon \) and H can be taken as \(\epsilon =O(h)\), \(H^2=O(h)\) and the convergence rate is O(h);
Proof
We can arrive at the stability estimate (31) by setting \((\mathbf{v} ,\varvec{\Psi })=(\mathbf{u }_{\epsilon mh},\mathbf{B }_{\epsilon mh})\) and \(q=p_{\epsilon mh}\) in (30) and combining (8)–(10) with (23).
For the error estimate, subtracting (30) from (25) with \(\mu =h\) and take \((\mathbf{e} _{h},\mathbf{b} _{h})=(\mathbf{u} _{\epsilon h}-\mathbf{u} _{\epsilon mh},\mathbf{B} _{\epsilon h}-\mathbf{B} _{\epsilon mh})\), \(\eta _{h}=p_{\epsilon h}-p_{\epsilon mh}\), we have following error equation
Substituting \((\mathbf{v} ,\varvec{\Psi })=(\mathbf{e} _{h},\mathbf{b} _{h})\), \(q=\eta _{h}\) in (32) with (8), (9), (13) and Theorem 3.1, we have
which guarantees that
For \({\mathcal {P}}_{1}\), using Theorems 3.1, 3.2, 4.1 and (34), we derive that
then utilising (33) and Young’s inequality, we deduce
which we can get the error estimate for \({\mathcal {P}}_{1}\).
Combining Theorems 3.2, 4.1 and (34), the bound for \({\mathcal {P}}_{2}\) is
and with (23), (34), (7), (36), Theorems 3.2 and 4.1 , we conclude
We can finish the proof by Theorems 2.3, 3.2 and triangle inequality and some simple calculations. \(\square \)
Method 2.
Step I. Find a coarse grid penalty iterative solution \(((\mathbf{u} _{\epsilon H}^m,\mathbf{B} _{\epsilon H}^m),p_{\epsilon H}^{m})\in \mathbf{W} _{0n}^{H}\times \text{ M }_{H}\) such that
for \(n=1,2,\ldots ,m\), where \(((\mathbf{u} _{\epsilon H}^0,\mathbf{B} _{\epsilon H}^0),p_{\epsilon H}^{0})\) is determined by
for all \(((\mathbf{v} ,\varvec{\Psi }),q)\in \mathbf{W} _{0n}^{H}\times \text{ M }_{H}\).
Step II. Find a fine grid solution \(((\mathbf{u} _{\epsilon mh},\mathbf{B} _{\epsilon mh}),p_{\epsilon mh})\in \mathbf{W} _{0n}^{h}\times \text{ M }_{h}\) defined by the following Newton correction.
for all \(((\mathbf{v} ,\varvec{\Psi }),q)\in \mathbf{W} _{0n}^{h}\times \text{ M }_{h}\).
Theorem 4.3
Under the assumptions of Theorem 4.2, then \(((\mathbf{u} _{\epsilon mh},\mathbf{B} _{\epsilon mh}),p_{\epsilon mh})\) provided by Method 2 with Newton Correction satisfies the following stability and error estimates:
and \(((\mathbf{u} _{\epsilon mh},\mathbf{B} _{\epsilon mh}),p_{\epsilon mh})\) satisfies the following error estimates, for \({\mathcal {P}}_{1}\)
\(\epsilon \) and H can be taken as \(\epsilon =O(h^{\frac{1}{2}})\), \(H^3=O(\epsilon h|\ln h|^{-1})\) and the convergence rate is \(O(h^{\frac{1}{2}})\) in the 2D case; for \({\mathcal {P}}_{2}\), the optimal error estimates are
\(\epsilon \) and H can be taken as \(\epsilon =O(h)\), \(H^3=O( h|\ln h|^{-1})\) and the convergence rate is O(h) in the 2D case; and for \({\mathcal {P}}_{1}\)
\(\epsilon \) and H can be taken as \(\epsilon =O(h^{\frac{1}{2}})\), \(H^\frac{5}{2}=O(\epsilon ^{\frac{3}{4}} h)\) and the convergence rate is \(O(h^{\frac{1}{2}})\) in the 3D case; for \({\mathcal {P}}_{2}\), the optimal error estimates are
\(\epsilon \) and H can be taken as \(\epsilon =O(h)\), \(H^\frac{5}{2}=O( h)\) and the convergence rate is O(h) in the 3D case.
Proof
By choosing \((\mathbf{v} ,\varvec{\Psi })=(\mathbf{u} _{\epsilon mh},\mathbf{B} _{\epsilon mh})\) and \(q=p_{\epsilon mh}\) in (40), we derive that
which combining Young’s inequality guarantees that
For \({\mathcal {P}}_{1}\), from (42), (43) and Young’s inequality, we have
which is that
Apply the similar technique used in Theorem 4.2, we have the following estimate for \({\mathcal {P}}_{2}\)
Next, we will give the bounds of error estimate.
Subtracting (40) from (25) with \(\mu =h\), we have
Take \((\mathbf{v} ,\varvec{\Psi })=(\mathbf{e} _{h},\mathbf{b} _{h})\), \(q=\eta _{h}\) in (47), with (8), (9), (13) and Theorem 3.1, we have
which is that
For \({\mathcal {P}}_{1}\), from (49), Theorems 3.2 and 4.1 , we have
and with (48) and (50), we have
with some simple calculations, we complete the proof of the estimate for \({\mathcal {P}}_{1}\).
And for \({\mathcal {P}}_{2}\), from (49), Theorems 3.2 and 4.1, we have
and with (23), (34), (7), (36), Theorems 3.2 and 4.1, we deduce that
On the other hand, in the 2D case, applying the inverse inequality
in the estimate of the trilinear term, from (53), Theorems 3.2 and 4.1, we derive that
For \({\mathcal {P}}_{1}\), with (55), Theorems 3.2 and 4.1, we have
and with (56), we have
which is that
And for \({\mathcal {P}}_{2}\), from Theorems 3.2, 4.1 and (55), we have
and with (23), (7), (57), Theorems 3.2 and 4.1, we deduce that
Then, we complete the proof. \(\square \)
Method 3.
Step I. Find a coarse grid penalty iterative solution \(((\mathbf{u} _{\epsilon H}^m,\mathbf{B} _{\epsilon H}^m),p_{\epsilon H}^{m})\in \mathbf{W} _{0n}^{H}\times \text{ M }_{H}\) such that
for \(n=1,2,\ldots ,m\), where \(((\mathbf{u} _{\epsilon H}^0,\mathbf{B} _{\epsilon H}^0),p_{\epsilon H}^{0})\) is determined by
for all \(((\mathbf{v} ,\varvec{\Psi }),q)\in \mathbf{W} _{0n}^{H}\times \text{ M }_{H}\).
Step II. Find a fine grid solution \(((\mathbf{u} _{\epsilon mh},\mathbf{B} _{\epsilon mh}),p_{\epsilon mh})\in \mathbf{W} _{0n}^{h}\times \text{ M }_{h}\) defined by the following Oseen correction.
for all \(((\mathbf{v} ,\varvec{\Psi }),q)\in \mathbf{W} _{0n}^{h}\times \text{ M }_{h}\).
Theorem 4.4
Under the assumptions of Theorem 4.2, then \(((\mathbf{u} _{\epsilon mh},\mathbf{B} _{\epsilon mh}),p_{\epsilon mh})\) provided by Method 3 satisfies the following stability and error estimates:
and satisfy the following bounds:
\(\epsilon \) and H can be taken as \(\epsilon =O(h^{\frac{1}{2}})\), \(H^2=O(\epsilon ^{\frac{1}{2}}h)\) and the convergence rate is \(O(h^{\frac{1}{2}})\); for \({\mathcal {P}}_{2}\), the optimal error estimates are
\(\epsilon \) and H can be taken as \(\epsilon =O(h)\), \(H^2=O(h)\) and the convergence rate is O(h);
Proof
We can finish the proof by the similar technique used in Theorem 4.2. \(\square \)
Besides, from Theorems 4.2, 4.3 and 4.4, the comparison of the proposed schemes can be concluded by:
Remark 4.1
From finite element space discretization point of view, the theoretical results always about the penalty parameter for the methods which based on \({\mathcal {P}}_{1}\) discretization, while the choice of coarse mesh for the methods which based on \({\mathcal {P}}_{2}\) discretization have no relationship with the penalty parameter. The inf-sup condition is the main reason.
Remark 4.2
In terms of convergence rate, Method 1 and Method 3 have linear convergence rate with respect to \(\Vert |(\mathbf{u} _{\epsilon H}-\mathbf{u} _{\epsilon H}^{m},\mathbf{B} _{\epsilon H}-\mathbf{B} _{\epsilon H}^{m})\Vert |_{1}\). But Method 2 has the second convergence rate. Besides, the classical iterative solver can be applied to Method 1 for it’s invariant stiffness matrix. However, GMERES is a better choice for Method 2 and 3 for their variable stiffness matrix.
5 Numerical Results
In this section, we present several numerical examples to verify the numerical performance of the above presented methods. The penalty parameter \(\epsilon \) is selected as \(\epsilon =O(h^{\frac{1}{2}})\) for \({\mathcal {P}}_{1}\) and \(\epsilon =O(h)\) for \({\mathcal {P}}_{2}\) based on Theorems 4.2–4.4 in all the following numerical tests. The iterative tolerance is set as \(10^{-10}\) for numerical implementations.
5.1 Problems with Smooth Solutions
A smooth solution benchmark problem is presented to verify the convergence performance in the square domain \(\Omega =[0,1]^d\), \(d=2,3\) in this case. The exact solutions are given by
for \(d=2\) and
for \(d=3\). Here, \(\alpha \) is chosen such that \(0<\sigma <1\). The body forces \(\mathbf{f} \), \(\mathbf{g} \) are determined accordingly for any \(R_{e}\), \(R_{m}\) and \(S_{c}\).
Tables 1 and 2 present the value of \(\sigma \) with different \(\alpha \). And we use the gradually increasing \(\alpha \) to modify the value of \(\sigma \) in this part. From the detail of numerical analysis of Theorems 4.2–4.4, it is known that \(\sigma ^ m\) or \(\sigma ^{2m}\) come from the estimates given in Theorem 4.1. And it is difficult to obtain the relations between the error estimates and \(\sigma \) for the fast decaying of \(\sigma ^ m\) or \(\sigma ^{2m}\). In Fig. 1, 2, we can see that there exists a linear relation between \(\log (\Vert |(\mathbf{e} ^m,\mathbf{b} ^m)\Vert |)\) and iterative step m, which is consistent with the theoretical analysis.
Tables 1, 2, 3, 4, 5 and 6 present the numerical results of relative error and CPU time for uniform refinement. The comparisons indicate that the relative error are almost the same with the same finite element pair for different methods. And the relative errors of \(P_{1}b-P_{1}-P_{1}b\) element is smaller than \(P_{1}-P_{0}-P_{1}\) one with decrease of mesh size h. The convergence rate investigations are in good agreement with the theoretical analysis in Theorems 4.1–4.4. Specifically, the convergence rate of \(\mathbf{B }\) for \(P_{1}-P_{0}-P_{1}\) element pair can reach O(h), it is even higher than the theoretical result \(O(h^{1/2})\). Furthermore, all the given schemes remain much the same property (i.e. \(\text{ div }\mathbf{u }=0\), \(\text{ div }\mathbf{B }=0\)) as the original equations.
Then, it can be seen clearly that the computational speed of method \(M_{1}\) with \(P_{1}-P_{0}-P_{1}\) element is fastest and method \(M_{2}\) with \(P_{1}b-P_{1}-P_{1}b\) element leads to the slowest one. Since, the complexity of the discretization of the nonlinear terms and the order of the finite element pair are the main causes.
The final issue is to validate the effectiveness of the proposed methods for different parameter \(\alpha \). A comparison of Figs. 3, 4, 5 and 6 with gradually increasing \(\alpha \) reveal that the precision of \(M_{2}\) with \(P_{1}b-P_{1}-P_{1}b\) element is best and \(M_{1}\) with \(P_{1}-P_{0}-P_{1}\) element is the worst. That is to say, method \(M_{2}\) with \(P_{1}b-P_{1}-P_{1}b\) element has good adaptation for relatively large \(\sigma \).
5.2 Hartman Flow
Here we explore both 2D and 3D Hartmann flow with \(Ha=\sqrt{R_{e}R_{m}S_{c}}\). For 2D, we treat a steady undirectional flow in the channel \(\Omega =[0,10]\times [-1,1]\) under the influence of the transverse magnetic field \(B_{0}=(0,1)\). The analytical solutions are:
with
We impose the following boundary conditions:
where \(p_{d}(x,y)=p(x,y)\), \(p_{0}\) is a constant and \(\mathbf{I }\) is identity matrix. Whilst, 3D Hartmann flow in a rectangular duct \(\Omega =[0,L]\times [-y_{0},y_{0}]\times [-z_{0},z_{0}]\) with \(L=10, y_{0}=2, z_{0}=1\) under the influence of a magnetic field \(\mathbf{B} _{d}=(0,1,0)\) has the following form
with
where
the boundary conditions are imposed by
In this part, we only consider the \(P_{1}b-P_{1}-P_{1}b\) element for its high precision and take \(G=0.1\). The first observation is in the scope of the Hartmann number Ha with the presented methods. From the structure of algorithm \(M_{1}\)-\(M_3\), we observe that the first step of these methods dominate the adaptivity of Hartmann number. Then, we make a comparison with the penalty Newton iteration, Stokes iteration and \(M_{0}\), which described in our previous work [16]. And we choose the following three cases to simulate 2D problem:
and choose the following three cases to simulate 3D problem:
As can be seen from Figs. 7 and 8, method \(M_{0}\) can deal with relatively large Hartmann number and Stokes iteration is only suitable for small Hartmann number. The primary cause is the limitation of uniqueness condition.
One final observation is in accuracy. Figure 9 depict the analytical solutions of the first component u(y) and B(y) along with numerical ones \(u(y_{k})\) and \(B(y_{k})\) (\(y_{k}=-1+0.1k,~k=0,\ldots ,20\)) obtained by scheme \(M_{1}-M_{3}\) with \(Ha=10\)\((R_{e}=5,R_{m}=5,S_{c}=4)\) and \(Ha=100\)\((R_{e}=100,R_{m}=10,S_{c}=10)\) for the 2D problem. And the analytical solutions of the first component u(y, z) and B(y, z) along with numerical ones \(u(y_{k},0)\) and \(B(y_{k},0)\) (\(y_{k}=-2+0.1k,~k=0,\ldots ,40\)) with \(Ha=1\)\((R_{e}=1,R_{m}=0.1,S_{c}=10)\) and \(Ha=10\)\((R_{e}=10,R_{m}=1,S_{c}=10)\) for the 3D problem are shown in Fig. 10. It shows that the methods presented in this paper can achieve the desired results for different Hartmann numbers.
5.3 Driven Cavity Flow
In this example, we consider a 2D/3D driven cavity flow which used in fluid dynamics with the implementation domain \(\Omega =(-1,1)^{d}, d=2\) and \(\Omega =(0,1)^{3}, d=3\), and set the source terms to be zero. The boundary conditions are prescribed as follows:
where \(\mathbf{B }_{D}=(1,0)\) for \(d=2\);
where \(\mathbf{B }_{D}=(1,0,0)\) for \(d=3\).
In this subsection, we mainly take a further investigation on the effectiveness for the classical benchmark problem with different parameters. We set \(R_{e}\in \{1,5\cdot 10^2,6\cdot 10^3\}\), \(R_{m}\in \{10^{-2},1,10\}\), \(S_{c}\in \{1,10^3,10^6\}\) and \(R_{e}\in \{1,10^2,3\cdot 10^2\}\), \(R_{m}\in \{10^{-2},1,20\}\), \(S_{c}\in \{1,10^2,5\cdot 10^2\}\) for 2D and 3D case, respectively. And we only consider \(M_{2}\) with \(P_{1}b-P_{1}-P_{1}b\) element in this part.
The numerical results of horizontal velocity, pressure and magnetic field distribution at the mid-width for various \(R_{e}\), \(R_{m}\) and \(S_{c}\) are shown in Figs. 11, 12 13, 17, 18 and 19. It shows that the numerical results have an excellent agreement with the standard two-level Oseen iterative method. Figures 14, 15, 16, 20, 21 and 22 describe the numerical streamline of the cavity flow for different hydrodynamic Reynolds numbers, magnetic Reynolds numbers and coupling coefficients. It is observed that the velocity main vortex turns into several small ones and become more complex with the increase of \(R_{e}\). And it shows that more resolved vortexes may captured with the increase of \(S_{c}\). Besides, the velocity vortex remain almost unchanged for different \(R_{m}\).
6 Conclusions
In this paper, we have proposed some two-level Oseen penalty finite element methods with strong uniqueness condition \(\sigma \le 1-\left( \frac{\Vert \mathbf{F }\Vert |_{-1}}{\Vert |\mathbf{F }\Vert _{0}}\right) ^{\frac{1}{2}}<1\) for solving the 2D/3D steady incompressible MHD equations. The main advantage of the presented methods is that they can overcome the incompressible constrain and save large amount of computational time. And we give the rigorous analysis of the stability and optimal error estimate for different finite element pair \({\mathcal {P}}_{1}\) and \({\mathcal {P}}_{2}\) under the penalty parameter \(\epsilon \). Both 2D/3D numerical results illustrated that Method 3 with \(P_{1}b-P_{1}-P_{1}b\) exhibits good performance in terms of adaptability for large \(\sigma \) and high precision. A further study about the 2D/3D non stationary incompressible MHD equations in this direction is in progress.
References
Gerbeau, J., Bris, C., Lelièvre, T.: Mathematical Methods for the Magnetohydrodynamics of Liquid Metals. Numerical Mathematics and Scientific Computation. Oxford University Press, New York (2006)
Gunzburger, M., Meir, A., Peterson, J.: On the existence, uniquess and finite element approximation of solutions of the equations of sationary, incompressible magnetohydrodynamic. Math. Comput. 56, 523–563 (1991)
Moreau, R.: Magneto-Hydrodynamics. Kluwer Academic Publishers, Berlin (1990)
Sermange, M., Temam, R.: Some mathematical questions related to the MHD equations. Commun. Pure Appl. Math. 36, 635–664 (1983)
Hu, K., Ma, Y., Xu, J.: Stable finite element methods preserving \(\nabla \cdot {B}=0\) exactly for MHD models. Numer. Math. 135, 371–396 (2017)
Zhao, J., Mao, S., Zheng, W.: Anisotropic adaptive finite element method for magnetohydrodynamic flow at high Hartmann numbers. Appl. Math. Mech. 37, 1479–1500 (2016)
Li, L., Zheng, W.: A robust solver for the finite element approximation of stationary incompressible MHD equations in 3D. J. Comput. Phys. 351, 254–270 (2017)
Gerbeau, J.: A stabilized finite element method for the incompressible magnetohydrodynamic equations. Numer. Math. 87, 83–111 (2000)
Ravindran, S.: Linear feedback control and approximation for a system governed by unsteady MHD equations. Comput. Methods Appl. Mech. Eng. 198, 524–541 (2008)
Salah, N., Soulaimani, A., Habashi, W.: A finite element method for magnetohydrodynamics. Comput. Methods Appl. Mech. Eng. 190, 5867–5892 (2001)
Meir, A., Schmidt, P.: Analysis and numerical approximation of a stationary MHD flow problem with nonideal boundary. SIAM J. Numer. Anal. 36, 1304–1332 (1999)
Qiu, W., Shi, K.: A mixed DG method and an HDG method for incompressible magnetohydrodynamics. arXiv:1702.01473 [math.NA]
Gao, H., Qiu, W.: A linearized energy preserving finite element method for the dynamical incompressible magnetohydrodynamics equations. arXiv:1801.01252 [math.NA]
Badia, S., Codina, R., Planas, R.: Analysis of an unconditionally convergent stabilized finite element formulation for incompressible magnetohydrodynamics. Arch. Comput. Methods Eng. 22, 621–636 (2015)
Greif, C., Li, D., Schötz, D., Wei, X.: A mixed finite element method with exactly divergence-free velocities for incompressible magnetohydrodynamics. Comput. Method Appl. Mech. Eng. 199, 45–48 (2010)
Su, H., Feng, X., Huang, P.: Iterative methods in penalty finite element discretization for the steady MHD equations. Comput. Method Appl. Mech. Eng. 304, 521–545 (2016)
Su, H., Feng, X., Zhao, J.: Two-level penalty Newton iterative method for the 2D/3D stationary incompressible magnetohydrodynamics equations. J. Sci. Comput. 70(3), 1144–1179 (2017)
Su, H., Mao, S., Feng, X.: Optimal error estimates of penalty based iterative methods for steady incompressible magnetohydrodynamics equations with different viscosities. J. Sci. Comput. 79(2), 1078–1110 (2019)
Shen, J.: On error estimates of some higher order projection and penalty-projection methods for Navier–Stokes equations. Numer. Math. 62, 49–73 (1992)
Shen, J.: On error estimates of the penalty method for unsteady Navier–Stokes equations. SIAM J. Numer. Anal. 32, 386–403 (1995)
He, Y.: Optimal error estimate of the penalty finite element method for the time-dependent Navier–Stokes equations. Math. Comput. 74, 1201–1216 (2005)
He, Y., Li, J., Yang, X.: Two-level penalized finite element methods for the stationary Navier–Stoke equations. Int. J. Inf. Syst. Sci. 2, 131–143 (2006)
An, R., Li, Y.: Error analysis of first-order projection method for time-dependent magnetohydrodynamics equations. Appl. Numer. Math. 112, 167–181 (2017)
Lu, X., Huang, P.: A modular grad-div stabilization for the 2D/3D nonstationary incompressible magnetohydrodynamic equations. J. Sci. Comput. (2020). https://doi.org/10.1007/s10915-019-01114-x
Wu, J., Liu, D., Feng, X., Huang, P.: An efficient two-step algorithm for the stationary incompressible magnetohydrodynamic equations. Appl. Math. Comput. 302, 21–33 (2017)
Wang, L., Li, J., Huang, P.: An efficient two-level algorithm for the 2D/3D stationary incompressible magnetohydrodynamics based on the finite element method. Int. Commun. Heat Mass Transfer 98, 183–190 (2018)
Zhu, T., Su, H., Feng, X.: Some Uzawa-type finite element iterative methods for the steady incompressible magnetohydrodynamic equations. Appl. Math. Comput. 302, 34–47 (2017)
Zhang, Q., Su, H., Feng, X.: A partitioned finite element scheme based on Gauge–Uzawa method for time-dependent MHD equations. Numer. Algorithms 78(1), 277–295 (2018)
Ping, Y., Su, H., Feng, X.: Parallel two-step finite element algorithm for the stationary incompressible magnetohydrodynamic equations. Int. J. Numer. Methods Heat Fluid Flow 29(8), 2709–2727 (2019)
Xu, J.: A novel two two-grid method for semilinear elliptic equations. SIAM J. Sci. Comput. 15, 231–237 (1994)
Xu, J.: Two-grid discretization techniques for linear and nonlinear PDEs. SIAM J. Numer. Anal. 33, 1759–1777 (1996)
Dong, X., He, Y., Zhang, Y.: Convergence analysis of three finite element iterative methods for the 2D/3D stationary incompressible magnetohydrodynamics. Comput. Methods Appl. Mech. Eng. 276, 287–311 (2014)
He, Y.: Two-level method based on fnite element and Crank–Nicolson extrapolation for the time-dependent Navier–Stokes equations. SIAM J. Numer. Anal. 41, 1263–1285 (2003)
Girault, V., Raviart, P.A.: Finite Element Method for Navier–Stokes Equations: Theory and Algorithms. Springer, Berlin (1987)
He, Y., Li, J.: Convergence of three iterative methods based on the finite element discretization for the stationary Navier–Stokes equations. Comput. Methods Appl. Mech. Eng. 198, 1351–1359 (2009)
Acknowledgements
This work is in part supported by the NSF of China (Grant Nos. 11701493) and the GRF of Hong Kong (Grant Nos. 9041980, 9042081)” shoud be replaced by “This work is in part supported by the NSF of Xinjiang Uygur Autonomous Region (Nos. XJEDU2020I001, 2016D01C073, 2019D01C047), the NSF of China (Nos. 11701493, 61962056)”, Tianshan Youth Project of Xinjiang Uygur Autonomous Region (No.2017Q079), 2019 Autonomous Region University Research Program (No.XJEDU2019Y002), the Xinjiang Provincial University Research Foundation of China (No.XJEDU2018I002) and the Matching Projects for Study Abroad of People’s Goverment of Xinjiang Uygur Autonomous Region (No. 2219-51160000313).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work is in part supported by the NSF of China (Grant Nos. 11701493) and the GRF of Hong Kong (Grant Nos. 9041980, 9042081).
Rights and permissions
About this article
Cite this article
Su, H., Feng, X. & Zhao, J. On Two-Level Oseen Penalty Iteration Methods for the 2D/3D Stationary Incompressible Magnetohydronamics. J Sci Comput 83, 11 (2020). https://doi.org/10.1007/s10915-020-01186-0
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10915-020-01186-0
Keywords
- Magnetohydrodynamics equations
- Penalty finite element method
- Two-level method
- Inf-sup condition
- Error estimate