Orthogonality relations of Crouzeix-Raviart and Raviart-Thomas finite element spaces

05/06/2020 ∙ by Sören Bartels, et al. ∙ 0

Identities that relate projections of Raviart-Thomas finite element vector fields to discrete gradients of Crouzeix-Raviart finite element functions are derived under general conditions. Various implications such as discrete convex duality results and a characterization of the image of the projection of the Crouzeix-Ravaiart space onto elementwise constant functions are deduced.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1. Introduction

Recent developments in the numerical analysis of total variation regularized and related nonsmooth minimization problems show that nonconforming and discontinuous finite element methods lead to optimal convergence rates under suitable regularity conditions [ChaPoc19-pre, Bart20a-pre, Bart20b-pre]. This is in contrast to standard conforming methods which often perform suboptimally [BaNoSa15]

. A key ingredient in the derivation of quasi-optimal error estimates are discrete convex duality results which exploit relations between Crouzeix–Raviart and Raviart–Thomas finite element spaces introduced in 

[CroRav73] and [RavTho77]. In particular, assume that is a bounded Lipschitz domain with a partitioning of the boundary into subsets , and let be a regular triangulation of . For a function and a vector field we then have the integration-by-parts formula

Important aspects here are that despite the possible discontinuity of and no terms occur that are related to interelement sides and that the vector field and the function can be replaced by their elementwise averages on the left- and right-hand side, respectively. In combination with Fenchel’s inequality this implies a weak discrete duality relation.

The validity of a strong discrete duality principle has been established in [ChaPoc19-pre, Bart20a-pre] under certain differentiability or more generally approximability properties of minimization problems using the orthogonality relation


within the space of piecewise constant vector fields equipped with the inner product and with and denoting the elementwise application of the gradient and orthogonal projection onto , respectively, denotes the kernel of an operator. The identity implies that if a vector field satisfies

for all with then there exists a vector field such that

Note that this is a stronger implication then the well known result that if is orthogonal to discrete gradients of all Crouzeix–Raviart functions then it belongs to the Raviart–Thomas finite element space. Although strong duality is not required in the error analysis, it reveals a compatibility property of discretizations and indicates optimality of estimates. Moreover, it is related to postprocessing procedures that provide the solution of computationally expensive discretized dual problems via simple postprocessing procedures of numerical solutions of less expensive primal problems, cf. [Mari85, ArnBre85, CarLiu15, Bart20a-pre].

The proof of (1) given in [ChaPoc19-pre] makes use of a discrete Poincaré lemma which is valid if the Dirichlet boundary is empty or if and is connected. In this note we show that (1) can be established for general boundary partitions by avoiding the use of the discrete Poincaré lemma. The new proof is based on the surjectivity property of the discrete divergence operator

This is a fundamental property for the use of the Raviart–Thomas method for discretizing saddle-point problems, cf. [RavTho77, BoBrFo13-book]

. It is an elementary consequence of a projection property of a quasi-interpolation operator

and the surjectivity of the divergence operator onto the space .

Our arguments also provide a dual version of the orthogonality relation (1) which states that


Unless we have that the left-hand side is trivial and hence the identity yields that

i.e., that the projection of Crouzeix–Raviart functions onto elementwise constant functions is a surjection. If then depending on the triangulation both equality or strict inclusion occur. This observation reveals that the discretizations of total-variation regularized problems devised in [ChaPoc19-pre, Bart20a-pre] can be seen as discretizations using elementwise constant functions with suitable nonconforming discretizations of the total variation functional.

The most important consequence of (2) is the strong duality relation for the discrete primal problem defined by minimizing the functional

in the space and the discrete dual problem consisting in maximizing the functional

in the space . The functions and are suitable convex functions with convex conjugates and , we refer the reader to [Bart20a-pre] for details.

This article is organized as follows. In Section 2 we define the required finite element spaces along with certain projection operators. Our main results are contained in Section 3, where we prove the identities (1) and (2) and deduce various corollaries. In the Appendix A we provide a proof of the discrete Poincaré lemma that leads to an alternative proof of the main result under certain restrictions.

2. Preliminaries

2.1. Triangulations

Throughout what follows we let be a sequence of regular triangulations of the bounded polyhedral Lipschitz domain , cf. [BreSco08-book, Ciar78-book]. We let denote the set of polynomials of maximal total degree on and define the set of elementwise polynomial functions or vector fields

The parameter refers to the maximal mesh-size of the triangulation . The set of sides of elements is denoted by . We let and denote the midpoints (barycenters) of sides and elements, respectively. The projection onto piecewise constant functions or vector fields is denoted by

For we have for all . We repeatedly use that is self-adjoint, i.e.,

for all with the inner product .

2.2. Crouzeix–Raviart finite elements

The Crouzeix–Raviart finite element space introduced in [CroRav73] consists of piecewise affine functions that are continuous at the midpoints of sides of elements, i.e.,

The elementwise application of the gradient operator to a function defines an elementwise constant vector field via

for all . For we have . Functions vanishing at midpoints of boundary sides on are contained in

A basis of the space is given by the functions , , satisfying the Kronecker property

for all . The function vanishes on elements that do not contain the side and is continuous with value 1 along . A quasi-interpolation operator is for defined via

We have that preserves averages of gradients, i.e.,

which follows from an integration by parts, cf. [BoBrFo13-book, Bart16-book].

2.3. Raviart–Thomas finite elements

