The Authors c
DOI: 10.1142/S0218202520500128
The Stokes complex for Virtual Elements in three dimensions
L. Beir˜ ao da Veiga
∗, F. Dassi
†and G. Vacca
‡Dipartimento di Matematica e Applicazioni, Universit` a di Milano Bicocca, Via Roberto Cozzi 55, 20126 Milano, Italy
∗
lourenco.beirao@unimib.it
†
franco.dassi@unimib.it
‡
giuseppe.vacca@unimib.it
Received 29 January 2019 Revised 12 November 2019 Accepted 14 November 2019
Published 23 March 2020 Communicated by F. Brezzi
This paper has two objectives. On one side, we develop and test numerically divergence- free Virtual Elements in three dimensions, for variable “polynomial” order. These are the natural extension of the two-dimensional divergence-free VEM elements, with some modification that allows for a better computational efficiency. We test the element’s performance both for the Stokes and (diffusion dominated) Navier–Stokes equation.
The second, and perhaps main, motivation is to show that our scheme, also in three dimensions, enjoys an underlying discrete Stokes complex structure. We build a pair of virtual discrete spaces based on general polytopal partitions, the first one being scalar and the second one being vector valued, such that when coupled with our velocity and pressure spaces, yield a discrete Stokes complex.
Keywords: Virtual elements; Stokes complex; Navier–Stokes equation; polygonal meshes.
AMS Subject Classification: 65N30, 76D05
1. Introduction
The Virtual Element Method (VEM) was introduced in Refs. 10 and 12 as a generalization of the Finite Element Method (FEM) allowing for general poly- topal meshes. Nowadays the VEM technology has reached a good level of suc- cess; among the many papers we here limit ourselves in citing a few sample works.
3,6,11,21,22,34,41,51It was soon recognized that the flexibility of VEM allows to build elements that hold peculiar advantages also on more standard grids. One main example is that of “divergence-free” Virtual Elements for Stokes-type problems, ini- tiated in Refs. 5 and 17 and further developed in Refs. 18 and 57. An advantage of
‡
Corresponding author.
This is an Open Access article published by World Scientific Publishing Company. It is distributed under the terms of the Creative Commons Attribution 4.0 (CC BY) License which permits use, distribution and reproduction in any medium, provided the original work is properly cited.
477
Math. Models Methods Appl. Sci. 2020.30:477-512. Downloaded from www.worldscientific.com by 193.207.133.185 on 01/08/21. Re-use and distribution is strictly not permitted, except for Open Access articles.
the proposed family of Virtual Elements is that, without the need of a high minimal polynomial degree as it happens in conforming FEM, it is able to yield a discrete divergence-free (conforming) velocity solution, which can be an interesting asset as explored for Finite Elements in Refs. 44, 45, 46, 48 and 53. For a wider look in the literature, other VEM for Stokes-type problems can be found in Refs. 28, 29, 31, 35, 42 and 50 while different polygonal methods for the same problem in Refs. 24, 33, 38 and 49.
This paper has two objectives. On one side, we develop and test numeri- cally for the first time the divergence-free Virtual Elements in three dimensions (for variable “polynomial” order k). These are the natural extension of the two- dimensional (2D) VEM elements of Refs. 17 and 18, with some modification that allows for a better computational efficiency. We first test the element’s performance for the Stokes and (diffusion dominated) Navier–Stokes equation for different kind of meshes (such as Voronoi, but also cubes and tetrahedra) and then show a spe- cific test that underlines the divergence-free property (in the spirit of Refs. 18 and 48).
The second, and perhaps main, motivation is to show that our scheme, also in three dimensions, enjoys an underlying discrete Stokes complex structure. That is, a discrete structure of the kind
R −−−−→ W i h −−−−−→ Σ ∇ h −−−−→ V
curlh −−−−→ Qdiv h −−−−→ 0,0
where the image of each operator exactly corresponds to the kernel of the following one, thus mimicking the continuous complex
R −−−−→ H i 1(Ω) −−−−−→ Σ(Ω) ∇ −−−−→ [H
curl 1(Ω)]
3 −−−−→ L
div 2(Ω) −−−−→ 0,
0
with Σ(Ω) denoting functions of L
2(Ω) with curl in H
1(Ω).
4,43Discrete Stokes com- plexes have been extensively studied in the literature of Finite Elements since the presence of an underlying complex implies a series of interesting advantages (such as the divergence-free property), in addition to guaranteeing that the discrete scheme is able to correctly mimic the structure of the problem under study.
7–9,27,36,37,39,40,52
This motivation is therefore mainly theoretical in nature, but it serves the impor- tant purpose of giving a deeper foundation to our method. We therefore build a pair of virtual discrete spaces based on general polytopal partitions of Ω, the first one W h , conforming in H
1(Ω) and the second one Σ h conforming in Σ(Ω), such that, when coupled with our velocity and pressure spaces, yield a discrete Stokes com- plex. We also build a set of carefully chosen associated degrees of freedom (DoFs).
This construction was already developed in two dimensions in Ref. 19, but here
things are more involved due to the much more complex nature of the curl oper-
ator in 3D when compared to 2D. In this respect we must underline that, to the
best of the authors knowledge, no Stokes exact complex of the type above exists
for conforming Finite Elements in three dimensions. There exist FEM for different
(more regular) Stokes complexes, but at the price of developing cumbersome ele-
ments with a large minimal polynomial degree (we refer to Ref. 46 for an overview)
Math. Models Methods Appl. Sci. 2020.30:477-512. Downloaded from www.worldscientific.com by 193.207.133.185 on 01/08/21. Re-use and distribution is strictly not permitted, except for Open Access articles.
or using a subdivision of the element.
32We finally note that our construction holds for a general “polynomial” order k ≥ 2.
The paper is organized as follows. After introducing some notation and prelimi- naries in Sec. 2, the Virtual Element spaces and the associated DoFs are deployed in Sec. 3. In Sec. 4, we prove that the introduced spaces constitute an exact complex.
In Sec. 5, we describe the discrete problem, together with the associated projec- tors and bilinear forms. In Sec. 6, we provide the numerical tests. Finally, in the appendix we prove a useful lemma.
2. Notations and Preliminaries
In this section, we introduce some basic tools and notations useful in the construc- tion and theoretical analysis of VEMs.
Throughout the paper, we will follow the usual notation for Sobolev spaces and norms.
1Hence, for an open bounded domain ω, the norms in the spaces W p s (ω) and L p (ω) are denoted by · Wps(ω) and · Lp(ω), respectively. Norm and seminorm in H s (ω) are denoted respectively by · s,ω and |·| s,ω , while ( ·, ·) ω and · ω denote the L
2-inner product and the L
2-norm (the subscript ω may be omitted when ω is the whole computational domain Ω).
, respectively. Norm and seminorm in H s (ω) are denoted respectively by · s,ω and |·| s,ω , while ( ·, ·) ω and · ω denote the L
2-inner product and the L
2-norm (the subscript ω may be omitted when ω is the whole computational domain Ω).
2.1. Basic notations and mesh assumptions
From now on, we will denote with P a general polyhedron having V vertexes V ,
e edges e and f faces f .
For each polyhedron P , each face f of P and each edge e of f we denote with:
— n f P (respectively, n P ) the unit outward normal vector to f (respectively, to ∂P ),
— n e f (respectively, n f ) the unit vector in the plane of f that is normal to the edge e (respectively, to ∂f ) and outward with respect to f ,
— t e f (respectively, t f ) the unit vector tangent to e (respectively, to ∂f ) counter- clockwise with respect to n f P ,
— τ f1 and τ f2 two orthogonal unit vectors lying on f and such that τ f1∧ τ f2 = n f P , i.e. τ
1f and τ
2f constitute the axis of a local coordinate system on f (see also Sec. 2.2),
two orthogonal unit vectors lying on f and such that τ f1∧ τ f2 = n f P , i.e. τ
1f and τ
2f constitute the axis of a local coordinate system on f (see also Sec. 2.2),
= n f P , i.e. τ
1f and τ
— t e a unit vector tangent to the edge e.
Notice that the vectors t e f , t f , τ f1 and τ f2 actually depend on P (we do not write such dependence explicitly for lightening the notations).
actually depend on P (we do not write such dependence explicitly for lightening the notations).
In the following O will denote a general geometrical entity (element, face, edge) having diameter h O .
Let Ω be the computational domain that we assume to be a contractible poly- hedron (i.e. simply connected polyhedron with boundary ∂Ω which consists of one connected component), with Lipschitz boundary. Let {Ω h } h be a sequence of decom- positions of Ω into general polyhedral elements P where h := sup P ∈Ωhh P .
Math. Models Methods Appl. Sci. 2020.30:477-512. Downloaded from www.worldscientific.com by 193.207.133.185 on 01/08/21. Re-use and distribution is strictly not permitted, except for Open Access articles.
We suppose that for all h, each element P in Ω h is a contractible polyhedron that fulfills the following assumptions:
(A1) P is star-shaped with respect to a ball B P of radius ≥ h P ,
(A2) every face f of P is star-shaped with respect to a disk B f of radius ≥ h P , (A3) every edge e in P satisfies h e ≥ h P ,
where is a uniform positive constant. We remark that the hypotheses (A1)–
(A3), though not too restrictive in many practical cases, can be further relaxed, as investigated in Refs. 16, 25, 26 and 30.
The total number of vertexes, edges, faces and elements in the decomposition Ω h are denoted respectively with L V , L e , L f , L P .
For any mesh object O and for n ∈ N we introduce the spaces:
• P n ( O) the polynomials on O of degree ≤ n (with the extended notation P −1 ( O) = {0}),
• P n\m ( O) := P n ( O)\P m ( O) for m < n, denotes the polynomials in P n ( O) with monomials of degree strictly greater than m.
Moreover, for any mesh object O of dimension d we define
π n,d := dim( P n ( O)) = dim(P n ( R d )), (2.1) and thus dim( P n\m ( O)) = π n,d − π m,d .
In the following the symbol will denote a bound up to a generic positive constant, independent of the mesh size h, but which may depend on Ω, on the
“polynomial” order k and on the shape constant in assumptions (A1)–(A3).
2.2. Vector calculus and de Rham complexes
Here below we fix some additional notation of the multivariable calculus.
Three-dimensional (3D) operators. In three dimensions we denote with x = (x
1, x
2, x
3) the independent variable. With a usual notation the symbols ∇ and Δ denote the gradient and Laplacian for scalar functions, while Δ, ∇, ε, div and curl denote the vector Laplacian, the gradient and the symmetric gradient operator, the divergence and the curl operator for vector fields. Note that on each polyhedron P the following useful polynomial decompositions hold:
[ P n (P )]
3= ∇(P n+1 (P )) ⊕ (x ∧ [P n−1 (P )]
3), (2.2) [ P n (P )]
3= curl( P n+1 (P )) ⊕ x P n−1 (P ). (2.3) Tangential operators. Let f be a face of a polyhedron P , we denote with x f :=
(x f 1 , x f 2 ) the independent variable (i.e. a local coordinate system on f associated
with the axes τ
1f and τ2f introduced above). The tangential differential operators
are denoted by a subscript f . Therefore, the symbols ∇ f and Δ f denote the gradient
and Laplacian for scalar functions. For instance if f lies on the plane x
3= 0 and τ
1f
Math. Models Methods Appl. Sci. 2020.30:477-512. Downloaded from www.worldscientific.com by 193.207.133.185 on 01/08/21. Re-use and distribution is strictly not permitted, except for Open Access articles.
are denoted by a subscript f . Therefore, the symbols ∇ f and Δ f denote the gradient
and Laplacian for scalar functions. For instance if f lies on the plane x
3= 0 and τ
1f
Math. Models Methods Appl. Sci. 2020.30:477-512. Downloaded from www.worldscientific.com by 193.207.133.185 on 01/08/21. Re-use and distribution is strictly not permitted, except for Open Access articles.
and τ
2f are associated with the coordinate system (x1, x
2) then ∇ f ϕ = ∂ϕ
∂x
1, ∂x ∂ϕ2 and Δ f ϕ = ∂ ∂x2ϕ
2
ϕ
21
+ ∂2ϕ
∂x
22, while ∇ϕ = ∂ϕ
∂x
1, ∂x ∂ϕ2, ∂x ∂ϕ3
and Δϕ = ∂ ∂x2ϕ
2
1 + ∂2ϕ
ϕ
∂x
22+ ∂2ϕ
∂x
23. In the same way Δ f , ∇ f , and div f denote the vector Laplacian, the gradient operator and the divergence for vector fields on f (with respect to the coordinate x f ). Furthermore for a scalar function ϕ and a vector field v := (v
1, v
2) we set
rot f ϕ :=
∂ϕ
∂x f 2 , − ∂ϕ
∂x f 1
and rot f v := ∂v
2∂x f 1 − ∂v
1∂x f 2 . The following two-dimensional polynomial decompositions hold
[ P n (f )]
2= ∇ f ( P n+1 (f )) ⊕ x ⊥ f P n−1 (f ), [ P n (f )]
2= rot f ( P n+1 (f )) ⊕ x f P n−1 (f ), where x ⊥ f := (x f 2 , −x f 1 ).
Given a 3D vector-valued function v defined in P , the tangential component v f
of v with respect to the face f is defined by v f := v − (v · n f P )n f P .
Noticing that v f is a 3D vector field tangent to f , with a slight abuse of notations we define the 2D vector field v τ on ∂P , such that on each face f its restriction to the face f satisfies
v τ (x f ) = v f (x).
The 3D function v and its 2D tangential restriction v τ are related by the curl-rot compatibility condition
curl v · n f P = rot f v τ on any f ∈ ∂P. (2.4) Moreover, the Gauss theorem ensures the following rot-tangent component relation
f
rot f v τ df =
∂f
v · t f ds for any f ∈ ∂P . (2.5) Finally, for any scalar function v defined in P , we denote with v τ the scalar function defined in ∂P such that
v τ (x f ) := v(x) |f on each face f ∈ ∂P .
On a generic mesh object O with geometrical dimension d, on a face f and on a polyhedron P we define the following functional spaces:
L
20( O) :=
v ∈ L
2( O) s.t.
O v dO = 0
, Z(O) := {v ∈ [H
1( O)]
2s.t. div v = 0 in O}, H(div, O) := {v ∈ [L
2( O)] d with div v ∈ L
2( O)},
H(rot, f) := {v ∈ [L
2(f )]
2with rot f v ∈ L
2(f )},
Math. Models Methods Appl. Sci. 2020.30:477-512. Downloaded from www.worldscientific.com by 193.207.133.185 on 01/08/21. Re-use and distribution is strictly not permitted, except for Open Access articles.
H(curl, P ) := {v ∈ [L
2(P )]
3with curl v ∈ [L
2(P )]
3}, Σ(P ) := {v ∈ [L
2(P )]
3with curl v ∈ [H
1(P )]
3},
Ψ(P ) := {v ∈ [L
2(P )]
3s.t. div v ∈ H
1(P ), curl v ∈ [H
1(P )]
3} with the “homogeneous counterparts”
Z
0( O) := {v ∈ Z(O) s.t. v = 0 on ∂O},
H
0(div, O) := {v ∈ H(div, O) s.t. v · n O = 0 on ∂O}, H
0(rot, f ) := {v ∈ H(rot, f ) s.t. v · t f = 0 on ∂f}, H
0(curl, P ) := {v ∈ H(curl, P ) s.t. v τ = 0 on ∂P },
Σ
0(P ) := {v ∈ Σ(P ) s.t. v τ = 0 and curl v = 0 on ∂P }, Ψ
0(P ) :=
v ∈ Ψ(P ) s.t.
∂P
v · n P df = 0, v τ = 0 and curl v = 0 on ∂P
.
Remark 2.1. Notice that for each face f ∈ ∂P , the vector fields v f and v ∧ n f P are different. In fact both lie in the plane of the face f , but v f is (π/2)-rotation in f (with respect to the axes τ
1and τ
2) of v ∧ n f P . For instance let f lie on the plane x
3= 0 with n f P = (0, 0, 1), then for a vector field v = (v
1, v
2, v
3) it holds that v f = (v
1, v
2, 0) and v ∧ n f P = (v
2, −v
1, 0). Therefore, both v f and v ∧ n f P lie in the plane of f and v f is (π/2)-rotation of v ∧ n f P (with respect to the orientation given by n f P ). However, v f = 0 if and only if v ∧ n f P = 0. For that reason in the definition of Ψ
0(P ), we consider a slightly different, but substantially equivalent, set of homogeneous boundary conditions to that considered in literature.
4,20,43Recalling that a sequence is exact if the image of each operator coincides with the kernel of the following one, and that P is contractible, from (2.2) and (2.3) it is easy to check that the following sequence is exact:
R −−−→ P i n+2 (P ) −−−−→ [P ∇ n+1 (P )]
3−−−−→ [P
curln (P )]3 −−−−→ P
div n−1 (P ) −−−→ 0,0
(2.6) where i denotes the mapping that to every real number r associates the constant function identically equal to r and 0 is the mapping that to every function associates the number 0.
(2.6) where i denotes the mapping that to every real number r associates the constant function identically equal to r and 0 is the mapping that to every function associates the number 0.
The 3D de Rham complex with minimal regularity (in a contractible domain Ω) is provided by (see for instance Refs. 8 and 37)
R −−−→ H i 1(Ω) −−−−−→ H(curl, Ω) ∇ −−−−→ H(div, Ω)
curl −−−−→ L
div 2(Ω) −−−→ 0.
0
In this paper, we consider the de Rham sub-complex with enhanced smoothness
39
R −−−−→ H i 1(Ω) −−−−−→ Σ(Ω) ∇ −−−−→ [H
curl 1(Ω)]
3 −−−−→ L
div 2(Ω) −−−−→ 0,
0
(2.7)
Math. Models Methods Appl. Sci. 2020.30:477-512. Downloaded from www.worldscientific.com by 193.207.133.185 on 01/08/21. Re-use and distribution is strictly not permitted, except for Open Access articles.
that is suitable for the Stokes (Navier–Stokes) problem. Therefore, our goal is to construct conforming virtual element spaces
W h ⊆ H
1(Ω), Σ h ⊆ Σ(Ω), V h ⊆ [H
1(Ω)]
3, Q h ⊆ L
2(Ω) (2.8) that mimic the complex (2.7), i.e. are such that
R −−−−→ W i h −−−−−→ Σ ∇ h −−−−→ V
curlh −−−−→ Qdiv h −−−−→ 00 (2.9) is an exact sub-complex of (2.7).
(2.9) is an exact sub-complex of (2.7).
3. The Virtual Element Spaces
This section is devoted to the construction of conforming virtual element spaces (2.8) that compose the virtual sub-complex (2.9). As we will see, the space W h
consists of the lowest degree 3D nodal VEM space,
2,15whereas the spaces V h and Q h (that are the spaces actually used in the discretization of the problem) are the 3D counterparts of the inf-sup stable couple of spaces introduced in Refs. 18 and 57. Therefore, the main novelty of this section is in the construction of the Σ-conforming space Σ h .
In order to facilitate the reading, we present the spaces in the reverse order, from right to left in the sequence (2.9). In particular, in accordance with (2.9), the space Σ h will be carefully designed to fit curl Σ h ⊆ V h .
We stress that the readers mainly interested on the virtual element approxima- tion of the 3D Navier–Stokes equation (and not on the virtual de Rham sequence) can skip Secs. 3.3, 3.4 and 4.
One essential idea in the VEM construction is to define suitable (computable) polynomial projections. For any n ∈ N and each polyhedron/face O we introduce the following polynomial projections:
• the L
2-projection Π
0,On : L2( O) → P n ( O), defined for any v ∈ L
2( O) by
O q n (v − Π0,On v)dO = 0 for all q n ∈ P n ( O), (3.1) with obvious extension for vector functions Π0,On : [L2( O)]
3 → [P n ( O)]
3, and tensor functions Π
0,On : [L2( O)]
3×3→ [P n ( O)]
3×3,
n : [L2( O)]
3 → [P n ( O)]
3, and tensor functions Π
0,On : [L2( O)]
3×3→ [P n ( O)]
3×3,
( O)]
3×3→ [P n ( O)]
3×3,
• the H
1-seminorm projection Π ∇,O n : H
1( O) → P n ( O), defined for any v ∈ H
1( O) by
⎧ ⎪
⎪ ⎪
⎨
⎪ ⎪
⎪ ⎩
O ∇ q n · ∇(v − Π ∇,O n v)dO = 0 for all q n ∈ P n ( O),
∂O (v − Π ∇,O n v)dσ = 0,
(3.2)
with obvious extension for vector functions Π ∇,O n : [H
1( O)]
3→ [P n ( O)]
3. Let k ≥ 2 be the polynomial degree of accuracy of the method. We recall that, in standard finite element fashion, the VEM spaces are first defined elementwise and then assembled globally.
Math. Models Methods Appl. Sci. 2020.30:477-512. Downloaded from www.worldscientific.com by 193.207.133.185 on 01/08/21. Re-use and distribution is strictly not permitted, except for Open Access articles.
3.1. Scalar L
2-conforming space
We start our construction with the rightmost discrete space Q h in (2.9). Since we are not requiring any smoothness on Q h , the local space Q h (P ) is simply defined by
Q h (P ) := P k−1 (P ),
having dimension (cf. (2.1)) dim(Q h (P )) = π k−1,3 . The corresponding DoFs are chosen, defining for each q ∈ Q h (P ) the following linear operators
• D Q : the moments up to order k − 1 of q, i.e.
P
qp k−1 dP for any p k−1 ∈ P k−1 (P ).
The global space is given by
Q h := {q ∈ L
2(Ω) s.t. q |P ∈ Q h (P ) for all P ∈ Ω h }. (3.3) It is straightforward to see that the dimension of Q h is
dim(Q h ) = π k−1,3 L P . (3.4)
3.2. Vector H
1-conforming VEM space
The subsequent space in the de Rham complex (2.9) is the vector-valued H
1- conforming virtual element space V h . The space V h is a 3D version of the space
18(see also the guidelines in the appendix of Ref. 17). We make an extensive use of the enhanced technique
2in order to achieve the computability of the polynomial projections stated in Proposition 5.1.
We first consider on each face f of the element P , the face space
B k (f ) := {v ∈ H
1(f ) s.t. (i) v |∂f ∈ C
0(∂f ), v |e ∈ P k (e) for all e ∈ ∂f , (ii) Δ f v ∈ P k+1 (f ),
(iii) (v − Π ∇,f k v, p k+1 ) f = 0 for all p k+1 ∈ P k+1\k−2 (f )} (3.5) and the boundary space
B k (∂P ) := {v ∈ C
0(∂P ) such that v |f ∈ B k (f ) for any f ∈ ∂P }
that is a modification of the standard boundary nodal VEM.
13Indeed the “super- enhanced” constraints (condition iii) in the definition (3.5)) are needed to exactly compute the polynomial projection Π
0,fk+1 (see Proposition 5.1).
On the polyhedron P we first define the virtual element space V h (P ) V h (P ) := {v ∈ [H
1(P )]
3s.t. (i) v |∂P ∈ [B k (∂P )]
3,
(ii) Δv + ∇s ∈ x ∧ [P k−1 (P )]
3for some s ∈ L
20(P ),
(iii) div v ∈ P k−1 (P )}, (3.6)
Math. Models Methods Appl. Sci. 2020.30:477-512. Downloaded from www.worldscientific.com by 193.207.133.185 on 01/08/21. Re-use and distribution is strictly not permitted, except for Open Access articles.
and afterwards our velocity space
V h (P ) := {v ∈ V h (P ) s.t. (v − Π ∇,P k v, x ∧ p k−1 ) P = 0
for all p k−1 ∈ [P k−1\k−3 (P )]
3}. (3.7) The definition above is the 3D counterpart of the virtual elements,
18in particular we remark that the enhancing constraints in definition (3.7) are necessary to achieve the computability of the L
2-projection Π
0,Pk (see Proposition 5.1). Moreover, notice that the space V h (P ) contains [P k (P )]3and this will guarantee the good approximation property of the space (cf. Theorem 5.1).
Proposition 3.1. The dimension of V h (P ) is given by
dim(V h (P )) = 3 V + 3(k − 1) e + 3π k−2,2 f + 3π k−2,3 .
Moreover, the following linear operators D
Vsplit into five subsets constitute a set of DoFs for V h (P ):
• D
1V: the values of v at the vertexes of P ,
• D
2V: the values of v at k − 1 distinct points of every edge e of P ,
• D
3V: the face moments of v (split into normal and tangential components)
f
(v · n f P )p k−2 df,
f
v τ · p k−2 df, for all p k−2 ∈ P k−2 (f ) and p k−2 ∈ [P k−2 (f )]
2,
• D
4V: the volume moments of v
P
v · (x ∧ p k−3 )dP for all p k−3 ∈ [P k−3 (P )]
3,
• D
5V: the volume moments of div v
P
(div v) p k−1 dP for all p k−1 ∈ P k−1\0 (P ).
Proof. We only sketch the proof since it follows the guidelines of Proposition 3.1 in Ref. 57 for the analogous 2D space. First of all, recalling (2.1) and polynomial decomposition (2.2), simple computations yield
#D
1V= 3 V , #D
2V= 3(k − 1) e , #D
3V= 3π k−2,2 f ,
#D
4V= 3π k−2,3 − π k−1,3 + 1, #D
5V= π k−1,3 − 1, (3.8) and therefore
#D
V= 3 V + 3(k − 1) e + 3π k−2,2 f + 3π k−2,3 .
Now employing Proposition 2 and Remark 5 in Ref. 2, it can be shown that the DoFs D
1V, D
2V, D
3Vare unisolvent for the space [ B k (∂P )]
3. Therefore, it holds that
dim([ B k (∂P )]
3) = 3 V + 3(k − 1) e + 3π k−2,2 f , (3.9)
Math. Models Methods Appl. Sci. 2020.30:477-512. Downloaded from www.worldscientific.com by 193.207.133.185 on 01/08/21. Re-use and distribution is strictly not permitted, except for Open Access articles.
which in turn implies (recalling (3.6) and (3.7)) dim(V h (P )) ≥ #D
V.
Now the result follows by proving that D
V(v) = 0 implies that v is identically zero, which can be easily shown first working on ∂P and then inside P . As a consequence the linear operators D
Vare unisolvent for V h and in particular dim(V h (P )) =
#D
V.
The global space V h is defined by gluing the local spaces with the obvious associated sets of global DoFs:
V h := {v ∈ [H
1(Ω)]
3s.t. v |P ∈ V h (P ) for all P ∈ Ω h }. (3.10) The dimension of V h is given by
dim(V h ) = 3L V + 3(k − 1)L e + 3π k−2,2 L f + 3π k−2,3 L P . (3.11) We also consider the discrete kernel
Z h :=
v ∈ V h s.t.
Ω