A Hybrid High-Order method for Kirchhoff-Love plate bending problems
Francesco Bonaldi, Daniele A. Di Pietro, Giuseppe Geymonat,, Fran\c{c}oise Krasucki

TL;DR
This paper introduces a new Hybrid High-Order method for accurately solving fourth-order Kirchhoff-Love plate bending problems on polygonal meshes, with proven convergence and robustness supported by numerical tests.
Contribution
The paper develops a novel HHO discretization supporting arbitrary orders and polygonal meshes, with proven convergence and error estimates for plate bending problems.
Findings
Convergence rate of h^{k+1} in energy norm
Error estimate of h^{k+3} in L^2 norm under regularity
Numerical experiments confirm robustness and accuracy
Abstract
We present a novel Hybrid High-Order (HHO) discretization of fourth-order elliptic problems arising from the mechanical modeling of the bending behavior of Kirchhoff-Love plates, including the biharmonic equation as a particular case. The proposed HHO method supports arbitrary approximation orders on general polygonal meshes, and reproduces the key mechanical equilibrium relations locally inside each element. When polynomials of degree are used as unknowns, we prove convergence in (with denoting, as usual, the meshsize) in an energy-like norm. A key ingredient in the proof are novel approximation results for the energy projector on local polynomial spaces. Under biharmonic regularity assumptions, a sharp estimate in is also derived for the -norm of the error on the deflection. The theoretical results are supported by numerical experiments, which…
| -1.662960e-03 | -1.635846e-03 | -1.632895e-03 | -1.632670e-03 | |
| -1.637918e-03 | -1.632707e-03 | -1.632652e-03 | -1.632653e-03 | |
| -1.632412e-03 | -1.632634e-03 | -1.632652e-03 | -1.632653e-03 | |
| -1.632433e-03 | -1.632638e-03 | -1.632652e-03 | -1.632653e-03 |
| -4.208744e-05 | -3.071276e-05 | -2.885137e-05 | -2.833621e-05 | -2.813136e-05 | |
| -3.167765e-05 | -2.945556e-05 | -2.858722e-05 | -2.824400e-05 | -2.809123e-05 | |
| -2.944060e-05 | -2.868230e-05 | -2.828896e-05 | -2.811198e-05 | -2.803012e-05 | |
| -2.899953e-05 | -2.845505e-05 | -2.818988e-05 | -2.806669e-05 | -2.800896e-05 |
| 354 | 1320 | 5088 | 19968 | 79104 | |
| 531 | 1980 | 7632 | 29952 | 118656 | |
| 708 | 2640 | 10176 | 39936 | 158208 | |
| 885 | 3300 | 12720 | 49920 | 197760 |
| 9468 | 37296 | 148032 | 589824 | 2354688 | |
| 21303 | 83916 | 333072 | 1327104 | 5298048 | |
| 37872 | 149184 | 592128 | 2359296 | 9418752 | |
| 59175 | 233100 | 925200 | 3686400 | 14716800 |
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.
A Hybrid High-Order method for Kirchhoff–Love plate bending problems111The work of the first author was supported by Agence Nationale de la Recherche projects HHOMM (ANR-15-CE40-0005), along with the second author, and ARAMIS (ANR-12-BS01-0021), along with the third and fourth authors; also, it was partially supported by SIR Research Grant no. RBSI14VTOS funded by MIUR – Italian Ministry of Education, Universities and Research.
Francesco Bonaldi222Corresponding author, [email protected]
MOX, Dipartimento di Matematica, Politecnico di Milano, Milan, Italy
Institut Montpelliérain Alexander Grothendieck, CNRS, Univ. Montpellier
Daniele A. Di Pietro333[email protected]
Institut Montpelliérain Alexander Grothendieck, CNRS, Univ. Montpellier
Giuseppe Geymonat444[email protected]
LMS, Ecole Polytechnique, CNRS, Université Paris-Saclay, 91128 Palaiseau, France
Françoise Krasucki555[email protected]
Institut Montpelliérain Alexander Grothendieck, CNRS, Univ. Montpellier
Abstract
We present a novel Hybrid High-Order (HHO) discretization of fourth-order elliptic problems arising from the mechanical modeling of the bending behavior of Kirchhoff–Love plates, including the biharmonic equation as a particular case. The proposed HHO method supports arbitrary approximation orders on general polygonal meshes, and reproduces the key mechanical equilibrium relations locally inside each element. When polynomials of degree are used as unknowns, we prove convergence in (with denoting, as usual, the meshsize) in an energy-like norm. A key ingredient in the proof are novel approximation results for the energy projector on local polynomial spaces. Under biharmonic regularity assumptions, a sharp estimate in is also derived for the -norm of the error on the deflection. The theoretical results are supported by numerical experiments, which additionally show the robustness of the method with respect to the choice of the stabilization.
MSC2010: 65N30, 65N12, 74K20
Keywords: Hybrid High-Order methods, Kirchhoff–Love plates, biharmonic problems, energy projector
1 Introduction
As remarked by O. C. Zienkiewicz [39], “one of the early requirements of the Finite Element (FE) approximation was the choice of shape functions which did not lead to infinite strains on element interfaces and which therefore preserved a necessary degree of continuity”. This requirement (also called of conformity) appeared easy to satisfy for simple self-adjoint problems governed by second-order equations, where -continuity at interfaces is enough. The situation is different as far as it concerns the knowledge, essential in structural engineering, of the bending of plates, whose numerical treatment has always been a goal of FE computations. Since thin plate bending in the Kirchhoff–Love approximation is governed by a fourth-order equation, -continuity has to be introduced (and the continuity of both the function and of its normal derivative assured at interfaces). This was difficult to achieve and computationally expensive in the classical FE framework, see e.g. Zienkiewicz [40] for a first engineering-oriented discussion and Ciarlet [20] for a mathematically-oriented one. In order to relax such -continuity condition, many non-conforming, mixed, hybrid plates elements have been studied and tested all over the last fifty years, and the literature on this subject is very broad; a minimal and by far non-exhaustive sample includes the seminal paper by Lascaux–Lesaint [35], as well as the classical works of Amara–Capatina–Chatti [2] (based on a decomposition of the constraints imposed on the bending moments by applying twice the Tartar lemma and using the symmetry of the tensor), Bathe [6], Boffi–Brezzi–Fortin [11], Brenner [13], Brenner–Scott [14], Brezzi–Fortin [16], Ciarlet[20], Comodi [23], Hughes [33], Johnson [34]; see also references therein. More recent nonconforming methods which have similarities (and differences) with the one presented here include the Hybridizable Discontinuous Galerkin method [21] of Cockburn–Dong–Guzmán and the Weak Galerkin method [37] of Lin–Wang–Ye; see also [22] concerning the passage from Discontinuous Galerkin to hybrid methods. We also cite here the mixed method of Behrens–Guzmán [8] based on a system of first-order equations, and the HHO method of [18], where the fourth-order operator in the Cahn–Hilliard equations is treated as a system of second-order operators.
A recent approach to the construction of FE spaces with -regularity, on the other hand, has been developed in the context of the Virtual Element Method (VEM) [3, 9, 15]. Here, global continuity requirements are enforced by renouncing an explicit expression of the basis functions at each point, and local contributions are built using computable projections thereof (a stabilization term therefore has to be added). We refer the reader to [17] [19] for an application of -conforming virtual spaces to plate-bending problems similar to the ones considered here. Nonconforming versions of the VEM have also been developed for fourth order operators, see, e.g., the very recent contributions by Antonietti–Manzini–Verani [4] (including nodal unknowns) and Zhao–Chen–Zhang [41] (with -continuous virtual functions).
The Kirchhoff–Love plate bending model problem considered in this work reads
[TABLE]
where denotes a two-dimensional bounded and connected polygonal domain, representing the middle surface of a plate in its reference configuration, and the divergence operator is denoted by div or , as to whether it acts on vector- or tensor-valued fields, respectively. In (1a), represents a surface load orthogonal to the plane of the plate, and is the moment tensor, a second-order symmetric tensor field related to the scalar unknown , the deflection of the plate, by the constitutive law
[TABLE]
where is a fourth-order, symmetric and uniformly elliptic tensor field, and is referred to as the curvature tensor. For the sake of simplicity, we assume in what follows that is piecewise constant on a finite polygonal partition
[TABLE]
of , and that . Variational formulations are classical for problem (1). For , we denote by the scalar product in , or , depending on the context, and by the associated norm; we omit the subscript whenever . The primal variational formulation of problem (1) reads: Find such that
[TABLE]
Owing to the Lax–Milgram Lemma, problem (3) is well-posed (see, e.g., [38, 16]).
In this work, we propose and analyze a novel Hybrid High-Order (HHO) method for the approximation of problem (3) which sits at the far end of the spectrum of nonconforming methods, since the underlying space does not even embed -continuity. HHO methods, introduced in [28] in the context of quasi-incompressible linear elasticity, are a class of new-generation discretization methods for partial differential equations with several advantageous features. The most relevant in the context of plate bending problems are:
(i) the support of arbitrary approximation orders on general polygonal meshes;
(ii) the reproduction of key continuous properties (such as, e.g., local equilibrium relations) at the discrete level;
(iii) competitive computational cost thanks to static condensation and compact stencil.
We refer the reader to [29] for an introduction covering the salient aspects of HHO methods for linear and nonlinear problems.
The HHO method for problem (3) is formulated in terms of discrete unknowns defined on mesh faces and elements (whence the term hybrid), and such unknowns are polynomials of arbitrary degree (whence the expression high-order). The construction is conceived so that only face-based unknowns are globally coupled, whereas element-based unknowns can be eliminated by static condensation; see Remark 11 below for further details. Element-based unknowns play the role of the deflection inside elements, whereas face unknowns play the role of the traces of and of its gradient on faces. From these unknowns, a reconstruction of the deflection of degree is obtained by solving a local problem inside each element. This reconstruction is conceived so that, composed with a local reduction map, it coincides with the local energy projector and, as such, has optimal approximation properties in the space of polynomials of total degree (up to) ; see Theorem 12 below, whose proof hinges on the recent results of [26]. The high-order deflection reconstruction is used to formulate a local contribution, which includes a carefully tailored stabilization term. The role of the latter is to ensure coercivity with respect to a -like seminorm while, at the same time, preserving the approximation properties of the local deflection reconstruction.
An extensive convergence analysis of the method is carried out. Specifically, in Theorem 12 below we prove convergence in (with denoting, as usual, the meshsize) in an energy-like norm and, in Theorem 16 below, a sharp estimate in for the -norm under biharmonic regularity assumptions. The latter result highlights a salient feature of HHO methods, namely the fact that, by construction, element-based unknowns superconverge to the -orthogonal projection of the exact solution on general meshes. As this happens by design (i.e., this behavior is not serendipitous), this phenomenon is henceforth referred to as supercloseness rather than superconvergence. We also show that the method satisfies locally inside each element a discrete version of the principle of virtual work with moments and shear forces obeying a law of action and reaction. The performance of the method is showcased on numerical examples, including a study of the robustness with respect to the choice of the stabilization.
The rest of the paper is organized as follows. In Section 2 we introduce the discrete setting: regularity for polygonal meshes, basic results thereon, and local projectors. A novel general result contained in this section is Theorem 1, where optimal approximation properties for the local energy projector on local polynomial spaces are studied. The proof of this theorem is given in Section 6. In Section 3 we introduce the HHO method, state the main results corresponding to Theorems 12 and 16, and provide a few numerical examples. In Section 4 we prove the local equilibrium properties of the HHO method and identify discrete equilibrated counterparts of moments and shear forces at interfaces. Section 5 collects the technical proofs of the properties of the discrete bilinear form relevant to the analysis. Conclusions and perspectives are discussed in Section 7.
2 Discrete setting
In this section we introduce some assumptions on the mesh, recall a few known results, and define two projectors on local polynomial spaces that will play a key role in the analysis of the method.
2.1 Mesh
The HHO method is built upon a polygonal mesh of the domain defined prescribing a set of elements and a set of faces .
The set of elements is a finite collection of open disjoint polygons with nonzero area such that and , with denoting the diameter of . The set of faces is a finite collection of open disjoint line segments in with nonzero length such that, for all , (i) either there exist two distinct mesh elements such that (and is called an interface) or (ii) there exists a mesh element such that (and is called a boundary face). We assume that is a partition of the mesh skeleton in the sense that .
We denote by the set of all interfaces and by the set of all boundary faces, so that . The length of a face is denoted by . For any , is the set of faces that lie on (the boundary of ) and, for any , is the unit normal to pointing out of . Symmetrically, for any , is the set containing the mesh elements sharing the face (two if is an interface, one if is a boundary face).
The notion of geometric regularity for polygonal meshes is more subtle than for standard meshes. To formulate it, we assume the existence of a matching simplicial submesh, meaning that there is a conforming triangulation of the domain such that each mesh element is decomposed into a finite number of triangles from and each mesh face is decomposed into a finite number of edges from the skeleton of . We denote by the regularity parameter such that (i) for any triangle of diameter and inradius , and (ii) for any mesh element and any triangle such that , . When considering refined mesh sequences, the regularity parameter should remain bounded away from zero.
In what follows, we also assume that the mesh is compliant with the data, i.e., for each mesh element there exist a unique polygon (see (2)) such that . As a result, the material tensor field is element-wise constant, and we set for the sake of brevity
[TABLE]
We also denote by and , respectively, the smallest and largest eigenvalues of , regarded as an endomorphism of . For we also introduce, for later use, the broken Sobolev space
[TABLE]
equipped, unless noted otherwise, with the broken norm defined by
[TABLE]
2.2 Basic results
We next recall a few geometric and functional inequalities, whose proofs are straightforward adaptations of the results collected in [27, Chapter 1] (where a slightly different notion of mesh faces is considered). For any mesh element and any face it holds that
[TABLE]
which expresses the fact that we are working on isotropic meshes. Moreover, the maximum number of faces of a mesh element is uniformly bounded: There is an integer only depending on such that
[TABLE]
Let a polynomial degree be fixed, let be a mesh element or face, and denote by the space spanned by the restrictions to of two-variate polynomials of total degree at most . There exist three real numbers , , and depending on and possibly on , but independent of , such that for any and , the following discrete trace, continuous trace, and inverse inequalities hold:
[TABLE]
We also recall the following Poincaré inequality, valid for all and all such that :
[TABLE]
where the real number is independent of both and , but possibly depends on (for instance, for convex elements [7]).
2.3 Projectors on local polynomial spaces
Projectors on local polynomial spaces are an essential ingredient in the construction and analysis of our method. Let a polynomial degree be fixed, and let denote a mesh element or face. The -orthogonal projector is such that, for all , is the unique polynomial satisfying the relation
[TABLE]
The corresponding vector-valued version, denoted by , acts component-wise. We recall the following approximation results that are a special case of the ones proved in [25, Lemmas 3.4 and 3.6]: There exists a real number independent of , but possibly depending on and , such that, for all , all , and all ,
[TABLE]
Here we have set, for any ,
[TABLE]
with respectively as in (11a) and (11b), and . Notice that, in the second definition, and stand for the boundary traces of the function and of its derivatives up to order , respectively.
Let a mesh element be fixed. For , we let and introduce the local energy projector such that, for any integer and any function ,
[TABLE]
Optimal approximation properties for the local energy projector are stated in the following theorem, whose proof is given in Section 6.
Theorem 1** (Optimal approximation properties of the local energy projector).**
There is a real number independent of , but possibly depending on , and , such that, for all , all , and all , it holds
[TABLE]
Remark 2** (Dependence on the material tensor).**
It can be checked that the constant in the right-hand side of (13) actually depends on only through the square root of the ratio between and .
3 The Hybrid High-Order method
In this section, we present the construction underlying the HHO method, state the discrete problem, and discuss the main results. Henceforth, we fix once and for all a polynomial degree .
3.1 Local discrete unknowns and interpolation
Let a mesh element be fixed. The local space of discrete unknowns is defined as the set
[TABLE]
For a general collection of discrete unknowns , we use the standard underlined HHO notation
[TABLE]
where contains the element-based discrete unknowns, the discrete unknowns related to the trace of the gradient on the face , and the discrete unknowns related to the trace on .
The local interpolation operator is such that, for all ,
[TABLE]
Since the boundary of is piecewise smooth (see, e.g., [38]), the trace theorem ensures that the restrictions and of appearing in (15) are both well-defined.
3.2 Local deflection reconstruction
Let again a mesh element and a polynomial degree be fixed. We introduce the local deflection reconstruction operator such that, for all , satisfies for all
[TABLE]
where . Here, the notation is used to emphasize the fact that is a moment tensor of virtual nature (with space of virtual deflections equal to ) unlike tensor appearing in bilinear form introduced in (3). The right-hand side of (16) is conceived so as to resemble an integration by parts formula where the roles of the function represented by and of its gradient are played by element discrete unknowns inside volumetric integrals and by face-based discrete unknowns on boundary integrals.
Since , the compatibility condition for problem (16) requires that the linear form on the right-hand side vanish on the elements of ; since for all , this condition is satisfied. The solution of (16) is not unique: if is a solution, for any also is. To ensure uniqueness, we add the closure condition
[TABLE]
Notice, in passing, that element discrete unknowns do not contribute to the right-hand side of (16) for , and they only appear in the closure condition (17).
For further use, we also observe that, since is smooth, performing an integration by parts on the first term in the right-hand side of (16) and using the symmetry of leads to the following reformulation, which points out the non-conformity of the method:
[TABLE]
The definition of is justified by the following proposition, which establishes a link with the local energy projector defined by (12).
Proposition 3** (Link with the local energy projector).**
It holds
[TABLE]
Proof.
We write (16) for (cf. (15) for the definition of the local interpolator). Since and is a constant tensor, we infer that
[TABLE]
and, for all ,
[TABLE]
Consequently, recalling the definition (10) of , , and , we have
[TABLE]
Plugging the above identities into the right-hand side of (16), performing an integration by parts, and using the symmetry of , we arrive at the following orthogonality condition:
[TABLE]
Comparing (20) and (17) with the definition (12) of concludes the proof. ∎
Remark 4** (Approximation properties for ).**
The above result implies that has optimal approximation properties in , in the sense made precise by Theorem 1.
3.3 Local contribution
We introduce the local discrete bilinear form on given by
[TABLE]
Here, the first contribution is the usual Galerkin term responsible for consistency. The second contribution, in charge of stability, penalizes high-order differences between the reconstruction and the unknowns and is such that, for all ,
[TABLE]
Remark 5** (Stabilization).**
Other expressions are possible for the stabilization term, and the specific choice can affect the accuracy of the results. In particular, the discussion below remains true if we replace (21) by
[TABLE]
with denoting a user-dependent parameter independent of . In practice, it is important that the numerical results be only marginally affected by the specific choice of the stabilization. We refer the reader to Section 3.7 below for a numerical study of the robustness of the method with respect to .
The following proposition states a consistency result for the stabilization bilinear form (22).
Proposition 6** (Consistency of ).**
There is a real number independent of , but possibly depending on , and , such that, for all ,
[TABLE]
Proof.
We have
[TABLE]
where, recalling Proposition 3 and using the linearity and idempotency of projectors,
[TABLE]
By the boundedness of -projectors, along with the approximation properties (13a)–(13b) of with and, respectively, for , for , and again for , the conclusion follows. ∎
We equip the space with the following local discrete seminorm:
[TABLE]
The following result shows that the bilinear form induces on a seminorm uniformly equivalent to .
Lemma 7** (Local coercivity and boundedness).**
There is a real number independent of , but possibly depending on , and , such that, for all , the following inequalities hold (expressing, respectively, the coercivity and boundedness of ):
[TABLE]
Proof.
See Section 5.1. ∎
Remark 8** (Polynomial degree).**
The assumption is essential in the proof of the above result. For this reason, the steps in which this hypothesis is used are pointed out accordingly.
3.4 Global space, interpolation, and norm
We define the following global space of discrete unknowns:
[TABLE]
Note that interface unknowns in are single-valued, i.e., their values match from one element to the adjacent one. For a collection of discrete unknowns in , we use the notation
[TABLE]
and we denote by its restriction to a mesh element . We also denote by (no underline) the broken polynomial function on such that
[TABLE]
We define the global interpolator such that, for all ,
[TABLE]
The space is equipped with the following seminorm (cf. (25) for the definition of ):
[TABLE]
We notice that the couple of boundary conditions (1b)–(1c) is equivalent to the couple on and on . Indeed, the fact that vanishes on implies its tangential derivative to vanish on as well. Accounting for this remark, we introduce the following subspace that incorporates the latter couple of boundary conditions in a strong manner:
[TABLE]
It is a simple matter to check that the image of the restriction of to is contained in .
Proposition 9** (Norm ).**
The mapping defines a norm on .
Proof.
The seminorm property is trivial. It then suffices to show that . Clearly, implies for all and and for all . By definition (30), we have and for all ; thus, for any , if then there exists such that and on . Since in , these facts imply that in , which in turn implies that and for all . Repeating this argument for inner layers of elements yields the assertion. ∎
3.5 Discrete problem
The discrete problem is formulated as follows: Find such that
[TABLE]
with global bilinear form on obtained by element-by-element assembly setting
[TABLE]
The following lemma summarizes the properties of the global bilinear form .
Lemma 10** (Properties of ).**
The bilinear form defined by (32) has the following properties:
- (i)
Coercivity and boundedness.* There is a real number independent of , but possibly depending on , and , such that*
[TABLE] 2. (ii)
Consistency.* There is a real number independent of , but possibly depending on , and , such that, for all , it holds that*
[TABLE]
Proof.
See Section 5.1. ∎
As a consequence of the first inequality in (33), the discrete problem (31) admits a unique solution. This solution minimizes the following discrete energy:
[TABLE]
The discrete energy will play an important role in numerical experiments (cf. Section 3.7 below).
Remark 11** (Implementation).**
Proceeding as in standard FE methods, to write an algebraic version of problem (31) we associate to each mesh element or face a set of degrees of freedom (DOFs) that form a basis for the dual space of the local polynomial space supported by it. Let a basis for the space be fixed such that every basis function is supported by only one mesh element or face. To fix the ideas, we take as DOFs the coefficients of the expansion of a HHO function in , and we collect them in the vector partitioned as
[TABLE]
where the subvector collects the coefficients associated with element-based DOFs, while the remaining coefficients (associated to face-based DOFs) are collected in . Denote by the matrix representation of the bilinear form and by the vector representation of the linear form , both partitioned in a similar way. The algebraic problem corresponding to (31) reads
[TABLE]
The submatrix is block-diagonal and symmetric positive definite, and is therefore inexpensive to invert. In the practical implementation, this remark can be exploited by solving the linear system (36) in two steps:
[TABLE]
- (i)
First, element-based coefficients in are expressed in terms of and by the inexpensive solution of the first block equation:
[TABLE]
This step is referred to as static condensation in the FE literature; 2. (ii)
Second, face-based coefficients in are obtained solving the following global problem involving quantities attached to the mesh skeleton:
[TABLE]
This computationally more intensive step requires to invert the symmetric matrix , whose stencil involves neighbours through faces, and which has size with . Observing that is in fact the Schur complement of in , and since is symmetric and both and are positive definite, a classical result in linear algebra yields that also is positive definite (see, e.g., **[32]**).
3.6 Main results
We next present the main results of the analysis, namely error estimates in an energy-like norm, in a jump-seminorm, and in the -norm. Inside the proofs of this section, we often abridge as the inequality with independent of , but possibly depending on , , and .
3.6.1 Energy error estimate
We introduce the global deflection reconstruction operator such that, for all ,
[TABLE]
We also define the stabilization seminorm on setting, for all ,
[TABLE]
Theorem 12** (Energy error estimate).**
Let and denote the unique solutions to the continuous (3) and discrete (31) problems, respectively. Assume the additional regularity . Then, it holds that
[TABLE]
where denotes the usual broken gradient operator on and the real number is independent of (but possibly depends on , , and ).
Remark 13** (Regularity of the solution).**
Concerning the regularity assumptions on , we mention as an example that, for , the regularity is satisfied by the solution of the biharmonic problem with Dirichlet boundary conditions (obtained taking in (1)) posed on a three-dimensional cubic domain, provided the load is square-integrable (see, e.g., Maz’ya [36, Chapter 4]). In two dimensions, under the weaker assumption that , it holds that provided is convex (see, e.g., Grisvard [30, Chapter 3]). In general, a regularity assumption on the exact solution is actually the consequence of a compatibility condition between the datum regularity and the domain geometry. When in two dimensions, one can have under the condition of Kondratiev on the opening of each corner (see, e.g., Blum–Rannacher [10], Grisvard [31]). As a further reference on the regularity for the solution of fourth-order elliptic problems, we also refer the reader to Dauge [24, Chapter 4]. To close this remark, we emphasize that, since needs only be locally regular inside each element, the presence of corner singularities and layers can be accounted for by a judicious choice of and, possibly, of .
Proof of Theorem 12.
Let, for the sake of brevity, . We start by proving that
[TABLE]
with norm defined by (33). Using the linearity of in its first argument together with the discrete problem (31), and recalling that a.e. in , we have, for all ,
[TABLE]
Thus, choosing and using the consistency (34) of to bound the supremum in the right-hand side, the basic estimate (39) follows.
Let us now prove (38). Using the triangle inequality, we infer that
[TABLE]
where we have used the discrete Cauchy–Schwarz inequality together with the definition (33) of the -norm in the last line. The conclusion follows using (39) to estimate the first term in the right-hand side, the optimal approximation properties (13a) of with and for all to estimate the second term, and the consistency (24) of for all to estimate the third term. ∎
Remark 14** (Convergence of face unknowns).**
Combining the norm equivalence (33) with (39), we readily infer that
[TABLE]
which shows, in particular, that the face variables converge in an energy-like norm to the corresponding projections of the exact solution and its normal derivative. This is in itself a supercloseness result for the face variables, since, replacing by and by in the left-hand side of the above inequality, one would only obtain a suboptimal estimate in (which would only converge if ). An optimal error estimate in for the trace of and its gradient can be recovered using the deflection reconstruction instead of the face variables:
[TABLE]
Remark 15** (Convergence of the jumps).**
From the estimate of Theorem 12, one can prove that the jumps of and of its gradient converge to zero with optimal rate. To this end, define on (cf. definition (4)) the following jump seminorm:
[TABLE]
where is the usual jump operator if is an interface (the sign is irrelevant), whereas if is a boundary face, and . Then, observing that as a consequence of the triangle inequality together with (6), it is inferred from (38) that
[TABLE]
with real number independent of , but possibly depending on , , and .
3.6.2 -error estimate
A sharp -norm error estimate can also be inferred assuming biharmonic regularity, in the following form: For all , the unique solution to
[TABLE]
satisfies the a priori estimate (see, e.g., [10])
[TABLE]
with only depending on and on .
Theorem 16** (-error estimate).**
Let and denote the unique solutions to the continuous (3) and discrete (31) problems, respectively. Assume , biharmonic regularity, and . Then, there exists a real number depending on , , and , but independent of , such that
[TABLE]
Proof.
Let, for the sake of brevity, . By the triangle inequality, we have that
[TABLE]
By the approximation properties (13a) of (cf. Remark 4) with and , we immediately have that
[TABLE]
For the second term, on the other hand, we observe that
[TABLE]
where we have used the triangle inequality and the approximation properties of for and , as well as the closure condition (17) to pass to the second line, and the definition of the -norm to conclude. Using (39) and Lemma 17 below to bound the first and second addend in the right-hand side, respectively, the conclusion follows. ∎
The following lemma, used in the proof of Theorem 16 above, shows that element-based discrete unknowns behave “almost” like the -orthogonal projection of the exact solution on the space of broken polynomials of total degree at most on .
Lemma 17** (Supercloseness of element discrete unknowns).**
Under the assumptions and notations of Theorem 16, it holds that
[TABLE]
where and are the broken polynomial functions of total degree at most such that and for any mesh element .
Proof.
Set, for the sake of brevity, and . Let solve (41) with and set . Integrating by parts, using the linearity of in its first argument, as well as the continuity of moments and shear forces at interfaces, and letting for all , we have that , with
[TABLE]
where is such that for all and all . The Cauchy–Schwarz inequality then yields
[TABLE]
The approximation properties (13) of with , the consistency property (24) of the stabilization bilinear form, and the stability of together with the energy error estimate (39) allow to conclude that
[TABLE]
where in the last estimate we have used the biharmonic regularity hypothesis. Turning to , using the fact that and exploiting the orthogonality property (20), we have
[TABLE]
We have that by the Cauchy–Schwarz inequality, the approximation properties of , and biharmonic regularity. An analogous bound can be obtained for . Finally, we observe that by the definition (10) of the -orthogonal projector. Using the approximation properties (11a) of with , , and for the first factor, for the second, we obtain
[TABLE]
This concludes the proof. ∎
3.7 Numerical examples
In this section we solve problem (1) for (i.e., the biharmonic equation) in the unit square and, with a view towards testing the convergence of the method in the case of more complex geometries, in a L-shaped domain as well.
3.7.1 Unit square
In this first case, the domain under consideration is . The right-hand side is set in agreement with the exact solution
[TABLE]
on three different meshes: triangular, cartesian and hexagonal (cf. Fig. 1). Figures 2 and 3 show convergence results in the energy norm and in the -norm, respectively, for different meshes and polynomial degrees, up to three. We consider and as measures of the error in the energy norm and in the -norm, respectively. Since biharmonic regularity (42) is satisfied (the domain is convex and the exact solution is of class ), the numerical results show asymptotic convergence rates that match those predicted by the theory, i.e. estimates (39) and (44), in all of the three cases.
Also, we check the numerical convergence of the discrete energy (35) with four uniformly refined triangular meshes, and a polynomial degree ranging from 1 to 4. As Table 1 shows, only three refinements are necessary when to achieve a five-significant-digit precision for the limit of the discrete energy.
We finally test the robustness of the variant of the HHO method based on the local bilinear form (23) with respect to the user-dependent parameter . In Figures 4 and 5 we plot, respectively, the energy- and -norms of the error when varies from to on fixed meshes corresponding to the third refinement level of the ones in Figure 1. From these plots, the robustness of the method can be appreciated, as the energy error spans only two orders of magnitude and the -error spans four orders of magnitude, while the user-dependent parameter spans six orders of magnutide.
3.7.2 L-shaped domain
We now consider the domain , and a uniform load . Figure 6a shows the numerical solution obtained for on five nested, uniformly refined triangular meshes. Since a closed-form solution is not available in this case, we check the numerical convergence of the discrete energy on the above-mentioned meshes, again for a polynomial degree ranging from to . As Table 2 shows, this energy converges numerically towards a value given by -2.80e-05 to two significant digits. This allows to conclude that the method converges even in situations where such singular geometries are considered. As expected, since biharmonic regularity is not satisfied in this case (because of the domain geometry), convergence is slower than in Table 1, and five mesh refinements are required to achieve a two-significant-digit precision for the limit. For further details, we refer the reader to Section 7.1.
4 Local principle of virtual work and laws of action-reaction
Let a mesh element be fixed. At the continuous level, the deflection field satisfies, for all ,
[TABLE]
For an interface , with , distinct elements of , since , both moments and shear forces obey the following laws of action-reaction:
[TABLE]
The denomination for equations (46b) emphasizes the fact that the moment (resp., shear force) exerted on element by element through the common interface is the opposite of the moment (resp., shear force) exerted on by through .
We next show that the solution to discrete problem (31) satisfies discrete counterparts of (46a) and (46b). This requires a reformulation of the stabilization contribution in terms of the differences between face-based and element-based discrete unknowns. Define the space
[TABLE]
and the boundary difference operator such that, for all ,
[TABLE]
Proposition 18** (Boundary difference reformulation of ).**
The local stabilization bilinear form defined by (22) can be rewritten, for all ,
[TABLE]
Proof.
As a consequence of (19), for all it holds
[TABLE]
where we have used the fact that, as a projector, preserves polynomials up to degree . Now, using (48) and the linearity of , we have
[TABLE]
Also, for all , it holds
[TABLE]
and, analogously,
[TABLE]
Using (49), (50), and (51) respectively in the first, second, and third term in the right-hand side of (22), the conclusion follows. ∎
Define now the residual operator
[TABLE]
such that, for all and all ,
[TABLE]
Problem (52) is well-posed as a consequence of the Riesz representation theorem for the -like product in the left-hand side.
Lemma 19** (Local principle of virtual work and laws of action-reaction).**
Denote by the unique solution to (31) and, for all and all , define the discrete moment and shear force
[TABLE]
Then, the following discrete counterparts of (46a) and (46b) hold, respectively: For any mesh element ,
[TABLE]
Proof.
Recalling the definition (21) of , and using the reformulation (47) of together with the definition (52) of the residual operator, it is inferred from the discrete problem (31) that, for all , it holds
[TABLE]
Using the definition (18) of with for the first term, and recalling (52) and (53), we can rewrite (55) as
[TABLE]
Thus, for a given mesh element , choosing in (56) such that spans , for all , and for all immediately yields (54a). Next, for a given interface , choosing in (56) such that for all , for all , for all , and letting span yields the first equation in (54b). Similarly, choosing in (56) such that for all , for all , for all , and letting span yields the second equation in (54b). ∎
5 Properties of the discrete bilinear form
This section contains the proofs of the technical Lemmas 7 and 10.
5.1 Local coercivity and boundedness
Proof of Lemma 7.
Let a mesh element be fixed, and let .
(i) Coercivity. Taking in (18) gives
[TABLE]
Using the Cauchy–Schwarz inequality to bound the first term in the right-hand side, the Cauchy–Schwarz and discrete trace (8a) inequalities to bound the second, and the Cauchy–Schwarz, discrete trace (8a) and inverse (8c) inequalities to bound the third, and simplifying we obtain:
[TABLE]
It remains to estimate the boundary terms inside the parentheses using the -seminorm.
(i.a) Bound on . For all , inserting into the norm and using the linearity of and the fact that it preserves polynomials in as a projector, we obtain
[TABLE]
where we have used the triangle inequality to pass to the second line. By the definition (22) of , we readily infer that
[TABLE]
Using the -boundedness of followed by the discrete trace inequality (8a), we can write . Then, by the approximation properties (11a) of with , , and , we infer that
[TABLE]
so that
[TABLE]
Notice, in passing, that in the second bound in (59) we have used the fact that . Finally, the third term in the right-hand side of (58) can be estimated using the discrete trace (8a) and inverse (8c) inequalities together with the definition (22) of as follows:
[TABLE]
Hence, multiplying (58) by , squaring, summing over , using the above estimates for , , , and recalling the uniform bound (7) on , we have
[TABLE]
(i.b) Bound on . For all , inserting into the norm, and using the linearity of and together with the fact that they preserve polynomials up to degree as projectors, we have that
[TABLE]
By the definition (22) of , it is readily inferred that
[TABLE]
The second term can be estimated as follows:
[TABLE]
where we have used the -boundedness of , the discrete trace inequality (8a), the uniform equivalence of face and element diameters (6) to replace with , and the approximation property (11a) with , , and . Again, here the hypothesis is necessary to infer the second bound. Hence,
[TABLE]
Finally, using the discrete trace inequality (8a) followed by the definition (22) of , we have
[TABLE]
Multiplying (61) by , squaring, summing over , using the above estimates for , , , and recalling the uniform bound (7) on , we arrive at
[TABLE]
(i.c) Conclusion. Combining (57), (62), and (60), the first inequality in (26) follows.
(ii) Boundedness. Taking in (18), using the Cauchy–Schwarz, discrete trace (8a) and inverse inequalities (8c), and simplifying, we get
[TABLE]
which bounds the portion of stemming from the consistency term in (21). It remains to bound on the local stabilization terms in .
(ii.a) Bound on . Inserting into the norm and using the triangle inequality, we have that
[TABLE]
For the first term, using the approximation property (11a) with , , and , and (63), we get
[TABLE]
Once more, we use here the fact that . For the second term, inserting into the norm (see (17)) and using the triangle inequality, we obtain
[TABLE]
The approximation property (11a) with , , and gives and so that, accounting for (63),
[TABLE]
Squaring (64), multiplying the resulting inequality by , and using the above estimates for and together with the uniform bound (7) on , we conclude that
[TABLE]
(ii.b) Bound on . For any , inserting into the norm, invoking the linearity of together with the fact that it preserves polynomials in as a projector, and using the triangle inequality, we have that
[TABLE]
where to pass to the second line we have used the -boundedness of , the discrete trace inequality (8a), and the inverse inequality (8c), while to pass to the third line we have estimated the first addend as the term in (64) (which requires again ). Thus, squaring the above inequality, summing over , multiplying it by , and using the uniform bound (7) on , we finally infer
[TABLE]
(ii.c) Bound on . For any , inserting into the norm, invoking the linearity of together with the fact that it preserves polynomials in as a projector, and using the triangle inequality, we infer that
[TABLE]
where to pass to the second line we have used the -boundedness of followed by the discrete trace inequality (8a) and the uniform equivalence of the element and face diameters expressed by (6), while to pass to the third line we have estimated the first addend as the term in (64) and, once more, we used the fact that . Hence, multiplying (67) by , squaring, summing over , recalling (64), and using the uniform bound (7) on , we conclude that
[TABLE]
(ii.d) Conclusion. The second inequality in (26) then follows combining (63), (68), and (66) and recalling the definition (25) of . ∎
5.2 Global coercivity, boundedness, and consistency
Proof of Lemma 10.
(i) Coercivity and boundedness. The norm equivalence (33) is an immediate consequence of Lemma 7 together with the definition (29) of the -norm.
(ii) Consistency. Let us prove (34). An element-wise integration by parts yields
[TABLE]
where we have used the fact that moments and Kirchhoff shear forces are continuous at interfaces owing to the regularity of (see (46b) for the expression of these continuity properties for the exact solution ) and that homogeneous boundary conditions are embedded in . Now, let
[TABLE]
we have
[TABLE]
Thus, letting , (69) and (71) yield
[TABLE]
By the definition (12) of the local energy projector, we have that
[TABLE]
Using the approximation properties (13) with , , and , we infer that
[TABLE]
Moreover, for all , we have ; as for the first factor, by (24) we have whereas the second inequality in (26) gives , so that
[TABLE]
Using (72), (73), and (74) to estimate , and using the resulting bound in the supremum in (34) concludes the proof. ∎
6 Proof of Theorem 1
(i) Proof of (13a). We apply [26, Lemma 3]. Therefore, proving (13a) amounts to proving the following estimates:
[TABLE]
where means with as in (13).
We start by proving (75a). The definition (12) of implies that
[TABLE]
where we have used the definition of (see Section 2.1) in the first line, the characterization of as in the second line, along with the definition of and the -stability of the -orthogonal projector (resulting from (11a) with ) to conclude. Thus, using again the triangle inequality, we have that
[TABLE]
and (75a) is proved.
To prove (75b), we introduce the quantities (recall the second condition in (12)) and inside the -norm of to infer that
[TABLE]
where we have used the approximation estimate (11a) for with and together with the fact that, for any , to estimate the first two terms, and (75a) to conclude.
The proof of (75c) is completely analogous. We obtain
[TABLE]
where we have used (11a) to estimate the first two addends in the first line, with and for the first one and with and for the second one. This concludes the proof of (13a).
(ii) Proof of (13b). For , by applying the continuous trace inequality (8b) to for all such that , we have
[TABLE]
The conclusion follows using (13a) for and to bound the terms in the right-hand side.
7 Concluding remarks
Some concluding remarks are in order.
7.1 Computational cost of the method
It is worth to draw some conclusions from the numerical tests set forth in Section 3.7, with particular reference to the L-shaped domain case. Indeed, in many applications, as well as from a theoretical viewpoint, it is interesting to estimate the computational cost of a given numerical method. Here, we can evaluate the computational cost of our method by comparing the sizes of the matrices associated with the bilinear form , as well as the number of nonzero elements of such matrices666 The latter, in particular, gives an insight into the stencil of the method., upon varying the polynomial degree and the number of elements . These two quantities are represented in Tables 3 and 4, respectively. As Table 3 shows, in certain cases (compare, for instance, the results given by the two choices , and , in Table 2) using polynomials of high order on coarse triangulations is more convenient than using polynomials of lower order on finer triangulations to obtain a given numerical value of the discrete energy to two significant digits.
7.2 Mixed formulations
The results of this paper concern the primal formulation (1) of the Kirchhoff–Love plate bending model problem. As it is well known, this problem admits dual and mixed formulations that have been the basis for the development of mixed and hybrid nonconforming finite elements (see, e.g., [16]). A HHO discretization based on a mixed formulation will make the object of a future work, as well as the study of its relation with the method presented here and its variations. We notice, in passing, that a similar study for a second-order elliptic problem has been carried out in [1] and, in a more general setting, in [12]. The latter works can be regarded as a generalization to new generation polytopal methods of the classical hybridization techniques of Arnold–Brezzi [5].
Acknowledgements. The authors are grateful to Franco Brezzi (IMATI Pavia) for the fruitful discussions that have helped shape up this work.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Aghili, S. Boyaval, and D. A. Di Pietro, Hybridization of mixed high-order methods on general meshes and application to the Stokes equations, Comput. Meth. Appl. Math., 15(2):111–134, 2015.
- 2[2] M. Amara, D. Capatina–Papaghiuc, and A. Chatti, Bending moment mixed method for the Kirchhoff–Love plate model, SIAM J. Numer. Anal., 40(5):1632–1649, 2002.
- 3[3] P. F. Antonietti, L. Beirão da Veiga, S. Scacchi, and M. Verani, A C 1 superscript 𝐶 1 C^{1} virtual element method for the Cahn–Hilliard equation with polygonal meshes, SIAM J. Numer. Anal., 54(1):34–56, 2016.
- 4[4] P. F. Antonietti, G. Manzini, M. Verani, The fully nonconforming virtual element method for biharmonic problems, preprint ar Xiv:1611.08736 .
- 5[5] D. N. Arnold and F. Brezzi, Mixed and nonconforming finite element methods: implementation, postprocessing and error estimates, RAIRO Model. Math. Anal. Numer., 19:7–32, 1985.
- 6[6] K. J. Bathe, Finite element procedures , Prentice-Hall, Englewood Cliffs, NJ, 1996.
- 7[7] M. Bebendorf, A note on the Poincaré inequality for convex domains, Z. Anal. Anwend. 22:751–756, 2003.
- 8[8] E. M. Behrens and J. Guzmán, A mixed method for the biharmonic problem based on a system of first-order equations, SIAM J. Numer. Anal. 49(2):789–817, 2011.
