HAL Id: hal-01978126
https://hal.archives-ouvertes.fr/hal-01978126
Submitted on 11 Jan 2019
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Stability and optimal convergence of unfitted extended finite element methods with Lagrange multipliers for the
Stokes equations
Michel Fournié, Alexei Lozinski
To cite this version:
Michel Fournié, Alexei Lozinski. Stability and optimal convergence of unfitted extended finite element
methods with Lagrange multipliers for the Stokes equations. UCL workshop :Geometrically Unifitted
Finite Element Methods and Applications, 2016, Londres, United Kingdom. �hal-01978126�
extended finite element methods with Lagrange multipliers for the Stokes equations
Michel Fourni´e and Alexei Lozinski
Abstract We study a fictitious domain approach with Lagrange multipliers to dis- cretize Stokes equations on a mesh that does not fit the boundaries. A mixed finite element method is used for fluid flow. Several stabilization terms are added to im- prove the approximation of the normal trace of the stress tensor and to avoid the inf-sup conditions between the spaces of the velocity and the Lagrange multipliers.
We generalize first an approach based on eXtended Finite Element Method due to Haslinger-Renard [12] involving a Barbosa-Hughes stabilization and a robust re- construction on the badly cut elements. Secondly, we adapt the approach due to Burman-Hansbo [4] involving a stabilization only on the Lagrange multiplier. Mul- tiple choices for the finite elements for velocity, pressure and multiplier are con- sidered. Additional stabilization on pressure (Brezzi-Pitkranta, Interior Penalty) is added, if needed. We prove the stability and the optimal convergence of several vari- ants of these methods under appropriate assumptions. Finally, we perform numerical tests to illustrate the capabilities of the methods.
1 Introduction
Let D ⊂ R d , d = 2 or 3, be a bounded polygonal (polyhedral) domain. We are inter- ested in the Stokes equations in a setting motivated by the fluid-structure interaction, especially by simulations of particulate flows. We thus assume that D is decomposed into the fluid domain F and the solid one S. The domains F and S are separated by the interface Γ , cf. Fig. 1. We also denote Γ wall = ∂ D and assume, for simplicity, that Γ and Γ wall are disjoint. Consider the problem
Michel Fourni´e
Name, Address of Institute e-mail: [email protected] Alexei Lozinski
Laboratoire de Math´ematiques de Besanc¸on, UMR CNRS 6623, Univ. Bourgogne Franche-Comt´e, e-mail: [email protected]
1
−2 divD(u) + ∇p = f in F, (1)
div u = 0 in F , (2)
u = g on Γ , (3)
u = 0 on Γ wall , (4)
for u and p, respectively, the velocity and the pressure of the fluid filling F. Here D(u) = 1
2 ∇u + ∇u T
and the viscosity has been set to 1 for simplicity. In appli- cations we have in mind, i.e. simulations of the motion of rigid or elastic particles flowing in the fluid, the interface Γ is moving in time while the outer boundary Γ wall is immobile. In this chapter, we shall study Finite Element (FE) discretizations of the problem above on a mesh fixed on D which is thus fitted to Γ wall but is cut in an arbitrary manner by interface Γ . The interest of these methods in the context of fluid-structure interaction is that it allows one to avoid remeshing when the interface advances with time.
Fig. 1: The fluid domain F, the interface Γ and the outer boundary Γ
wall.
Introducing the force exerted by the fluid on the solid at each point of Γ
λ = −2D(u)n + pn, on Γ (5)
with n the unit normal looking outside from F, and interpreting λ as the Lagrange multiplier associated with the Dirichlet condition (3), we can write the weak formu- lation of (1)–(4) as
Find (u, p, λ ) ∈ H wall 1 (F) d × L 2 0 (F) × H −
12(Γ ) d such that
A(u, p,λ ; v, q, µ) = L(v, µ), ∀(v, q, µ) ∈ H wall 1 (F) d ×L 2 0 (F) × H −
12(Γ ) d (6) where
A(u, p, λ ;v, q, µ) = 2 Z
F
D(u) : D(v)−
Z
F
(p divv +q divu) + Z
Γ
(λ · v + µ · u) L(v , µ) =
Z
F f · v + Z
Γ
g · µ
and H wall 1 (F) is the space of H 1 functions on F vanishing on Γ wall . The FE methods studied in this chapter will be based on the variational formulation (6). They shall thus discretize the Lagrange multiplier λ , alongside u and p, thus giving a natural approximation of the force exerted by the fluid on the solid.
As mentioned above, our FE methods will rely on a ”background” fixed mesh T h that lives on the fluid-structure domain D ⊃ F (the boundary of D is Γ wall and is well fitted by T h ). In the actual computations, the elements of T h having no intersection with F will be discarded and the FE spaces for velocity and pressure will be defined on the mesh T h e := T h i ∪ T h Γ where T h Γ is the union of elements of T h that are cut by Γ and T h i is the union of elements of T h inside F. The FE space for the Lagrange multiplier will live only on the cut elements T h Γ , cf. Fig. 2.
Fig. 2: The meshes T
he= T
hi∪ T
hΓ: the triangles of T
hiare marked by • and those of T
hΓare marked by • ; triangles marked by • are not used.
Denoting by F h e (resp. F h i , F h Γ ) the domain covered by mesh T h e (resp. T h i , T h Γ ) we introduce three FE spaces
V h ⊂ H wall 1 (F h e ) d , Q h ⊂ L 2 (F h e )∩ L 2 0 (F), W h ⊂ L 2 (F h Γ ) d (7) to approximate velocity, pressure and Lagrange multiplier respectively. Several choices of FE spaces V h , Q h , and W h will be considered, but we restrict ourselves in this chapter to triangular (tetrahedral) quasi-uniform meshes T h and to the standard continuous piecewise polynomial FE-spaces P k (k ≥ 1) or the piecewise constant space P 0 on such a mesh. 1 Our FE spaces will be always based on meshes inherited from T h : T h e for V h , Q h , and T h Γ for W h . Note that velocity and pressure are approx- imated on a domain F h e slightly larger than F but all the integrals in the discretized problem will be calculated on F or Γ . Note also that we choose the FE space for λ on a domain F h Γ rather than on the surface Γ to avoid the complicated issue of meshing a surface.
A straightforward Galerkin approximation of (6) is not stable in general (al- though it often works in practice, as will be seen in the numerical experiments at the end of this chapter). Several stabilization techniques were therefore proposed in
1
The case of regular non-quasi-uniform meshes can also be easily treated at the expense of some
technicalities. However, in applications, one will typically use a simplest possible mesh on D (for
example, structured Cartesian) so that the quasi-uniformity restriction seems quite acceptable.
the literature, using either Lagrange multipliers [12, 4] or a Nitsche-like method [6]
to take into account the boundary conditions on Γ . We shall be concerned in this chapter only with the methods based on Lagrange multipliers. Firstly, we adapt the method of Haslinger-Renard (cf. [12] for the Poisson problem) to Stokes equations.
The method is based on a Barbosa-Hughes stabilization [1] on Γ with additional local treatment on badly cut mesh elements. An extension to Stokes equations was already presented in [8] but the analysis there relied on a number of hypotheses, difficult to verify. In this paper, we present a complete theoretical analysis in two cases :
1. LBB-unstable velocity-pressure FE pairs, namely, P 1 − P 1 or P 1 − P 0 elements.
A stabilization is needed in this case even on a fitted mesh. We shall show, that adding the well known stabilization terms such as Brezzi-Pitk¨aranta [3] for P 1 − P 1 elements (or interior penalty for P 1 − P 0 elements) to a Haslinger-Renard fictitious domain method, as in [8], makes it stable and optimally convergent.
2. LBB-stable velocity-pressure FE pairs, namely, P k − P k−1 Taylor-Hood ele- ments. We show that a version of the method above (with and additional pressure stabilization on Γ but avoiding stabilization over the whole domain F ) is also stable and optimally convergent. Our proofs are presented here only in the 2D case and under some additional assumptions on the mesh.
We generalize moreover a method by Burman-Hansbo [4] to Stokes equations.
This is also a fictitious domain method with Lagrange multipliers. Unlike the method by Haslinger-Renard (where the stabilization comes by enforcing (5) on Γ and thus involves all the variables u, p, λ ), one stabilizes here only the multi- plier λ by enforcing its continuity in some sense, so that the structure of resulting matrices is simpler. Fortunately, much of the theory outlined above can be reused for the analysis of this method. We are thus able to prove the stability and optimal convergence for the same choices of the FE spaces as above.
The chapter is concluded by numerical experiments aiming at comparing differ- ent stabilizations and choices of of FE spaces.
Nomenclature.
Domains: F is the fluid domain where the problem (1)–(4) is posed while F h i , F h e , F h Γ are the domains occupied by the meshes T h i , T h e , T h Γ respectively. We have thus F h i ⊂ F ⊂ F h e and F h Γ = F h e \ F h i .
Meshes: T h i , T h e , T h Γ are submeshes of a background mesh T h so that T h i = {T ∈ T h : T ⊂ F }, T h Γ = {T ∈ T h : T ∩Γ 6= ∅ } and T h e := T h i ∪ T h Γ .
E h e and E h Γ stand for the sets of interior edges of T h e and T h Γ respectively.
F T (resp. Γ T ) denotes T ∩ F (resp. T ∩ Γ ) for any cut element T ∈ T h Γ .
Norms: k · k k,ω stands for the norm in H k (ω) where ω can be a domain in R d or a (d −1)-dimensional manifold. We identify H 0 (ω ) with L 2 (ω).
| · | k,ω stands for the semi-norm in H k (ω ), k > 0.
k · k ∞,ω stands for the norm in L ∞ (ω).
2 Methods `a la Haslinger-Renard
The starting point for the construction of the Haslinger-Renard method (proposed in [12] for the Poisson equation) is to add to the variational formulation (6) the Barbosa-Hughes stabilization [1], which enforces the relation λ + 2D(u)n − pn = 0 on Γ . These terms take the form
−γ 0 h Z
Γ
(λ + 2D(u)n − pn)· (µ +2D(v)n −qn) (8) with a mesh-independent γ 0 > 0. This idea, at least in the context of the Poisson equation as in [12], produces a stable and optimally convergent approximation pro- vided the mesh elements are cut by Γ in a certain way so that F ∩ T is a big enough portion of T for any T ∈ T h Γ . If, for some elements, this is not the case the method can be still cured by replacing the approximating polynomial in such “bad elements”
by the polynomial extended from from adjacent “good elements”. The relation be- tween bad and good elements is made precise in the following
Assumption A. We fix a threshold θ min ∈ (0, 1] and declare any T ∈ T h Γ a good element (resp. bad element) if |F |T
T| | ≥ θ min (resp. |F |T|
T| < θ min ). We assume that one can choose for any bad element T a “good neighbor” T 0 ∈ T h e , |T |T
0∩F|
0| ≥ θ min , such that T and T 0 share at least one node, cf. Fig. 3.
Remark 1. Typically, Assumption A will hold true even for θ min = 1 if the mesh is sufficiently refined. One could also relax the notion of a neighbor (at the expense of some complication of the forthcoming proofs) to the requirement dist(T, T 0 ) ≤ Ch with a mesh-independent C > 0.
Fig. 3: Good element T
0and bad element T
We now define a “robust reconstruction” on F h Γ for the FE functions on F h e Definition 1. For any v h ∈ V h set v b h on any T ∈ T h Γ as
• v b h = v h on T if T is a good element,
• ( v b h ) |T = (v h ) |T
0if T is a bad element. Here T 0 is the good neighbor of T from
Assumption A and the relation should be understood in the sense that v b h on T is
taken as the same polynomial as the polynomial giving v h on T 0 .
For any q h ∈ Q h , one constructs q b h in the same way.
We shall show in the subsequent paragraphs that adding stabilization (8) to (6) and replacing u,v in these terms (sometimes also p, q) by their robust reconstructions produces indeed a stable approximation to the Stokes equations. We end this general introduction to the Haslinger-Renard method by a Proposition illustrating the use- fulness of the selection criterion for good elements, showing that the L 2 norm on the cut portion of an element T controls L ∞ (and hence any other) norm on the whole element with an equivalence constant depending on the relative measure of the cut portion, followed by a list of interpolation error estimates that shall be needed in the forthcoming analysis.
Proposition 1. Let p be a polynomial of degree ≤ k and θ ∈ (0, 1]. Then for any T ∈ T h and any measurable set S ⊂ T with |S| ≥ θ|T | one has
kpk ∞,T ≤ C
h d/2 kpk 0,S (9)
with a constant C > 0 depending only on θ , k and mesh regularity.
Proof. By scaling, it is sufficient to prove (9) on a reference element. We thus fix a simplex T ∈ R d of diameter h = 1 and consider for any p ∈ P k
N θ (p) = inf
S⊂T,|S|≥θ|T| kpk 0,S
It is easy to see that N θ is a continuous function on the finite-dimensional space P k . Consequently, it attains a minimum on the set Σ 1 := {p ∈ P k , k pk ∞,T = 1}, i.e. ∃α ≥ 0 and p α ∈ Σ 1 such that N θ (p) ≥ N θ (p α ) = α for all p ∈ Σ 1 . It remains to prove α > 0. To this end, let m(δ ) = meas{x ∈ T : | p α (x)| ≤ δ } for any δ ≥ 0. Since m(δ ) is decreasing down to 0 as δ → 0, one can find ε > 0 s.t. m(ε) ≤ θ 2 |T |. We observe now k p α k 2 0,S ≥ ε 2 |S| − θ 2 |T |
for any S ⊂ T , hence α 2 = N θ 2 (p α ) ≥ ε 2 θ 2 |T | > 0.
By homogeneity, this also proves N θ (p) ≥ αk pk ∞,T for all p ∈ P k entailing (9) with C = α 1 (recall that the proof is done on the reference element with h = 1). u t
We are going to establish interpolation estimates on the cut domain. To this end, we introduce
Assumption B. Ω is a Lipschitz domain and there exist constants c Γ ,C Γ > 0 such that for any T ∈ T h Γ
1. |Γ T | ≤ C Γ h d−1 with Γ T := T ∩Γ ;
2. there exists a unit vector χ T ∈ R d such that χ T · n ≥ c Γ a.e. on Γ T where n is the unit normal looking outward from F.
Remark 2. The bound on |Γ T | in the first part of the Assumption B is automatically
satisfied on Lipschitz domain. We prefer however to write this bound explicitly in
order to emphasize that some of the estimates below will depend on the constant C Γ ,
so that Γ should be supposed not too oscillating. The second part of the Assumption
B is not too restrictive either. Typically, one can take χ T as the normal n at the
middle point of Γ T if Γ T is smooth or as the average between the two normals if Γ T is the union of two segments (in the case when Ω is a 2D polygon). Such choices will suffice on a sufficiently refined mesh.
Proposition 2. Let V h , Q h ,W h be (respectively) P k
u, P k
p, P k
λFE spaces on meshes T h e , T h e , T h Γ as in (7). Under Assumptions A and B, there exist interpolation opera- tors I h u : H wall 1 (F) d → V h , I h p ∈ L 2 0 (F) → Q h , I h λ : H
12(Γ ) d → W h s.t. for any suffi- ciently smooth u, p, λ
1
h ku − I h u uk 0,F + |u − I h u u| 1,F + 1
√
h ku − I h u uk 0,Γ ≤ Ch s
u|u| s
u+1,F (10) (for all integer s u : 0 ≤ s u ≤ k u ) k∇u − ∇I h u uk 0,Γ + k∇u − ∇ I c h u uk 0,Γ
≤ Ch s
u−
12|u| s
u+1,F (11) (for all integer s u : 1 ≤ s u ≤ k u ) 1
h k p −I h p pk 0,F +| p − I h p p| 1,F
+ 1
√ h
kp − I h p pk 0,Γ + k p − I c h p pk 0,Γ
≤ Ch s
p| p| s
p+1,F (12) (for all integer s p : 0 ≤ s p ≤ k p )
√ 1
h kλ − I h λ λ k 0,Γ ≤ Ch s
λ|λ | s
λ
+
12,Γ (13)
(for all integer s λ : 0 ≤ s λ ≤ k λ ) with C > 0 depending only on the constants in Assumptions A, B, and on the mesh regularity, and k u ≥ 1 in the case of estimate (11). Moreover, operator I h λ can be extended to I h λ : H wall 1 (F) d → W h s.t. for any λ ˜ ∈ (H s
λ+1 (F )∩H wall 1 ) d and an integer s λ , 0 ≤ s λ ≤ k λ
1
h k λ ˜ −I h λ λ ˜ k 0,F
Γh
+ | λ ˜ −I h λ λ ˜ | 1,F
Γh
+ 1
√ h k λ ˜ − I h λ λ ˜ k 0,Γ ≤ Ch k
λ| λ ˜ | k
λ
+1,F (14) Proof. We start with the construction of I h u . Extension theorems for Sobolev spaces guarantee for any u ∈ H s
u+1 (F) d existence of ˜ u ∈ H s
u+1 (F h e ) d with k uk ˜ s
u+1,F
eh
≤
Ckuk s
u+1,F and ˜ u = u on F . Let ˜ I h : H wall 1 (F h e ) d → V h be a Cl´ement-type interpola- tion operator [9] satisfying
1
h k u− ˜ I ˜ h uk ˜ 0,T +| u ˜ − I ˜ h u| ˜ 1,T + 1
√
h k u ˜ − I ˜ h uk ˜ 0,∂ T +
√
hk∇( u ˜ − I ˜ h u)k ˜ 0,∂ T ≤Ch s
u| u| ˜ s
u+1,ω
Ton any T ∈ T h e with ω T begin the patch of elements of T h e touching T . Let I h u u =
I ˜ h u| ˜ F . Summing the estimates above over all the mesh elements yields immediately
the estimates in L 2 (F ) and H 1 (F) in (10). Now, on any element T ∈ T h Γ
c Γ ku −I h u uk 2 0,Γ
T
≤
Z
Γ
T( u ˜ − I ˜ h u) ˜ 2 χ T ·n = Z
F
Tdiv(( u ˜ − I ˜ h u) ˜ 2 χ T )−
Z
F∩∂ T
( u ˜ − I ˜ h u) ˜ 2 χ T ·n since ∂ F T = Γ T ∪ (F ∩ ∂ T ). Developing and applying the interpolation estimates above gives
c Γ ku − I h u uk 2 0,Γ
T
≤
Z
F
T2( u ˜ − I ˜ h u)∇( ˜ u ˜ − I ˜ h u) ˜ · χ T +k u ˜ − I ˜ h uk ˜ 2 0,F ∩∂ T
≤ 2k u ˜ − I ˜ h uk ˜ 0,T | u ˜ − I ˜ h u| ˜ 1,T + k u ˜ − I ˜ h uk ˜ 2 0,∂ T ≤ Ch 2s
u+1 (| u| ˜ 2 s
u
+1,ω
T) Summing this over all the elements in F h Γ yields the L 2 (Γ )-estimate in (10).
If s u ≥ 1, we have moreover on any T ∈ T h e h| u ˜ − I ˜ h u| ˜ 2,T + √
hk∇( u ˜ − I h u)k ˜ 0,∂ T ≤ Ch s
u| u| ˜ s
u+1,ω
TThis, by the same argument as above, gives the L 2 (Γ ) estimate on ∇(u − I h u u) in (11). In order to extend this to ∇(u − I c h u u) consider a bad element T and its good neighbor T 0 . Both T and T 0 belong to the patch ω T
0and examining the derivation of interpolation estimates for the Cl´ement interpolator ˜ I h reveals that the polynomial ( I ˜ h u) ˜ |T
0gives actually an optimal approximation of ˜ u on the whole ω T
0, i.e.
|u − I c h u u| 1,T = | u ˜ − ( I ˜ h u) ˜ |T
0| 1,T ≤ | u ˜ −( I ˜ h u) ˜ |T
0| 1,ω
T0≤ Ch
su|u| s
u+1,ω
T0Similarly, 1 h ku − I c h u uk 0,T + √ 1
h ku − I c h u uk 0,∂ T ≤ Ch
su|u| s
u+1,ω
T0
. Thus, the same argu- ment as above gives the L 2 (Γ ) estimate on ∇(u − I c h u u) in (11).
The remaining estimates (12), (13) and (14) are proved in a similar manner. We skip the details and make only the following remarks:
• The operator I h p should preserve the restriction that pressure is of zero mean on F. We thus define it as I h p p = I ˜ h p ˜ − i h (p) where ˜ I h is the Cl´ement interpolation operator on T h e , ˜ p is an extension of p to F h e , and i h (p) = R F I ˜ h p. The correction ˜ i h (p) can be bounded as
|i h (p)| = Z
F
( I ˜ h p ˜ − p)
≤ |F |
12k p ˜ − I ˜ h pk ˜ 0,F
eh
≤ Ch s
p+1 | p| ˜ s
p+1,F
eh
and thus it does not perturb the estimates (12).
• Concerning the interpolation of λ , we note that (13) is in fact an easy corol- lary to (14). Indeed, for any λ ∈ H k
λ+
12(Γ ) d there exists (by the trace theorem) λ ˜ ∈ H k
λ+1 (F h Γ ) d satisfying ˜ λ | Γ = λ and | λ ˜ | k
λ
+1,F
hΓ≤ C|λ | k
λ
+
12,Γ . We can thus define I h λ λ := I h λ λ ˜ and observe that (14) entails (13).
u
t
2.1 P 1 − P 1 velocity-pressure spaces with Brezzi-Pitk¨aranta stabilization.
Let us choose P 1 FE spaces for both V h and Q h , add Brezzi-Pitk¨aranta-like stabiliza- tion for the pressure and the Barbosa-Hughes-like stabilization on the interface as described above. We choose to introduce the robust reconstruction from Definition 1 in the last terms only for the velocity in this case (on both trial function u h and test function v h ). The method thus reads
Find (u h , p h ,λ h ) ∈ V h × Q h ×W h such that
A HR−BP (u h , p h ,λ h ; v h ,q h , µ h ) = L(v h , µ h ), ∀(v h , q h , µ h ) ∈ V h × Q h ×W h (15) where
A HR−BP (u, p, λ ; v , q, µ) = A(u, p, λ ; v , q, µ)
− γ 0 h Z
Γ
(λ + 2D( b u)n − pn) · (µ + 2D( b v)n − qn) −θ h 2 Z
F
he∇p · ∇q
V h , Q h are continuous P 1 FE spaces on mesh T h e and W h is P 1 or P 0 FE space on mesh T h Γ , cf. (7).
We remind that the Brezzi-Pitk¨aranta stabilization (the last term above) should be present on F to compensate the lack of the discrete inf-sup in P1-P1 velocity- pressure FE spaces. In addition, in our fictitious domain situation, it is extended to the larger domain F h e thus helping to ensure stability near Γ .
In the following propositions, Assumptions A and B are implicitly implied and the constants C may vary from line to line and depend on c Γ ,C Γ > 0 from Assump- tion B, θ min from Assumption A, and on the mesh regularity.
Proposition 3. For all v h ∈ V h one has
hk∇ v b h k 2 0,Γ ≤ C|v h | 2 1,F (16) Proof. Taking any T ∈ T h Γ and denoting its good neighbor by T 0 we observe
k∇ v b h k 0,Γ
T≤ p
|Γ T |k∇ v b h k L
∞(T ) ≤ C p
|Γ T |k∇v h k L
∞(T
0) ≤ C p |Γ T |
h d/2 k∇v h k 0,F
T0
The last inequality above holds by Proposition 1 with a constant dependent on θ min . The last but one inequality is easily proven by scaling given that T and T 0 are neigh- bors. Using the bound |Γ T | ≤ C Γ h d−1 and summing over all T ∈ T h Γ yields (16).
u t
Proposition 4. For all q h ∈ Q h one has hkq h k 2 0,Γ ≤ C
kq h k 2 0,F + h 2 |q h | 2 1,F
e hProof. Using the notations T, T 0 as in the preceding proof and assuming that these two elements share a node x, we observe
kq h k 0,Γ
T≤ p
|Γ T |kq h k L
∞(T ) ≤ p
|Γ T |(|q h (x)| +hk∇q h k L
∞(T) )
≤ p
|Γ T |(kq h k L
∞(T
0) + hk∇q h k L
∞(T ) ) ≤ C p |Γ T |
h d/2 (kq h k 0,F
T0+ hk∇q h k 0,T ) We have used again Proposition 1 on the good element T 0 . We conclude thanks to
|Γ T | ≤ C Γ h d−1 from Assumption B and the summation over all T ∈ T h Γ . u t We shall also need a special interpolation operator adapted to functions vanishing on Γ , the idea of which goes to [13].
Proposition 5. There exists an interpolation operator I h 0 : H 0 1 (F) d → V h such that kv −I h 0 vk 0,F ≤ Ch|v| 1,F , |I h 0 v| 1,F ≤ C|v| 1,F
and I h 0 v = 0 on F h Γ (and consequently I h 0 v = 0 on Γ ) for any v ∈ H 0 1 (F ) d with a mesh-independent constant C > 0.
Proof. The construction of I h 0 will be based on the interpolator I h u from Proposition 2 with k u = 1. For any v ∈ H 0 1 (F) d , let us put I h 0 v(x) = I h u (x) at all the interior nodes x of T h i (i.e. excepting the nodes lying on ∂ T h i ) and I h 0 v(x) = 0 on all the nodes of T h Γ . Since I h 0 v is the piecewise linear function on T h e , this uniquely defines it everywhere on F h e . Moreover, I h 0 v = 0 on F h Γ .
Let us denote, for a mesh edge E lying on ∂ F h i , the adjacent element from T h Γ by T Γ and the union of all the elements from T h i sharing at least a node with E by ω E i . By scaling
kI h u v− I h 0 vk 0,ω
iE
≤ C √
hkI h u vk 0,E ≤ C(kI h u vk 0,T
Γ+h|I h u v| 1,T
Γ)
Summing over all such edges and introducing the extension ˜ v to F h e as in the proof of Proposition 2 yields
kI h u v−I h 0 vk 0,F
ih
≤C(kI h u vk 0,F
Γh
+h|I h u v| 1,F
Γh
) ≤ C(k v−I ˜ h u vk 0,F
Γh
+k vk ˜ 0,F
Γh
+h|I h u v| 1,F
Γ h) Since I h 0 v = 0 on F h Γ this entails
kv− I h 0 vk 0,F ≤ kvk 0,F + kv − I h u vk 0,F
ih
+ kI h u v− I h 0 vk 0,F
i h≤ C(k vk ˜ 0,F
Γh
+k v ˜ −I h u vk 0,F
eh
+h|I h u v| 1,F
Γ h) We now employ the bound k vk ˜ 0,F
Γh
≤ Ch| v| ˜ 1,F
Γh
, which is valid since F h Γ is a band of thickness h around Γ and ˜ v = 0 on Γ . Moreover,
1
h k v ˜ −I h u vk 0,F
eh
+|I h u v| 1,F
eh
≤ C| v| ˜ 1,F
eh
as follows from the proof of Proposition 2, cf. (10) with s u = 0. Since | v| ˜ 1,F
eh
≤
C|v| 1,F by the extension theorem, this proves the announced estimate of kv − I h 0 vk 0,F .
The estimate for the H 1 norm of I h 0 v follows using the inverse inequality and the L 2 error estimates proved above:
|I h 0 v| 1,F = |I h 0 v| 1,F
ih
≤ |I h 0 v−I h u v| 1,F
ih
+|I h u v| 1,F
ih
≤ C
h kI h 0 v−I h u vk 0,F
ih
+|I h u v| 1,F
ih
≤C|v| 1,F
u t
Lemma 1. Under Assumption A and B, taking γ 0 > 0 small enough and any θ > 0, there exists a mesh-independent constant c > 0 such that
inf
(u
h,p
h,λ
h)∈V
h×Q
h×W
hsup
(v
h,q
h,µ
h)∈V
h×Q
h×W
hA HR−BP (u h , p h , λ h ; v h , q h , µ h )
|||u h , p h , λ h ||| |||v h , q h , µ h ||| ≥ c where the triple norm is defined by
|||u, p, λ ||| =
|u| 2 1,F +k pk 2 0,F + h 2 |p| 2 1,F
eh
+ hkλ k 2 0,Γ + 1 h kuk 2 0,Γ
1/2
Proof. We observe, using Proposition 3, A HR−BP (u h , p h ,λ h ; u h , −p h , −λ h )
= 2kD(u h )k 2 0,F −4γ 0 hkD( u b h )k 2 0,Γ + γ 0 hkλ h − p h nk 2 0,Γ + θh 2 |p h | 1,F
eh
≥ 2kD(u h )k 2 0,F −Cγ 0 |u h | 2 1,F + γ 0 hkλ h − p h nk 2 0,Γ + θh 2 |p h | 1,F
eh
≥ 1
K |u h | 2 1,F +γ 0 hkλ h − p h nk 2 0,Γ + θ h 2 | p h | 1,F
eh
We have used in the last line the assumption that γ 0 is sufficiently small and Korn inequality
|v| 2 1,F ≤ KkD(v)k 2 0,F , ∀v ∈ H wall 1 (F) (17) Note that the inequality is valid in this form because the functions from H wall 1 (F) vanish on Γ wall , i.e. on a part of the boundary ∂ F with non zero measure.
The continuous inf-sup condition [10] implies for all p h ∈ Q h there exists v p ∈ H 0 1 (F) d such that
− Z
F p h divv p = k p h k 2 0,F and |v p | 1,F ≤ Ck p h k 0,F . (18)
Recalling that v p = I h 0 v p = 0 on Γ we can write
− Z
F p h div(I h 0 v p ) = kp h k 2 0,F − Z
F p h div(I h 0 v p −v p )
= kp h k 2 0,F − Z
F ∇p h · (v p − I h 0 v p ) ≥ kp h k 2 0,F −Ch|p h | 1,F
eh
|v p | 1,F
≥ kp h k 2 0,F −Ch|p h | 1,F
eh
k p h k 0,F (19)
where we have used the bounds from Proposition 5 and (18). Combining this with Young inequality we obtain
A HR−BP (u h , p h ,λ h ; I h 0 v p ,0, 0) ≥ −kD(u h )k 0,F kD(I h 0 v p )k 0,F + k p h k 2 0,F −Ch|p h | 1,F
eh
k p h k 0,F
≥ 1
2 k p h k 2 0,F −C|u h | 2 1,F −Ch 2 |p h | 2 1,F
e hRecall interpolation operator I h λ from Proposition 2 and observe, using Proposi- tion 3 with Young inequality,
A HR−BP (u h , p h ,λ h ; 0, 0, 1
h I h λ u h ) = 1 h Z
Γ
u h · I h λ u h −γ 0 Z
Γ
(2D( b u h )n − p h n+λ h )·I h λ u h
≥ 1
2h ku h k 2 0,Γ − 1
2h ku h −I h λ u h k 2 0,Γ −γ 0 C
√
h |u h | 1,F + kλ h − p h nk 0,Γ
ku h k 0,Γ + ku h − I h λ u h k 0,Γ
≥ 1
4h ku h k 2 0,Γ − C
h kI h λ u h − u h k 2 0,Γ −C|u h | 2 1,F −Chkλ h − p h nk 2 0,Γ
≥ 1
4h ku h k 2 0,Γ −C|u h | 2 1,F −Chkλ h − p h nk 2 0,Γ In the last line, we have used the bound ku h − I h λ u h k 0,Γ ≤ C √
h|u h | 1,F , i.e. (14) with s λ = 0.
Combining the above inequalities, we can obtain for any κ , η > 0, A HR−BP (u h , p h ,λ h ; u h +κI h 0 v p , −p h , −λ h + η
h I h λ u h ) ≥ 1
K |u h | 2 1,F + κ
2 k p h k 2 0,F + η 4h ku h k 2 0,Γ + (θ −Cκ)h 2 |p h | 1,F
eh
+ (γ 0 −Cη )hkλ h − p h nk 2 0,Γ −C(κ + η)|u h | 2 1,F (20) In order to split p h and λ h inside kλ h − p h nk 0,Γ we establish the following bounds with any t > 0 and use finally Proposition 4
k p h n − λ h k 2 0,Γ ≥ k p h k 2 0,Γ +kλ h k 2 0,Γ −(t + 1)kp h k 2 0,Γ − 1
t +1 kλ h k 2 0,Γ
= t
t +1 kλ h k 2 0,Γ −tk p h k 2 0,Γ ≥ t
t + 1 kλ h k 2 0,Γ − Ct h
kp h k 2 0,F + h 2 | p h | 2 1,F
e h(21)
Substituting this into inequality (20) and assuming γ 0 , κ , η , t sufficiently small, we
obtain finally
A HR−BP (u h , p h ,λ h ; u h +κ I h 0 v p , −p h , −λ h + η
h I h λ u h ) (22)
≥ c
|u h | 2 1,F + k p h k 2 0,F + h 2 |p h | 2 1,F
eh
+ hkλ h k 2 0,Γ + 1 h ku h k 2 0,Γ
= c|||u h , p h , λ h ||| 2 . On the other hand, the estimates of Propositions 2 and 5 give immediately
|||u h + κI h 0 v p , −p h , −λ h + η
h I h λ u h ||| ≤ C|||u h , p h , λ h ||| (23) Dividing (22) by (23) yields the result of the Lemma. u t
Theorem 1. Under Assumptions A, B, γ 0 > 0 small enough, any θ > 0, and (u, p, λ ) ∈ H 2 (F) d × L 0 2 (F) × H
12(Γ ), the following a priori error estimates hold for method (15):
|u − u h | 1,F + kp − p h | 0,F + √
hkλ − λ h k 0,Γ ≤ Ch(|u| 2,F + |p| 1,F + |λ | 1/2,Γ ) (24) Moreover, assuming the usual elliptic regularity for the Stokes problem in F, i.e. the bound (28) for the solution to (27), one has ∀ϕ ∈ H 3/2 (Γ )
Z
Γ
(λ −λ h )ϕ
≤ Ch 2 (|u| 2,F +| p| 1,F +|λ | 1/2,Γ )|ϕ | 3/2,Γ (25) Proof. Use Galerkin orthogonality (taking b u = u for the exact solution u and ex- tending p from F to F h e )
A HR−BP (u h − u, p h − p, λ h −λ ; v h , q h , µ h ) = θh 2 Z
F
he∇p · ∇q h (26) to conclude
A HR−BP (u h − I h u u, p h − I h p p, λ h − I h λ λ ; v h , q h , µ h ) = 2 Z
F
D(u −I h u u) : D(v h )
− Z
F ((p − I h p p) divv h + q h div(u − I h u u)) + Z
Γ
((λ − I h λ λ )· v h + µ h · (u − I h u u))
− γ 0 h Z
Γ
(λ −I h λ λ + 2D(u − I c h u u)n − (p − I h p p)n) · (µ h + 2D( v b h )n − q h n) +θ h 2
Z
F
eh
∇I h p p · ∇q h All the terms in the right-hand side can be bounded thanks to Proposition 2 with s u = 1, s p = s λ = 0 so that
A HR−BP (u h −I h u u, p h −I h p p, λ h −I h λ λ ; v h , q h , µ h ) ≤Ch(|u| 2,F +|p| 1,F +|λ | 1/2,Γ )|||v h , q h , µ h |||
The inf-sup lemma 1 now gives (24).
To prove (25), choose any ϕ ∈ H 3/2 (Γ ) and take v, q solution to
−2 divD(v) + ∇q = 0, divv = 0 on F, v = ϕ on Γ (27) as well as µ = −(2D(v)n − qn)| Γ . Integration by parts gives
2 Z
F
D(u −u h ) : D(v) − Z
F q div(u −u h ) + Z
Γ
(u − u h )µ = 0 Subtracting this from Galerkin orthogonality relation (26) gives
Z
Γ
(λ −λ h )·ϕ = 2 Z
F D(u−u h ) : D(v−v h )−
Z
F
((p − p h )div(v−v h )+(q −q h ) div(u −u h )) +
Z
Γ
((λ −λ h ) · (v− v h ) + (µ − µ h )· (u − u h ))
− γ 0 h Z
Γ
(λ − λ h + 2D(u − u b h )n − (p − p h )n) · (µ − µ h + 2D(v − v b h )n − (q − q h )n)
− θh 2 Z
F
eh
∇p h · ∇q h
Taking v h = I h u v, q h = I h p q, µ h = I h λ µ, applying Proposition 2 with s u = 1, s p = s λ = 0 and recalling that
(|v| 2,F +|q| 1,F +|µ| 1/2,Γ ) ≤ C|ϕ | 3/2,Γ (28) thanks to the elliptic regularity of the Stokes problem, yields (25). u t
2.2 P 1 − P 0 velocity-pressure spaces with interior penalty stabilization.
Let us now choose P 1 FE for V h and P 0 for Q h and add interior penalty (IP) stabi- lization to the Haslinger-Renard method. The method becomes:
Find (u h , p h , λ h ) ∈ V h × Q h ×W h such that
A HR−IP (u h , p h , λ h ;v h , q h , µ h ) = L(v h , µ h ), ∀(v h ,q h , µ h ) ∈ V h ×Q h ×W h , (29) where
A HR−IP (u, p,λ ; v, q, µ) = A(u, p,λ ;v, q, µ)
−γ 0 h Z
Γ
(λ + 2D( u)n b − pn) · (µ +2D( v)n b − qn) − θh ∑
E∈E
eh
Z
E
[p][q]
V h is continuous P 1 FE space on mesh T h e , Q h is P 0 FE space on mesh T h e , and W h
is P 0 FE space on mesh T h Γ , cf. (7).
Note that the IP stabilization is applied to the pressure in the interior on F as well as on the cut elements. The analysis of this method is similar to that of the previous one (15) and we give immediately the final result:
Theorem 2. Under Assumptions A and B, γ 0 > 0 small enough, any θ > 0, and (u, p, λ ) ∈ H 2 (F) d × L 2 0 (F) × H
12(Γ ), the a priori error estimates (24) and (25) hold for method (29).
Proof. We shall not repeat all the technical details but only point out some important changes that should be made in Propositions 3–5 and the inf-sup lemma from the preceding section in order to adapt them to the the analysis of method (29):
• The estimate of Proposition 4 should be changed to hkq h k 2 0,Γ ≤ C
kq h k 2 0,F +h ∑ E∈E
heR
E [q h ] 2
This can be proved observing on any bad element T ∈ T h Γ sharing an edge E with its good neighbor T 0
kq h k 0,Γ
T= p
|Γ T | |(q h ) |T | ≤ p
|Γ T |(|[q h ] E | + |(q h ) |T
0|)
= p
|Γ T | 1
p |E | k[q h ]k 0,E + 1
p |T 0 | kq h k 0,T
0!
≤C
k[q h ]k 0,E + 1
√
h kq h k 0,T
0)
The case of a bad element that does not share an edge with its good neighbor can be treated similarly by introducing a chain of elements connecting T to T 0 . The case when T ∈ T h Γ is “good” itself is trivial.
• The term h 2 | p| 1,F
eh
in the triple norm in Lemma 1 should be replaced by h ∑ E∈E
eh
R E [ p] 2
• The treatment (19) of the velocity-pressure term inside the proof of Lemma 1 is now replaced by
− Z
F
p h divI h 0 v p = k p h k 2 0,F + Z
F
p h div(v p − I h 0 v p )
= k p h k 2 0,F + ∑
E∈E
eh
Z
E∩F
[p h ]n · (v p − I h 0 v p )
and the bound ∑ E∈E
hekv p − I h 0 v p k 2 0,E ≤ Ch|v p | 1,F which is proved as in Proposi- tion 5.
u t
2.3 Taylor-Hood spaces.
We now choose P k (resp. P k−1 ) FE space with k ≥ 2 for V h (resp. Q h ). These are well
known Taylor-Hood spaces which satisfy the discrete inf-sup conditions in the usual
setting and thus no stabilization for pressure “in the bulk” is needed. Intuitively, some extra stabilization should be now added for the pressure on the cut triangles.
We thus propose the following modification of the Haslinger-Renard method for Taylor-Hood spaces:
Find (u h , p h , λ h ) ∈ V h ×Q h ×W h such that
A HR−T H (u h , p h , λ h ; v h , q h , µ h ) = L(v h , µ h ), ∀(v h , q h , µ h ) ∈ V h × Q h ×W h , (30) where
A HR−T H (u, p, λ ; v , q, µ) = A(u, p, λ ;v, q, µ)
−γ 0 h Z
Γ
(λ +D( u)n b − pn) b · (µ +D( b v)n − b qn) V h is continuous P k FE space on mesh T h e , Q h (resp. W h ) is continuous P k−1 FE space on mesh T h e (resp. T h Γ ) for k ≥ 2, cf. (7). The notation b · stands here again for the “robust reconstruction” from Definition 1. We emphasize that it is applied here not only to the velocity, but also to pressure, unlike versions of the method (15) and (29) studied above.
The analysis of this method will be done under more restrictive assumptions than that of the previous ones:
Assumption C. The dimension is d = 2, F h i contains at least 3 triangles, Γ is a curve of class C 2 , and the mesh T h is sufficiently fine (with respect to the curvature of Γ ).
Remark 3. Assumption C covers Assumption B, cf Remark 2.
We shall tacitly assume Assumption C in all the Propositions until the end of this Section. Proposition 3 will be reused in the analysis of the present case but Proposition 4 should be replaced with the following
Proposition 6. For all q h ∈ Q h one has
hk q b h k 2 0,Γ ≤ Ckq h k 2 0,F .
The proof is a straight-forward adaptation of Proposition 3 to the pressure space.
Another important ingredient in our analysis will be the discrete inf-sup condi- tion, cf. Proposition 10 below. We recall first a well-known auxiliary result:
Proposition 7. The exists a mesh independent constant β > 0 such that for any q h ∈ Q h
β h|q h | 1,F
ih
≤ sup
v
h∈V
hiR
F q h div v h
|v h | 1,F
i h(31) where V h i = V h ∩ (H 0 1 (F h i )) d .
This result is customarily applied to the analysis of FE discretization of the
Stokes equations via the Verf¨urth trick [9]. The proof in the 2D case under the as-
sumption that the mesh contains at least 3 triangles can be found in [2]. We note in
passing that a 3D generalization in a similar context is presented in [11].
Let B Γ h := F \ F h i and note that the boundary of B Γ h consists of ∂ F h i and Γ . Proposition 8. Let p h ∈ Q h and v ∈ H 1 (B Γ h ) vanishing on Γ . Then
Z
∂ F
ih
|p h v| ≤ Ck p h k 0,B
Γ h|v| 1,B
Γh
(32)
Proof. Take any triangle T ∈ T h Γ such that one of its sides E is an edge on ∂ F h i . Introduce the polar coordinates (r, ϕ) centered at the vertex O of T opposite to side E (thus O lies outside F). The part of T inside F can be represented in these coor- dinates as
F T = {(r , ϕ) such that α < ϕ < β , r Γ (ϕ) < r < r i (ϕ)}
with r Γ (ϕ ) and r i (ϕ) representing, respectively, Γ and E ⊂ ∂ F h i . In view of As- sumption C, r Γ (ϕ) is a C 2 function and there are positive numbers r min and r max such that r min ≤ r Γ (ϕ ) < r i (ϕ ) ≤ r max for all ϕ ∈ [α, β ]. There are 2 options: ei- ther Γ T is very close to edge E so that r r
maxmin
≤ ρ, or F T covers a significant portion of T so that |F T | ≥ θ|T |. The positive numbers ρ and θ here can be chosen in a mesh-independent manner.
We start with the first option: r r
maxmin
≤ ρ. Using the notations above and recalling v = 0 at r = r Γ (ϕ) gives
Z
E
|p h v| ≤ C Z β
α
(|p h v|r) r=r
i(ϕ) dϕ = C Z β
α Z r
i(ϕ)
r
Γ(ϕ)
∂ |p h vr|
∂ r drdϕ
≤ C Z β
α Z r
i(ϕ)
r
Γ(ϕ)
∂ p h
∂ r v
rdrdϕ + k p h k 0,F
Tk∇vk 0,F
T+ 1 r min
kp h k 0,F
Tkvk 0,F
TWe set l(ϕ) = r i (ϕ) − r Γ (ϕ) and bound the first integral above using, for any ϕ fixed, an inverse inequality for p h on the interval (r Γ (ϕ), r i (ϕ)) and Poincar´e in- equality for v on the same interval (recall that v = 0 at r = r Γ (ϕ ))
Z β α
Z r
i(ϕ) r
Γ(ϕ)
∂ p h
∂ r v
rdrdϕ ≤ r max Z β
α
Z r
i(ϕ) r
Γ(ϕ)
∂ p h
∂ r 2
dr
!
12Z r
i
(ϕ) r
Γ(ϕ)
v 2 dr
12dϕ
≤ Cr max Z β
α
1 l(ϕ)
Z r
i(ϕ)
r
Γ(ϕ)
p 2 h dr
12× l(ϕ ) Z r
i(ϕ)
r
Γ(ϕ)
∂ v
∂ r 2
dr
!
12d ϕ
≤ C r max
r min k p h k 0,F
Tk∇vk 0,F
T(33) Recalling the bound on r r
maxmin
(which implies, in particular, r min ≥ ρ h ) we conclude
Z
E
| p h v| ≤ C
kp h k 0,F
Tk∇vk 0,F
T+ 1
h k p h k 0,F
Tkvk 0,F
T(34) On the other hand, if |F T | ≥ θ |T |, extending v by 0 outside F, applying Propo- sition 1 and an inverse inequality (valid on the whole triangle T ) also yields (34):
Z
E
|p h v| ≤ √
hk p h vk 0,∂ T ≤ C(k p h vk 0,T + h| p h v| 1,T )
≤ C(k p h k ∞,T kvk 0,F
T+ hk∇p h k ∞,T kvk 0,F
T+ hk p h k ∞,T k∇vk 0,F
T)
≤ C
k p h k 0,F
Tk∇vk 0,F
T+ 1
h kp h k 0,F
Tkvk 0,F
TSumming (34) over all T ∈ T h Γ having a side on ∂ F h i yields Z
∂ F
ih
| p h v| ≤ Ckp h k 0,B
Γ hk∇vk 0,B
Γ h+ 1 h kvk 0,B
Γh
Recall that v = 0 on Γ and the width of B Γ h is of order h, so that kvk 0,B
Γh
≤
Chk∇vk 0,B
Γh
by a Poincar´e inequality. We have thus proved (32). u t
Proposition 9. Under Assumption C, there exists a continuous piecewise linear vector-valued function ψ h on mesh T h e such that ψ h · n ≥ 0 on Γ , div ψ h ≥ δ 0 on all the triangles of T h Γ , and divψ h ≥ −δ 1 h on all the triangles of T h i with some constants δ 0 , δ 1 > 0. Moreover, there is a constant C > 0 such that for any p h ∈ Q h
|p h ψ h | 1,F + 1
√
h kp h ψ h k 0,Γ ≤ Ck p h k 0,F (35) Proof. Let B ζ = {x ∈ R 2 / dist(x, Γ ) < ζ } for any ζ > 0. Thanks to the smoothness of Γ , one can introduce orthogonal coordinates (ξ 1 , ξ 2 ) on B η with some mesh- independent η > 0 such that ξ 2 = 0 on Γ and ξ 2 < 0 on F ∩ B η . Let e i denote the basis vectors of these coordinates (e i = ∂ r/∂ ξ i ). Assuming η > h, let us introduce the vector-valued function given on B η by ψ = ξ 2 e 2 for |ξ 2 | < h, ψ = −h ξ η−h
2+η e 2
for −η < ξ 2 < −h, left undefined for h < ξ 2 < η, and extended by 0 on F \ B η . Let ψ h = I h ψ where I h is the standard nodal interpolation operator to continuous P 1 FE space on T h e .
Clearly, divψ = 1 on Γ , hence divψ ≥ 1 2 on B h by continuity for sufficiently small h. Since B h ⊃ F h Γ , one observes on all the triangles of T h Γ
div ψ h ≥ 1
2 −div(ψ − ψ h ) ≥ 1
2 −Chkψk W
2,∞(B
h) = δ 0 > 0
since h is sufficiently small and ψ is sufficiently smooth thanks to the hypothesis on
Γ . Turning to the triangles of T h i we make the following observation: if Γ were a
straight line, ψ · e 1 would vanish, and ψ · e 2 would be linear on −η < ξ 2 < −h with
the slope − η−h h so that divψ h ≥ − η−h h on the triangles of T h i . The actual geometry
of Γ introduces the corrections of order O(h 2 ) into this argument so that one still has div ψ h ≥ −δ 1 h on these triangles. We also observe, by construction of ψ h ,
kψ h k ∞,F
eh
≤ Ch and k∇ψ h k ∞,F
eh
≤ C
Let us now take any p h ∈ Q h . By the bounds on ψ h proven above and by an inverse inequality we deduce on any triangle T ∈ T h i
|p h ψ h | 1,T ≤ Ch|p h | 1,T +Ckp h k 0,T ≤ Ck p h k 0,T (36) A similar bound also holds on any cut triangle T ∈ T h Γ . One cannot use a straight- forward inverse inequality in this case, since the width of the cut portion F T , say ε, can be much smaller than h. However, the construction of ψ h implies in such a situation kψ h k ∞,F
T≤ Cε. Combining this with the inverse inequality |p h | 1,F
T≤
C
ε kp h k 0,F
Tone arrives at (36). Summing this over all the triangles T ∈ T h i yields
|p h ψ h | 1,F ≤ Ck p h k 0,F . Finally, in order to bound p h ψ h in L 2 (Γ ) we recall. Hence k p h ψ h k 1,Γ ≤ k p h ψ h k 0,∂ F
ih
+C √
h| p h ψ h | 1,B
Γh
≤ Chkp h k 0,∂ F
ih
+C √
hk p h k 0,F
By scaling, kp h k 0,E ≤ √ C
h kp h k 0,T for any edge E ∈ ∂ F h adjacent to a triangle T ∈ T h i . The summation over all such edges yields kp h k 0,∂ F
ih
≤ √ C
h k p h k 0,F
ih
and
consequently kp h ψ h k 1,Γ ≤ C √
hk p h k 0,F . u t
Proposition 10. For any p h ∈ Q h there exists v h p ∈ V h such that
− Z
F
p h divv h p = k p h k 2 0,F and |v h p | 1,F + 1
√ h kv h p k 0,Γ ≤ Ck p h k 0,F (37) Proof. The continuous inf-sup condition implies that for all p h ∈ Q h there exists v p ∈ (H 0 1 (F)) d satisfying (18). Recalling the interpolation operator I h 0 from Propo- sition 5, we observe
− Z
F
p h div I h 0 v p = − Z
F
hip h divI h 0 v p = k p h k 2 0,F
i h+ Z
F
hip h div(v p − I h 0 v p )
= k p h k 2 0,F
i h+ Z
∂ F
ih
p h n · v p − Z
F
ih
∇p h · (v p − I h 0 v p )
≥ kp h k 2 0,F
ih
−Ck p h k 0,B
Γ h|v p | 1,B
Γh
−Ch|p h | 1,F
i h|v p | 1,F
ih
≥ kp h k 2 0,F
i h−C|v p | 1,F
i hkp h k 2 0,B
Γh