The Raviart–Thomas finite element space of [RavTho77] is defined as

where is the set of vector fields whose distributional divergence belongs to . Vector fields in have continuous constant normal components on element sides. The subset of vector fields with vanishing normal component on the Neumann boundary is defined as

where is the outer unit normal on . A basis of the space is given by vector fields associated with sides . Each vector field is supported on adjacent elements with


for with opposite vertex to . We have the Kronecker property

for all sides with unit normal vector , if we assume that points from into . A quasi-interpolation operator is for vector fields given by

For the operator we have the projection property

which is a consequence of an integration by parts, cf. [BoBrFo13-book, Bart16-book]. This identity implies that the divergence operator defines a surjection from into , provided that constants are eliminated from if .

2.4. Integration by parts

An elementwise integration by parts implies that for and we have the integration-by-parts formula


Here we used that has continuous constant normal components on inner element sides and that jumps of have vanishing integral mean. If an elementwise constant vector field satisfies

for all then by choosing for one finds that its normal components are continuous on inner element sides and vanish on the , so that . We thus have the decomposition

where we used that .

3. Orthogonality relations

The following identities and in particular their proofs and corollaries are the main contributions of this article.

Theorem 3.1 (Orthogonality relations).

Within the sets of elementwise constant vector fields and functions equipped with the inner product we have


(i) The integration-by-parts formula (4) implies

if and hence . To prove the converse inclusion let be orthogonal to . We show that there exists with . For this, let and be the uniquely defined function with

for all . The identity holds for all since is orthogonal to discrete gradients of functions with . In particular, is orthogonal to constant functions if . We choose with and verify that

for all . We next define for all and note that

for all . Since is elementwise constant, it follows that and in particular . By definition of we have which proves the first asserted identity.
(ii) For the second statement we first note that if for then

for all and hence . It remains to show that

If is orthogonal to we choose with and note that

for all . This implies that and hence also . Since and we deduce the second identity. ∎

An implication is a surjectivity property of the mapping if .

Corollary 3.2 (Surjectivity).

If then we have

Otherwise, the subspace has codimension at most one.


(i) From Theorem 3.1 we deduce that the asserted identity holds if and only if . Since

the latter condition is equivalent to . Let such that a side belongs to , i.e., we have , where is the vertex of opposite to the side , and with . If then it follows that for since the vectors are linearly independent. Starting from this element we may successively consider neighboring elements to deduce that for all .
(ii) If we may argue as in (i) by removing one side from , define , and using the larger space . We then have . The difference is trivial if and only if belongs to . ∎

The following examples show that both equality or strict inequality can occur if .

Examples 3.3.

(i) Let , , , . Then while .
(ii) Let be a triangulation consisting of the subtriangles obtained by connecting the vertices of a macro triangle with its midpoint . Let and . We then have .

The second implication concerns discrete versions of convex duality relations. We let

be the convex conjugate of a given convex function .

Corollary 3.4 (Convex conjugation).

Let and be convex. We then have

If and the infimum is finite then equality holds.


An integration by parts and Fenchel’s inequality show that


This implies that the left-hand side is an upper bound for the right-hand side. If is differentiable is optimal in the infimum then we have the optimality condition

for all with . Theorem 3.1 yields that for some . This identity implies equality in (5) and hence

so that the asserted equality follows. ∎

Remark 3.5.

For nondifferentiable functions , the strong duality relation can be established if there exists a sequence of continuously differentiable functions such that the corresponding discrete primal and dual problems and are -convergent to and as , respectively. An example is the approximation of by functions for .

With the conjugation formula we obtain a canonical definition of a discrete dual variational problem.

Corollary 3.6 (Discrete duality).

Assume that is convex and is elementwise constant in the first argument and convex with respect to the second argument. For and define

We then have


Using the result of Corollary 3.4 and exchanging the order of the extrema we find that

This proves the asserted inequality. ∎

The fourth implication concerns the postprocessing of solutions of the primal problem to obtain a solution of the dual problem. This also implies a strong discrete duality relation.

Corollary 3.7 (Strong discrete duality).

In addition to the conditions of Corollary 3.6 assume that and is finite and differentiable with respect to the second argument. If is minimal for then the vector field

is maximal for with .


The optimal solves the optimality condition


for all . By restricting to functions satisfying we deduce with Theorem 3.1 that there exists with

The optimality condition (6) implies that . Hence, satisfies the asserted identity. With the resulting Fenchel identities

and by choosing in (6) we find that

which in view of the weak duality relation implies that is optimal. ∎

Appendix A Discrete Poincaré lemma

For completeness we provide a derivation of (1) based on a discrete Poincaré lemma. We say that is connnected if its relative interior has at most one connectivity component.

Proposition A.1 (Discrete Poincaré lemma).

Assume that or and is connected. A vector field satisfies for a function if and only if

for all with .


If then the orthogonality relation follows from the integration-by-parts formula (4). Conversely, if is orthogonal to vector fields with vanishing divergence then we can construct a function by integrating along a path connecting midpoints of sides, i.e., choosing a side at which some value is assigned to , e.g., . If then we choose . The values at other sides are obtained via

where is a chain of (unique) elements connecting with via the shared sides , i.e., for . To see that this is well defined it suffices to show that for every closed path with the sum equals zero. To verify this we define the Raviart–Thomas vector field

where we assume that the plus sign in

occurs for occurs on and the minus sign on . For the element we then have that