Analysis of a projection method for the Stokes problem using an $\varepsilon$-Stokes approach
Masato Kimura, Kazunori Matsui, Adrian Muntean, Hirofumi Notsu

TL;DR
This paper extends the analysis of an $oldsymbol{ ext{ε}}$-Stokes projection method, connecting Stokes and pressure-Poisson problems, providing convergence, error estimates, and numerical validation for various boundary conditions.
Contribution
It generalizes the $oldsymbol{ ext{ε}}$-Stokes approach to Neumann and mixed boundary conditions, offering new error estimates and insights into asymptotic behavior.
Findings
Solutions converge to Stokes and pressure-Poisson solutions as ε varies.
Error estimates are optimal and improved with Neumann boundary conditions.
Numerical examples confirm theoretical error bounds and asymptotic structure.
Abstract
We generalize pressure boundary conditions of an -Stokes problem. Our -Stokes problem connects the classical Stokes problem and the corresponding pressure-Poisson equation using one parameter . For the Dirichlet boundary condition, it is proven in K. Matsui and A. Muntean (2018) that the solution for the -Stokes problem converges to the one for the Stokes problem as tends to 0, and to the one for the pressure-Poisson problem as tends to . Here, we extend these results to the Neumann and mixed boundary conditions. We also establish error estimates in suitable norms between the solutions to the -Stokes problem, the pressure-Poisson problem and the Stokes problem, respectively. Several numerical examples are provided to show that several such error estimates are optimal in .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNavier-Stokes equation solutions · Advanced Numerical Methods in Computational Mathematics · Computational Fluid Dynamics and Aerodynamics
∎
11institutetext: Masato Kimura22institutetext: Faculty of Mathematics and Physics, Kanazawa University, Kanazawa 920-1192, Japan. 33institutetext: Kazunori Matsui (Corresponding author)44institutetext: Division of Mathematical and Physical Sciences,
Graduate School of Natural Science and Technology, Kanazawa University,
Kanazawa 920-1192, Japan,
44email: [email protected] 55institutetext: Adrian Muntean 66institutetext: Department of Mathematics and Computer Science, Karlstad University,
Universitetsgatan 2, 651 88 Karlstad Sweden. 77institutetext: Hirofumi Notsu 88institutetext: Faculty of Mathematics and Physics, Kanazawa University, Kanazawa 920-1192, Japan,
Japan Science and Technology Agency, PRESTO, Kawaguchi 332-0012, Japan.
Analysis of a projection method for the Stokes problem
using an -Stokes approach
Masato Kimura
Kazunori Matsui
Adrian Muntean
Hirofumi Notsu
Abstract
We generalize pressure boundary conditions of an -Stokes problem. Our -Stokes problem connects the classical Stokes problem and the corresponding pressure-Poisson equation using one parameter . For the Dirichlet boundary condition, it is proven in K. Matsui and A. Muntean (2018) that the solution for the -Stokes problem converges to the one for the Stokes problem as tends to 0, and to the one for the pressure-Poisson problem as tends to . Here, we extend these results to the Neumann and mixed boundary conditions. We also establish error estimates in suitable norms between the solutions to the -Stokes problem, the pressure-Poisson problem and the Stokes problem, respectively. Several numerical examples are provided to show that several such error estimates are optimal in . Our error estimates are improved if one uses the Neumann boundary conditions. In addition, we show that the solution to the -Stokes problem has a nice asymptotic structure.
Keywords:
Stokes problem Pressure-Poisson equation Asymptotic analysis Finite element method
MSC:
76D03 35Q35 35B40 65N30
1 Introduction
Let be a bounded domain in with Lipschitz continuous boundary and let be a given applied force field and be a given Dirichlet boundary data satisfying , where is the unit outward normal vector on . A strong form of the Stokes problem is given as follows. Find u_{\mbox{\tinyS}}:\Omega\rightarrow{\mathbb{R}}^{n} and p_{\mbox{\tinyS}}:\Omega\rightarrow{\mathbb{R}} such that
[TABLE]
where u_{\mbox{\tinyS}} and p_{\mbox{\tinyS}} are the velocity and the pressure of the flow governed by (S), respectively. We refer to Temam for the details on the Stokes problem (i.e., physical background and corresponding mathematical analysis). Taking the divergence of the first equation, we obtain
[TABLE]
This equation is often called the pressure-Poisson equation and is used in numerical schemes such as MAC (marker and cell), SMAC (simplified MAC) and the projection methods (see, e.g., Amsden_Harlow ; Chorin68 ; Cummins_Rudman ; Guermond ; mac1 ; Kim_Moin ; mac2 ; Perot ). Based on the above, we consider a similar problem. Find u_{\mbox{\tinyP!P}}:\Omega\rightarrow{\mathbb{R}}^{n} and p_{\mbox{\tinyP!P}}:\Omega\rightarrow{\mathbb{R}} satisfying
[TABLE]
We call this problem the pressure-Poisson problem. The idea of using (1.5) instead of {\operatorname{div}}u_{\mbox{\tinyS}}=0 is useful for calculating the pressure numerically in the Navier–Stokes equation. For example, this idea is used in MAC, SMAC and projection methods. The Dirichlet boundary condition for the pressure is used in an outflow boundary Chan_Street ; Viecelli . See also Conca_etc94 ; Conca_etc95 ; Marusic .
We introduce an “interpolation” between problems (S) and (PP). For , find and such that
[TABLE]
This problem is called the -Stokes problem (ES) in prev . In Douglas_Wang ; Glowinski ; Hughes , the authors treat this problem as an approximation of the Stokes problem to avoid numerical instabilities. The -Stokes problem approximates the Stokes problem (S) as and the pressure-Poisson problem (PP) as (Fig. 1). It is shown in prev that if p_{\mbox{\tinyS}}\in{H^{1}(\Omega)} then there exists a constant independent of such that
[TABLE]
where is the standard trace operator Girault . From the first inequality, if we have a good prediction value for pressure on , then u_{\mbox{\tinyP!P}} is a good approximation of u_{\mbox{\tinyS}}. Moreover, is also a good approximation of u_{\mbox{\tinyS}} from the second inequality.
Next we specify the boundary conditions for p_{\mbox{\tinyP!P}} and . We assume that the boundary is a union of two open subsets and such that
[TABLE]
and number of connected components of and with respect to the relative topology of are finite. We consider a Neumann boundary condition (1.16) and a mixed boundary condition (1.21),
[TABLE]
[TABLE]
where and satisfying are given boundary data.
In prev , the authors impose Dirichlet boundary conditions for p_{\mbox{\tinyP!P}} and (i.e., (1.21) with and .) For such boundary conditions, they introduce a weak solution to the -Stokes problem (ES) and prove that strongly converges in to a weak solution to the pressure-Poisson problem (PP) as and weakly converges in to a weak solution (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}}) to the Stokes problem (S) as . Moreover, if p_{\mbox{\tinyS}}\in{H^{1}(\Omega)}, then strong convergence of to (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}}) as holds.
In this paper, we generalize the Dirichlet boundary condition of p_{\mbox{\tinyP!P}} and to both the Neumann boundary condition (1.16) and the mixed boundary condition (1.21), and prove the corresponding convergence result (see Theorem 3.1, 4.2 and 4.3). Since the mixed boundary condition for pressure often appears in engineering problems, this generalization of the boundary conditions for pressure is important. In addition, for the Neumann boundary condition, we estimate the error between the weak solutions to (ES) and (S) provided p_{\mbox{\tinyS}}\in{H^{1}(\Omega)}. We also give an asymptotic expansion for the weak solution to (ES). We furthermore check this convergence result using numerical computations.
The organization of this paper is as follows. In Section 2 we introduce the notation used in this work and the weak form of these problems. We also prove the well-posedness of the problems (PP) and (ES) and show some their properties. In Section 3 we study that the solution to (ES) converges to the solution to (PP) in the strong topology as . We also explore here the structure of the regular perturbation asymptotics. Section 4 is devoted to proving that the solution to (ES) converges to the solution to (S) in the weak and strong topology as . Finally, in Section 5, we show several numerical examples of these problems. The numerical errors between the problems (ES) and (PP), and between the problems (ES) and (S) using the P2/P1 finite element method. Proofs for several theorems which are similar to ones in prev are described.
2 Well-posedness
In this section, we introduce the notation and the weak form of the problems (S), (PP) and (ES), and prove their well-posedness. We give estimates between these solutions by using a pressure error on the boundary .
2.1 Notation
We set
[TABLE]
For , is equipped with the dual norm
[TABLE]
where
[TABLE]
Let be a closed subspace such that there exists a constant for which for all . The dual space is equipped with the norm
[TABLE]
for , where
[TABLE]
We define
[TABLE]
for all , where is the volume of .
2.2 Preliminary results
Let be the standard trace operator. The trace operator is surjective and satisfies (Girault, , Theorem 1.5). Let be the unit outward normal for . Since is a unit vector, is a linear continuous map. For all and , the following Gauss divergence formula holds:
[TABLE]
We recall the following four embedding theorems which plays an important role in the proof of the existence of pressure solutions to the Stokes problem. For the proof of Theorem 2.1, see (Necas, , Lemma 7.1) and (Duvaut, , Theorem 3.2 and Remark 3.1).
Theorem 2.1
There exists a constant such that
[TABLE]
for all .
The following result follows from Theorem 2.1.
Theorem 2.2
(Girault, , Corollary 2.1, 2∘)* There exists a constant such that*
[TABLE]
for all .
The following two embedding theorems are often called the Poincaré inequality.
Theorem 2.3
(Necas, , Theorem 7.8)* There exists a constant such that*
[TABLE]
for all .
Theorem 2.4
(Girault, , Lemma 3.1)* There exists a constant such that*
[TABLE]
for all .
2.3 Weak formulations of the problems (PP), (S) and (ES)
We assume the following conditions for and :
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We start by defining the weak solution to (S). For all , we obtain from the first equation of (S) that
[TABLE]
Using this expression, the weak form of the Stokes problem becomes as follows: Find u_{\mbox{\tinyS}}\in{H^{1}(\Omega)}^{n} and p_{\mbox{\tinyS}}\in{L^{2}(\Omega)}/{\mathbb{R}} such that
[TABLE]
Next, we define the weak formulations of (PP) and (ES) first for the Neumann boundary condition (1.16) and them for the mixed boundary condition (1.21). After that, we define generalized weak formulations for (PP) and (ES) which cover both cases.
First, we apply the Neumann boundary condition (1.16) for (PP) and (ES). We take a test function . From the second equation of (PP), we obtain
[TABLE]
Hence,
[TABLE]
We note that for all by (2.24). Therefore, the weak form of the pressure-Poisson problem with the Neumann boundary condition (1.16) becomes as follows. Find u_{\mbox{\tinyP!P}}\in{H^{1}(\Omega)}^{n} and p_{\mbox{\tinyP!P}}\in{H^{1}(\Omega)}/{\mathbb{R}} such that
[TABLE]
where such that .
The weak form of (ES) with the Neumann boundary condition can be defined similarly to that of (PP). Find and such that
[TABLE]
Secondly, we apply the mixed boundary condition (1.21) for (PP) and (ES). We take a test function . From the second equation of (PP), we obtain
[TABLE]
Hence,
[TABLE]
The weak form of the pressure-Poisson problem with the mixed boundary condition (1.21) becomes as follows. Find u_{\mbox{\tinyP!P}}\in{H^{1}(\Omega)}^{n} and p_{\mbox{\tinyP!P}}\in{H^{1}(\Omega)} such that
[TABLE]
where such that
[TABLE]
for . The weak form of (ES) with the mixed boundary condition (1.21) can be defined similarly to that of (PP). It reads as follows. Find and such that
[TABLE]
Finally, we generalize (PP1) and (PP2) to an abstract pressure-Poisson problem. Let be a closed subspace as defined in Section 2.1. Find u_{\mbox{\tinyP!P}}\in{H^{1}(\Omega)}^{n} and p_{\mbox{\tinyP!P}}\in Q such that
[TABLE]
with . Indeed, by Theorem 2.3 and 2.4, we obtain (PP1) from (PP’) by putting and . Similarly, we obtain (PP2) from (PP’) by putting and .
We generalize (ES1) and (ES2) to an abstract -Stokes problem. Find and such that
[TABLE]
Indeed, by Theorem 2.3, 2.4, we obtain (ES1) from (ES’) by putting and . Similarly, we also obtain (ES2) from (ES’) by putting and .
2.4 Well-posedness of (S’), (PP’) and (ES’)
We show the well-posedness of problems (S’), (PP’) and (ES’) in Theorem 2.5, 2.6 and 2.7.
Theorem 2.5
Under the condition (2.22), there exists a unique solution
(u_{\mbox{\tinyS}},p_{\mbox{\tinyS}})\in{H^{1}(\Omega)}^{n}\times({L^{2}(\Omega)}/{\mathbb{R}})* satisfying (S’).*
See (Temam, , Theorem 2.4 and Remark 2.5) for the proof.
Theorem 2.6
Under the condition (2.22) and (2.25), for , there exists a unique solution (u_{\mbox{\tinyP!P}},p_{\mbox{\tinyP!P}})\in{H^{1}(\Omega)}^{n}\times Q satisfying (PP’).
Proof. Using the Lax–Milgram theorem, since is a continuous and coercive bilinear form, p_{\mbox{\tinyP!P}}\in{H^{1}(\Omega)} is uniquely determined from the second and fourth equations of (PP’). Then u_{\mbox{\tinyP!P}}\in{H^{1}(\Omega)}^{n} is also uniquely determined from the first and third equations, again using the Lax–Milgram theorem. ∎
Theorem 2.7
Under the condition (2.22) and (2.25), for and , there exists a unique solution satisfying (ES’).
This is a generalization of Theorem 2.6 in prev . See Appendix Appendix for the proof.
From now on, let the solutions of (S’), (PP’) and (ES’) be denoted by (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}}),(u_{\mbox{\tinyP!P}},p_{\mbox{\tinyP!P}}) and , respectively. We show their properties in connection with a pressure error on the boundary .
Proposition 2.8
*Suppose that p_{\mbox{\tinyS}}\in{H^{1}(\Omega)}, and
for all . Then there exists a constant independent of such that*
[TABLE]
In particular, if \gamma_{0}p_{\mbox{\tinyS}}=\gamma_{0}p_{\mbox{\tinyP!P}}, then (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}})=(u_{\mbox{\tinyP!P}},p_{\mbox{\tinyP!P}})=(u_{\varepsilon},p_{\varepsilon}) holds for all .
This is a generalization of Proposition 2.7 in prev . See Appendix A for the proof.
Since , Proposition 2.8 does not apply directly for the case of the Neumann boundary condition (1.16). However, we add natural assumptions, then it leads to (2.60).
Proposition 2.9
Suppose that p_{\mbox{\tinyS}}\in{H^{1}(\Omega)}, . If is such that and for all , then we have (2.60).
Proof. Since satisfies for all , it holds that
[TABLE]
for all from the second equation of (PP’). Hence, it leads the second equation of (.10). Using the proof of Proposition 2.8, we obtain (2.60). ∎
3 Links between (ES) and (PP)
as guaranteed by Theorem 2.5, 2.6 and 2.7. In this section, we show that converges to (u_{\mbox{\tinyP!P}},p_{\mbox{\tinyP!P}}) strongly in as . We also treat the case of the regular perturbation asymptotics by exploring the structure of the lower order terms and their effect on the convergence rate.
3.1 Convergence as
We use the following Lemma 3.1 for the proofs of the theorems in this section.
Lemma 3.1
Let and satisfy
[TABLE]
for an arbitrarily fixed . Then there exists a constant such that
[TABLE]
Proof. Putting and and adding two equations of (3.63), we obtain
[TABLE]
where we have used . Thus
[TABLE]
In addition, from the first equation of (3.63) by putting , we have
[TABLE]
and then
[TABLE]
∎
Using Lemma 3.1, we obtain Theorem 3.2.
Theorem 3.2
There exists a constant independent of such that
[TABLE]
for all . In particular, we have
[TABLE]
Proof. Combining (PP’) and (ES’), we obtain
[TABLE]
where v_{\varepsilon}:=u_{\varepsilon}-u_{\mbox{\tinyP!P}},q_{\varepsilon}:=p_{\varepsilon}-p_{\mbox{\tinyP!P}} and h:={\operatorname{div}}u_{\mbox{\tinyP!P}}. By Lemma 3.1, we conclude the proof. ∎
Corollary 3.3
If u_{\mbox{\tinyP!P}} satisfies {\operatorname{div}}u_{\mbox{\tinyP!P}}=0, then u_{\varepsilon}=u_{\mbox{\tinyP!P}} and p_{\varepsilon}=p_{\mbox{\tinyP!P}} hold for all . Furthermore, u_{\mbox{\tinyS}}=u_{\varepsilon}=u_{\mbox{\tinyP!P}} and p_{\mbox{\tinyS}}=[p_{\varepsilon}]=[p_{\mbox{\tinyP!P}}] hold for all .
3.2 Regular Perturbation Asymptotics
By Theorem 3.2, we have that \|\varepsilon(u_{\varepsilon}-u_{\mbox{\tinyP!P}})\|_{{H^{1}(\Omega)}^{n}}\leq c and \|\varepsilon(p_{\varepsilon}-p_{\mbox{\tinyP!P}})\|_{H^{1}(\Omega)}\leq c for all . It implies that there exists a subsequence of (\varepsilon(u_{\varepsilon}-u_{\mbox{\tinyP!P}}),\varepsilon(p_{\varepsilon}-p_{\mbox{\tinyP!P}})) which converges weakly to if . The next theorem states properties of the limit functions and .
Theorem 3.4
Let v^{(1)}_{\varepsilon}:=\varepsilon(u_{\varepsilon}-u_{\mbox{\tinyP!P}})\in{H^{1}_{0}(\Omega)}^{n},q^{(1)}_{\varepsilon}:=\varepsilon(p_{\varepsilon}-p_{\mbox{\tinyP!P}})\in Q and let satisfy
[TABLE]
Then there exists a constant independent of such that
[TABLE]
Proof. The existence and the uniqueness of the pair as a solution to (3.69) follows from Theorem 2.6. As in (3.66), we have
[TABLE]
Subtracting (3.69) from (3.72), it holds that
[TABLE]
Hence,
[TABLE]
where and . By Lemma 3.1 , we have
[TABLE]
for all . ∎
Next, we generalize Theorem 3.4 to the following theorem:
Theorem 3.5
Let be arbitrary () and let v^{(0)}:=u_{\mbox{\tinyP!P}}. If functions and satisfy
[TABLE]
for all , then there exists a constant independent of satisfying
[TABLE]
Proof. Let satisfy
[TABLE]
Subtracting (3.75) from (3.78), it holds that
[TABLE]
Setting and , we obtain from Lemma 3.1 that the estimates
[TABLE]
hold for all . In particular, putting , we obtain
[TABLE]
[TABLE]
for all . By the uniqueness of the solution to (ES’) in Theorem 2.7, it leads that for all , and thus
[TABLE]
[TABLE]
Hence it holds that
[TABLE]
∎
Remark 3.6
Theorem 3.5 can be interpreted from the operator theory.
Let be equipped with norms
[TABLE]
for , and let and be
[TABLE]
Then (u_{\mbox{\tinyP!P}},p_{\mbox{\tinyP!P}}) and satisfy
[TABLE]
where . We have for an arbitrary by the analogy of Theorem 2.6 () and Theorem 2.7 (). Equation (3.75) states that
[TABLE]
for , i.e.
[TABLE]
By Theorem 3.5, there exists a constant such that
[TABLE]
for all .
4 Convergence of (ES) to (S)
In this section, we show that converges to (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}}) weakly in as . Moreover, if p_{\mbox{\tinyS}}\in{H^{1}(\Omega)}, then converges to (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}}) strongly in as .
The outline of the proof of our convergence results (Theorem 4.2, 4.3 and 4.4) is as follows. First, we prove the boundedness of the sequence in . By the reflexivity of , the sequence has a subsequence converging weakly in . In the end, we show that the limit pair of functions satisfies (S’).
We start this section with a useful lemma.
Lemma 4.1
If and satisfy
[TABLE]
then there exists a constant such that
[TABLE]
Proof. Let be the constant from Theorem 2.2. Then we obtain
[TABLE]
∎
Theorem 4.2
There exists a constant independent of such that
[TABLE]
Furthermore, if , then we obtain
[TABLE]
See Appendix A for the proof.
If we add a regularity assumption of p_{\mbox{\tinyS}}, then converges strongly in
Theorem 4.3
Suppose that p_{\mbox{\tinyS}}\in{H^{1}(\Omega)}. Then we obtain
[TABLE]
See Appendix A for the proof.
Theorem 4.3 does not give the convergence rate. If (corresponding to the Neumann boundary condition (1.16)), then the convergence rate becomes .
Theorem 4.4
Suppose that and p_{\mbox{\tinyS}}\in{H^{1}(\Omega)}. Then there exists a constant independent of such that
[TABLE]
Proof. We obtain from (ES’) and (S’) that
[TABLE]
Putting \varphi:=u_{\varepsilon}-u_{\mbox{\tinyS}}\in{H^{1}_{0}(\Omega)}^{n} and \psi:=p_{\varepsilon}-p_{\mbox{\tinyS}}\in{H^{1}(\Omega)}/{\mathbb{R}}, we get
[TABLE]
Subtracting \varepsilon\int_{\Omega}\nabla p_{\mbox{\tinyS}}\cdot\nabla(p_{\varepsilon}-p_{\mbox{\tinyS}}) from both sides of (4.83), we obtain
[TABLE]
To clarify the following estimates, we set \alpha:=\|\nabla(u_{\varepsilon}-u_{\mbox{\tinyS}})\|_{{L^{2}(\Omega)}^{n\times n}},\beta:=\|\nabla(p_{\varepsilon}-p_{\mbox{\tinyS}})\|_{{L^{2}(\Omega)}^{n}},a:=\|\nabla p_{\mbox{\tinyS}}\|_{{L^{2}(\Omega)}^{n}}+\|G\|_{({H^{1}(\Omega)}/{\mathbb{R}})^{*}}. The estimate (4.87) reads as
[TABLE]
Hence, , i.e., \|\nabla(u_{\varepsilon}-u_{\mbox{\tinyS}})\|_{{L^{2}(\Omega)}^{n\times n}}\leq(\sqrt{\varepsilon}/2)(\|\nabla p_{\mbox{\tinyS}}\|_{{L^{2}(\Omega)}^{n}}+\|G\|_{({H^{1}(\Omega)}/{\mathbb{R}})^{*}}). By Lemma 4.1, we obtain
[TABLE]
∎
5 Numerical examples
For our simulations, we consider . We take the following boundary conditions:
[TABLE]
on . The exact solutions for (PP1) are u_{\mbox{\tinyP!P}}=(x(x-1),y(y-1))^{T} and p_{\mbox{\tinyP!P}}=2x+2y-2. We solve the problems (PP1), (ES1) and (S’) numerically by using the finite element method with P2/P1 elements by the software FreeFem++ FreeFem . The numerical solutions (u_{\mbox{\tinyP!P}},p_{\mbox{\tinyP!P}}),(u_{\varepsilon},p_{\varepsilon})~{}(\varepsilon=1,10^{-2}{\rm~{}or~{}}10^{-4}) and (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}}) to the problems (PP1), (ES1) and (S’), respectively, are illustrated in Fig. 2–4. From these pictures we observe that seems to converge to (u_{\mbox{\tinyP!P}},p_{\mbox{\tinyP!P}}) as and to (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}}) as (as expected from Theorem 3.2 and 4.3.)
Next we compute the error estimate between the numerical solutions of (ES1) and (PP1). The numerical errors \|u_{\varepsilon}-u_{\mbox{\tinyP!P}}\|_{{L^{2}(\Omega)}^{n}}, \|\nabla(u_{\varepsilon}-u_{\mbox{\tinyP!P}})\|_{{L^{2}(\Omega)}^{n\times n}}, \|p_{\varepsilon}-p_{\mbox{\tinyP!P}}\|_{{L^{2}(\Omega)}} and \|\nabla(p_{\varepsilon}-p_{\mbox{\tinyP!P}})\|_{{L^{2}(\Omega)}^{n}} are shown in Fig. 5 and Fig. 6. Based on these values, we have fitted a constant such that \|u_{\varepsilon}-u_{\mbox{\tinyP!P}}\|_{{H^{1}(\Omega)}^{n}}\sim c/\varepsilon and \|p_{\varepsilon}-p_{\mbox{\tinyP!P}}\|_{{H^{1}(\Omega)}}\sim c/\varepsilon for large. Fig. 5 and Fig. 6 indicate that there exists a constant such that \|u_{\varepsilon}-u_{\mbox{\tinyP!P}}\|_{{H^{1}(\Omega)}^{n}}\leq c/\varepsilon and \|p_{\varepsilon}-p_{\mbox{\tinyP!P}}\|_{{H^{1}(\Omega)}}\leq c/\varepsilon, as expected from Theorem 3.2.
We also compute the error estimate between the problems (ES1) and (S’) by numerical calculation. The numerical error estimate \|u_{\varepsilon}-u_{\mbox{\tinyS}}\|_{{L^{2}(\Omega)}^{n}},~{}\|\nabla(u_{\varepsilon}-u_{\mbox{\tinyS}})\|_{{L^{2}(\Omega)}^{n\times n}}~{},\|p_{\varepsilon}-p_{\mbox{\tinyS}}\|_{{L^{2}(\Omega)}} and \|\nabla(p_{\varepsilon}-p_{\mbox{\tinyS}})\|_{{L^{2}(\Omega)}^{n}} are shown in Fig. 7 and Fig. 8. Based on these values, we have fitted a constant such that \|u_{\varepsilon}-u_{\mbox{\tinyS}}\|_{{H^{1}(\Omega)}^{n}}\sim c\varepsilon and \|p_{\varepsilon}-p_{\mbox{\tinyS}}\|_{{L^{2}(\Omega)}}\sim c\varepsilon for small. Fig. 7 and Fig. 8 indicate that there exists a constant such that \|u_{\varepsilon}-u_{\mbox{\tinyS}}\|_{{H^{1}(\Omega)}^{n}}\leq\tilde{c}\sqrt{\varepsilon} and \|p_{\varepsilon}-p_{\mbox{\tinyS}}\|_{{L^{2}(\Omega)}}\leq\tilde{c}\sqrt{\varepsilon}, as expected from Theorem 4.4.
Appendix
Theorem 2.7, 4.2, 4.3, and Proposition 2.8 are generalizations of several theorems stated in prev . In this appendix, however, we give their proofs for the readers’ convenience. We define a continuous coercive bilinear form depending on and prove Theorem 2.7 by the Lax–Milgram Theorem.
Proof of Theorem 2.7. We take arbitrary with . Since is surjective (Girault, , Corollary 2.4, 2∘), there exists such that . We put
[TABLE]
and note that and . To simplify the notation, we set , and define and by
[TABLE]
Then, satisfies (ES’) if and only if satisfies
[TABLE]
Adding the equations in (.7), we get
[TABLE]
We check that is a continuous coercive bilinear form on . The bilinearity and continuity of are obvious. The coercivity of is obtained in the following way. Take . We have the following sequence of inequalities:
[TABLE]
Summarizing, is a continuous coercive bilinear form and is a Hilbert space. Therefore, the conclusion of Theorem 2.7 follows from the Lax–Milgram Theorem. ∎
Let (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}}),(u_{\mbox{\tinyP!P}},p_{\mbox{\tinyP!P}}) and be the solutions of (S’), (PP’) and (ES’), respectively, as guaranteed by Theorem 2.5, 2.6 and 2.7. We show that the subtract p_{\mbox{\tinyS}}-p_{\mbox{\tinyP!P}} satisfies
[TABLE]
in distributions sense. The weak harmonicity is the key ingredient to proving Proposition 2.8.
Proof of Proposition 2.8. First, we prove that there exists a constant independent of such that \|u_{\mbox{\tinyS}}-u_{\mbox{\tinyP!P}}\|_{{H^{1}(\Omega)}^{n}}\leq c\|\gamma_{0}p_{\mbox{\tinyS}}-\gamma_{0}p_{\mbox{\tinyP!P}}\|_{H^{1/2}(\Gamma)}, and if \gamma_{0}(p_{\mbox{\tinyS}}-p_{\mbox{\tinyP!P}})=0, then p_{\mbox{\tinyP!P}}=p_{\mbox{\tinyS}}. Taking the divergence of the first equation of (S’), we obtain
[TABLE]
in distributions sense. Since p_{\mbox{\tinyS}}\in{H^{1}(\Omega)} and is dense in , it follows that
[TABLE]
for all . Together with (S’), (PP’) and , we obtain
[TABLE]
from the assumption . Putting \varphi:=u_{\mbox{\tinyS}}-u_{\mbox{\tinyP!P}}\in{H^{1}_{0}(\Omega)}^{n} in (.10), we get
[TABLE]
Hence,
[TABLE]
holds. From the second equation of (.10), we obtain
[TABLE]
for all . Thus we find
[TABLE]
Since is surjective and the space , and are isomorphic, there exists a constant such that for all . Hence, we obtain
[TABLE]
Together with (.11), we obtain \|u_{\mbox{\tinyS}}-u_{\mbox{\tinyP!P}}\|_{{H^{1}(\Omega)}^{n}}\leq c_{1}c_{2}\|\gamma_{0}p_{\mbox{\tinyS}}-\gamma_{0}p_{\mbox{\tinyP!P}}\|_{H^{1/2}(\Gamma)}. Moreover, if \gamma_{0}(p_{\mbox{\tinyS}}-p_{\mbox{\tinyP!P}})=0, then p_{\mbox{\tinyP!P}}=p_{\mbox{\tinyS}}.
Next, we prove that there exists a constant independent of such that \|u_{\mbox{\tinyS}}-u_{\varepsilon}\|_{{H^{1}(\Omega)}^{n}}\leq c\|\gamma_{0}p_{\mbox{\tinyS}}-\gamma_{0}p_{\varepsilon}\|_{H^{1/2}(\Gamma)}, and if \gamma_{0}(p_{\mbox{\tinyS}}-p_{\mbox{\tinyP!P}})=0, then p_{\mbox{\tinyP!P}}=p_{\varepsilon}. Let w_{\varepsilon}:=u_{\mbox{\tinyS}}-u_{\varepsilon}\in{H^{1}_{0}(\Omega)}^{n} and r_{\varepsilon}:=p_{\mbox{\tinyP!P}}-p_{\varepsilon}\in Q. By (S’), (PP’) and (ES’), we obtain
[TABLE]
Putting and and adding the two equations of (.19), we get
[TABLE]
from . Thus we find
[TABLE]
Together with (.16), we obtain
[TABLE]
Moreover, by (.20), we obtain
[TABLE]
Hence, if \gamma_{0}(p_{\mbox{\tinyS}}-p_{\mbox{\tinyP!P}})=0, then p_{\mbox{\tinyP!P}}=p_{\varepsilon}. ∎
We show that the sequence is bounded in . By the reflexivity of , the sequence has a subsequence converging weakly to somewhere in . It is sufficient to check that the limit satisfies (S’). Since the solution of (S’) is unique, the sequence converges weakly.
Proof of Theorem 4.2. We take and as (.1) and (.4) in the proof of Theorem 2.7. We put . Then we obtain
[TABLE]
Putting and adding the two equations of (.23), we get
[TABLE]
since . Hence, and are bounded. Moreover, by Lemma 4.1, we obtain
[TABLE]
i.e., is bounded. By Theorem 3.2, and are bounded, and thus and are bounded.
Since is reflexive and is bounded in , there exist and a subsequence of pairs such that
[TABLE]
Hence, from (.23) with , taking , we obtain
[TABLE]
where we have used that
[TABLE]
[TABLE]
as . By (.4), the first equation of (.26) implies that
[TABLE]
for all . From the second equation of (.26) and , follows. Hence, we obtain that satisfies (S’), i.e., u_{\mbox{\tinyS}}=u+u_{b} and p_{\mbox{\tinyS}}=p+[p_{b}]. Then we have
[TABLE]
[TABLE]
as . Since any arbitrarily chosen subsequence of has a subsequence which converges to (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}}), we can conclude the proof. ∎
Using Theorem 4.2 and the Rellich-Kondrachov Theorem, it is easy to prove Theorem 4.3.
*Proof of Theorem *4.3. We have from (ES’) and (S’) that
[TABLE]
Putting \varphi:=u_{\varepsilon}-u_{\mbox{\tinyS}}\in{H^{1}_{0}(\Omega)}^{n} and \tilde{p}_{\mbox{\tinyS}}:=p_{\mbox{\tinyS}}-p_{b}\in{H^{1}(\Omega)}, we get
[TABLE]
since -\int_{\Omega}(\nabla(p_{\varepsilon}-p_{b}))\cdot(u_{\varepsilon}-u_{\mbox{\tinyS}})=\int_{\Omega}(p_{\varepsilon}-p_{b}){\operatorname{div}}(u_{\varepsilon}-u_{\mbox{\tinyS}}) and {\operatorname{div}}u_{\mbox{\tinyS}}=0. Thus,
[TABLE]
Putting , we have
[TABLE]
Hence,
[TABLE]
Together with (.27) and (.28), we obtain
[TABLE]
By Theorem 4.2 and the Rellich-Kondrachov Theorem, there exists a sequence such that
[TABLE]
Therefore,
[TABLE]
as . This implies that
[TABLE]
by Lemma 4.1. Since any arbitrarily chosen subsequence of has a subsequence which converges to (u_{\mbox{\tinyS}},p_{\mbox{\tinyS}}), we can conclude the proof. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) Amsden, A.A., Harlow, F.H.: A simplified MAC technique for incompressible fluid flow calculations. J. Comput. Phys. 6 , 322–325 (1970)
- 2(2) Chan, R.K.C., Street, R.L.: A computer study of finite-amplitude water waves. J. Comput. Phys. 6 , 68–94 (1970)
- 3(3) Chorin, A.J.: Numerical solution of the Navier–Stokes equations. Math. Comput. 22 (104), 745–762 (1968)
- 4(4) Conca, C., Murat, F., Pironneau, O.: The Stokes and Navier–Stokes equations with boundary conditions involving the pressure. Jpn. J. Math. 20 (2), 279–318 (1994)
- 5(5) Conca, C., Pares, C., Pironneau, O., Thiriet, M.: Navier–Stokes equations with imposed pressure and velocity fluxes. Int. Numer. Meth. Fl. 20 , 267–287 (1995)
- 6(6) Cummins, S.J., Rudman, M.: An SPH projection method. J. Comput. Phys. 152 , 584–607 (1999)
- 7(7) Douglas, J., Wang, J.: An absolutely stabilized finite element method for the Stokes problem. Math. Comput. 52 (186), 495–508 (1989)
- 8(8) Duvaut, G., Lions, J.L.: Inequalities in Mechanics and Physics, Springer-Verlag. Berlin (1976)
