A decomposition result for Kirchhoff plate bending problems and a new discretization approach
Katharina Rafetseder, Walter Zulehner

TL;DR
This paper introduces a novel mixed variational formulation and discretization method for Kirchhoff plate bending problems, enabling the use of standard second-order problem solvers within a modular framework.
Contribution
It develops a new regular decomposition-based approach for Kirchhoff plates, extending previous biharmonic problem results to more complex boundary conditions.
Findings
New discretization methods based on second-order problem solvers
Flexible approach adaptable to various boundary conditions
Theoretical validation of the regular decomposition and Brezzi's conditions
Abstract
A new approach is introduced for deriving a mixed variational formulation for Kirchhoff plate bending problems with mixed boundary conditions involving clamped, simply supported, and free boundary parts. Based on a regular decomposition of an appropriate nonstandard Sobolev space for the bending moments, the fourth-order problem can be equivalently written as a system of three (consecutively to solve) second-order problems in standard Sobolev spaces. This leads to new discretization methods, which are flexible in the sense, that any existing and well-working discretization method and solution strategy for standard second-order problems can be used as a modular building block of the new method. Similar results for the first biharmonic problem have been obtained in our previous work [W. Krendl, K. Rafetseder and W. Zulehner, A decomposition result for biharmonic problems and the…
| order | order | order | order | |||||
|---|---|---|---|---|---|---|---|---|
| 4 | ||||||||
| 5 | ||||||||
| 6 | ||||||||
| 7 |
| order | order | order | order | |||||
|---|---|---|---|---|---|---|---|---|
| 4 | ||||||||
| 5 | ||||||||
| 6 | ||||||||
| 7 |
| order | order | order | order | |||||
|---|---|---|---|---|---|---|---|---|
| 4 | ||||||||
| 5 | ||||||||
| 6 | ||||||||
| 7 |
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 decomposition result for Kirchhoff plate bending problems and a new discretization approach
Katharina Rafetseder111Institute of Computational Mathematics, Johannes Kepler University Linz, 4040 Linz, Austria ([email protected], [email protected]). and Walter Zulehner11footnotemark: 1
Abstract
A new approach is introduced for deriving a mixed variational formulation for Kirchhoff plate bending problems with mixed boundary conditions involving clamped, simply supported, and free boundary parts. Based on a regular decomposition of an appropriate nonstandard Sobolev space for the bending moments, the fourth-order problem can be equivalently written as a system of three (consecutively to solve) second-order problems in standard Sobolev spaces. This leads to new discretization methods, which are flexible in the sense, that any existing and well-working discretization method and solution strategy for standard second-order problems can be used as a modular building block of the new method.
Similar results for the first biharmonic problem have been obtained in our previous work [W. Krendl, K. Rafetseder and W. Zulehner, A decomposition result for biharmonic problems and the Hellan-Herrmann-Johnson method, ETNA, 2016]. The extension to more general boundary conditions encounters several difficulties including the construction of an appropriate nonstandard Sobolev space, the verification of Brezzi’s conditions, and the adaptation of the regular decomposition.
Key words. Kirchhoff plates, mixed boundary conditions, free boundary, mixed methods, regular decomposition
AMS subject classifications. 65N30, 65N22, 74K20
1 Introduction
We consider the Kirchhoff plate bending problem: For a given load , find the deflection such that
[TABLE]
with appropriate boundary conditions. Here is a bounded domain in with a polygonal Lipschitz boundary , denotes the standard divergence of a vector-valued function, the row-wise divergence of a matrix-valued function, the Hessian and the material tensor. Note that (1) reduces to the biharmonic equation, if is the identity. In this paper we focus on mixed methods for the original unknown and the bending moments as additional unknowns, which are often quantities of interest on their own.
In our previous work [20] the first biharmonic boundary value problem is studied, which corresponds to the situation of a purely clamped plate. For this model problem a new mixed variational formulation is derived, which satisfies Brezzi’s conditions and is equivalent to the original problem. However, these important properties come at the cost of an appropriate nonstandard Sobolev space for . Based on a regular decomposition of , the fourth-order problem can be rewritten as a sequence of three (consecutively to solve) second-order elliptic problems in standard Sobolev spaces. This leads to a new interpretation of known mixed finite element methods as well as to the construction of new discretization methods, see [20] for details. This approach fits into an abstract framework recently presented in [8] for the decomposition of higher-order problems. However, more general boundary conditions (beyond a purely clamped plate) are not considered there as well.
The aim of this paper is to extend the ideas of [20] to the more general situation of a Kirchhoff plate with mixed boundary conditions involving clamped, simply supported, and free boundary parts. This is by far not straight-forward.
The first difficulty arises in the derivation of the new mixed formulation. Contrary to clamped boundary parts, appropriate boundary conditions for have to be incorporated into the definition of the nonstandard Sobolev space for simply supported and free boundary parts. In this paper we do this indirectly using the framework of (possibly unbounded) densely defined operators in Hilbert spaces. This approach avoids the direct use of trace operators in nonstandard Sobolev spaces, which would be technically rather involved. A second difficulty is the verification of Brezzi’s conditions. In [20] the main ingredient for the proof of an inf-sup condition is the property that matrix-valued functions of the form are contained in , where denotes the identity matrix and satisfies homogeneous Dirichlet boundary conditions induced by the boundary conditions for . This inclusion is no longer true for problems with free boundary parts. So, a new technique is required for proving the inf-sup condition. A third difficulty arises in the regular decomposition for a similar reason. The first component of the decomposition in [20] is of the form and is not contained in for problems with free boundary parts. So, a new approach is required to pursue the decomposition for problems with free boundary parts. It is shown in this paper how to overcome all these difficulties and how to achieve again a decomposition of the fourth-order problem into three (consecutively to solve) second-order elliptic problems in standard Sobolev spaces.
So far in literature, mixed methods for (1) in and have been formulated as linear operator equations in function spaces for which either the associated linear operator is not an isomorphism or the involved norms contain a mesh-dependent variant of the -norm for , see, e.g., [7, 12, 2, 5, 6]. This lack of easy-to-access knowledge on the mapping properties of the involved operators on the continuous level makes it hard to design efficient preconditioners on the discrete level. Our new mixed formulation satisfies Brezzi’s conditions. Therefore, the associated linear operator is an isomorphism. Additionally, the operator is of triangular structure. This naturally leads to the construction of efficient solvers. Moreover, the new mixed formulation is equivalent to the original problem without additional convexity assumptions on , while most of the papers in literature (except for [5]) require to be convex.
For alternative discretization methods such as conforming, non-conforming, and discontinuous Galerkin methods for the primal formulation as well as alternative mixed methods we refer to the short discussion in [20] and the references cited there. Our approach leads to new discretization methods, which are flexible in the sense, that any existing and well-working discretization method and solution strategy for second-order problems can be used as a modular building block of the new method. One option would be to choose standard finite elements for each of the three second-order elliptic problems (for two scalar fields and one vector field) resulting in approximate solutions to and . In [3, 4] a different method was proposed that also uses only standard finite element spaces for second-order problems for a formulation in the kinematic variables and . For reaching approximate solutions of comparable accuracy the method in [3, 4] requires the approximation of one scalar field less than the approach presented here. However, the linear system resulting from the method in [3, 4] is a coupled system of all degrees of freedoms of one scalar and one vector field, while the method presented here requires to solve linear systems for the degrees of freedom separately for each of the two scalar and the vector field. This reduces the computational costs for direct solvers. For the use of iterative solvers efficent methods for standard second-order problems like multigrid methods can be directly used for each of the three linear systems. Preconditioning is not addressed in [3, 4]. So we feel that our method is competitive with respect to the overall computational efficiency.
The paper is organized as follows. In Section 2 the Kirchhoff plate bending problem is introduced. Section 3 contains a new mixed formulation, for which well-posedness and equivalence to the original problem is shown. A regular decomposition of the nonstandard Sobolev space for is derived in Section 4 and the resulting decoupled formulation is presented. The decoupled formulation leads in a natural way to the construction of a new discretization method, which is introduced in Section 5, and for which a priori error estimates are derived. The paper closes with numerical experiments in Section 6.
2 The Kirchhoff plate bending problem
We consider the Kirchhoff plate bending problem of a linearly elastic plate where the undeformed mid-surface is described by a domain with a polygonal Lipschitz boundary . In what follows, let the boundary be written in the form
[TABLE]
where , , are the edges of , considered as open line segments and denotes the set of corner points in . Furthermore, and represent the unit outer normal vector and the unit counterclockwise tangent vector to , respectively.
The plate is considered to be clamped on a part , simply supported on , free on with . We assume that each edge is contained in exactly one of the sets , , , and the edges are maximal in the sense that two edges with the same boundary condition do not meet at an angle of . Recall the definition of the bending moments by the Hessian of the deflection
[TABLE]
where is the fourth-order material tensor. The tensor is assumed to be symmetric and positive definite on symmetric matrices, and denote the minimal and maximal eigenvalue of , respectively. For example, for isotropic materials with Poisson ratio , the material tensor is given by \mathcal{C}\bm{N}=D\bigl{(}(1-\nu)\bm{N}+\nu\ \mathrm{tr}(\bm{N})\bm{I}\bigr{)} for matrices , where depends on material constants, is the identity matrix and is the trace operator for matrices (cf. [27]). We introduce the following notations
[TABLE]
for the normal-normal component and the normal-tangential component of , where the symbol denotes the Euclidean inner product. The classical Kirchhoff plate bending problem reads as follows (cf. [27]): For given load , find a deflection such that
[TABLE]
and the boundary conditions
[TABLE]
where denotes the tangential derivative, and the corner conditions
[TABLE]
where denotes the set of corner points whose two adjacent edges (with corresponding normal and tangent vectors , and , ) belong to .
Remark 2.1*.*
There is a fourth type of boundary condition given by
[TABLE]
with corner conditions of the form (4), which appears, e.g., in boundary value problems of the Cahn-Hilliard equation. The theory presented in the following can easily be extended to mixed boundary conditions including also this fourth type.
A standard (primal) variational formulation of (3) is given as follows: find such that
[TABLE]
with the Frobenius inner product for matrices , the right-hand side , and the function space
[TABLE]
with associated norm . Following, e.g., [1, 22], here and throughout the paper and denote the standard Lebesgue and Sobolev spaces of functions on with corresponding norms and for positive integers . For functions on we use and to denote the Lebesgue space and the trace space of with corresponding norms and . Moreover, denotes the set of functions in which vanish on a part of . The -inner product on and are always denoted by and , respectively, no matter whether it is used for scalar, vector-valued, or matrix-valued functions.
In order to avoid technicalities related to rigid body motions, we assume throughout the paper that contains at least one non-trivial edge . Then existence and uniqueness of a solution to (5) are guaranteed by the theorem of Lax-Milgram (see, e.g., [21, 23]) for even more general right-hand sides , where . Here we use to denote the dual of a Hilbert space and for the duality product on . Moreover, the solution depends continuously on
[TABLE]
with , where depends only on the constant of Friedrichs’ inequality. All results of this paper can easily be extended to the case under appropriate compatibility conditions for the right-hand side .
For scalar functions , vector-valued functions , and matrix-valued functions the first order differential expressions
[TABLE]
are defined in the weak sense on the corresponding domains of definition
[TABLE]
In case that all components are in they take on their classical form given as follows:
[TABLE]
Moreover, the symmetric gradient and the symmetric are introduced by
[TABLE]
3 A new mixed variational formulation
For the new mixed variational formulation we introduce the bending moments , as defined in (2), as auxiliary variable. Then the Kirchhoff plate bending problem reads in terms of as stated in (3). Note, the involved operators are the second order differential operators and . In the following we give a formally precise definition of them.
Throughout the paper, the differential expression is only considered for functions . Therefore, we define in the standard way as the matrix consisting of all second order partial derivatives. In order to introduce the operator we use the classical concept of (possibly unbounded) densely defined linear operators . Later on we consider instead of a general operator the Hessian and define as its adjoint.
We consider an operator , where and are Hilbert spaces and , the domain of definition of , is dense in . The adjoint is then defined as follows: if and only if and there is a linear functional such that
[TABLE]
In this case we define . Note that is well-defined for and and we have in particular
[TABLE]
The domain is a Hilbert space w.r.t. the graph norm .
As already indicated above, it is quite natural to choose and to define as an operator mapping to , (or, more precisely, to the dual of ,) given by
[TABLE]
where denotes the space of symmetric matrix-valued functions given by
[TABLE]
and equipped with the standard -norm for a matrix-valued function .
Keep in mind, in the following we always fix and obtain for the adjoint different domains of definition , which strongly depend on the choice of . There are several options how to choose . However, according to the discussion from above, there is a restriction to meet: is a dense subset of . Now we discuss three possible choices for . A first and trivial option would be . Then it is easy to see that . Note that for this choice we have , so the disadvantage for the mixed method is to work with a second-order Sobolev space for . A second option would be . Then it turns out that , where here is defined in the distributional sense. This time the disadvantage for the mixed method is to work with a second-order Sobolev space for .
The idea for the new mixed formulation is to distribute the smoothness requirements evenly among and by choosing the space as an intermediate space between and . In particular, we propose to set equal to , given by
[TABLE]
equipped with the norm .
Remark 3.1*.*
The space is the interpolation space between and . Note that we only use interpolation as motivation, but do not rely in the following on results from interpolation theory.
This choice for meets the required condition:
Lemma 3.2**.**
The subspace is dense in .
Proof.
We follow the lines of the proof of [13, Theorem 1.6.1]. In order to verify the density, we have to check that the trace space is dense in the trace space , where is the standard -trace representing the value on the boundary. By considering the situation locally near each corner in , the required density follows from the density of in and ; see [14]. ∎
Now we leave the abstract framework and use, from now on, the notations
[TABLE]
instead of and , respectively, with and unchanged and . In consistence with the abstract framework, the Hilbert space is explicitly given by
[TABLE]
equipped with the norm .
This motivates the new mixed formulation as follows: For , find and such that
[TABLE]
with the function spaces
[TABLE]
equipped with the norms and . Here, we use the notation .
The first line in (12) comes from the relation between bending moment and deflection , the second line originates from (3). Note that we require additional regularity of , namely . In contrast, for the primal problem (5) we need only .
Remark 3.3*.*
The operator as defined in (10) and the composition of the first order operators and introduced at the end of Section 2 differ in two ways. First of all, their domains of definition are different. While is only well-defined for functions , where and are -functions as well, the domain of definition of in (11) contains functions with the less restrictive requirement . The domain of definition of in (11) includes the boundary conditions on and for all in a weak sense, as we show later in Theorem 3.9.
But even on the intersection of the domains of definition coincides with , only if satisfies the boundary condition on .
Remark 3.4*.*
In [24, 25, 26] a similar nonstandard Sobolev space is introduced. Note, our way of definition is different and well-suited for the further considerations.
Problem (12) has the typical structure of a saddle point problem
[TABLE]
whose associated linear operator is given by
[TABLE]
If the bilinear form is symmetric, i.e., , and non-negative, i.e., , which is fulfilled for (12), it is well-known that is an isomorphism from onto , if and only if the following conditions are satisfied; see, e.g., [6]:
is bounded: There is a constant such that
[TABLE] 2. 2.
is bounded: There is a constant such that
[TABLE] 3. 3.
is coercive on the kernel of : There is a constant such that
[TABLE]
with . 4. 4.
satisfies the inf-sup condition: There is a constant such that
[TABLE]
We will refer to these conditions as Brezzi’s conditions with constants , , , and .
In order to verify Brezzi’s conditions for (12), we need the following result on the relation between the primal problem (5) and the new mixed problem (12).
Theorem 3.5**.**
Let be the solution of the primal problem (5) for . Then we have and solves the mixed problem (12).
Proof.
Since solves (5), it follows that {\color[rgb]{0,0,0}{\bm{M}}}\in\bm{L}^{2}(\Omega)_{\mathrm{sym}} and
[TABLE]
From the definition of the domain of the adjoint operator in (8) we obtain that , which shows that and that the second equation of (12) is satisfied. Using (9), we receive
[TABLE]
for all , which proves the first equation. ∎
Theorem 3.6**.**
The mixed problem defined by (12) and (13) satisfies Brezzi’s conditions with the constants , , and , where and as in (7).
Proof.
The verification of the first three parts of Brezzi’s conditions is simple and, therefore, omitted. For showing the inf-sup condition, let be the solution of the primal problem (5) with the right-hand side for a fixed but arbitrary . From Theorem 3.5 it follows that , and is solution of the corresponding mixed problem (12). From the second line of the mixed formulation (12) we obtain
[TABLE]
and
[TABLE]
Using the stability estimate (7) we obtain
[TABLE]
with . Hence,
[TABLE]
Therefore,
[TABLE]
which completes the proof. ∎
Remark 3.7*.*
The choice of for proving the inf-sup condition is different to the choice as it is used, e.g., in [7, 20], which would not work here, since for problems with a free boundary part.
Corollary 3.8**.**
For , the primal problem (5) and the mixed problem (12) are equivalent in the following sense: If solves (5), then and solves (12). Vice versa, if solves (12), then and solves (5).
Proof.
The first part has already been shown in Theorem 3.5. Since, both problems are uniquely solvable the reverse direction is true as well. ∎
In the case of a purely clamped plate, we have . So, in this mixed setting, on is treated as an essential boundary condition, while on becomes a natural boundary condition incorporated in the variational formulation. No boundary conditions are prescribed for , which makes the definition of an appropriate space for much easier. The space can be introduced directly as , where here is to be interpreted in the distributional sense, see [20].
The situation is more involved for mixed boundary conditions. Here we have . So on is treated as an essential boundary condition, while on and on become natural boundary conditions incorporated in the variational formulation. The remaining boundary conditions on and the corner conditions (4) are treated as essential boundary conditions: They are not explicitly visible but are hidden in the definition of the space . We doubt that there is an easy and direct way of formulating the corner conditions (4) with the help of pointwise trace operators in . However, for sufficiently smooth functions , the corner conditions can be explicitly extracted using the definition of , as we will see in the next theorem.
Theorem 3.9**.**
Let . Then if and only if
[TABLE]
Proof.
Recall the representation of in (11). For , we obtain by integration by parts
[TABLE]
Assume now that satisfies the boundary conditions (14). Then we have
[TABLE]
which is obviously bounded w.r.t. the -norm. Hence .
On the other hand, if , then the functional given by (15) is bounded w.r.t. the -norm. For we obtain
[TABLE]
where . Note that all expressions in (16) are continuous in w.r.t. the -norm. Analoguously to the proof of Lemma 3.2, one can show that is dense in w.r.t. the -norm. Then it follows that (16) is valid for all . This implies together with (15) that
[TABLE]
From this the boundary conditions in (14) follow by standard arguments. ∎
Remark 3.10*.*
A similar characterization can be derived for piecewise smoothfunctions from , e.g., for functions from finite element spaces.
4 Regular decomposition
The rather simple proof of the well-posedness of the new mixed formulation (12) comes at the cost of the nonstandard Sobolev space . The next theorem provides a regular decomposition of this space, which makes computationally accessible. In order to derive our decomposition, we need a characterization of the kernel of the distributional , given in the next lemma, see [17, 20] for a proof.
Lemma 4.1**.**
Let be simply connected. For , we have in the distributional sense iff for some function . The function is unique up to an element from .
In preparation for the next theorem, observe that . Therefore, , the normal component of is well-defined on the boundary
[TABLE]
and we have by integration by parts
[TABLE]
for all and . For smooth functions coincides with the tangential derivative of , so we use the notation
[TABLE]
Theorem 4.2**.**
Let be simply connected. For each there exists a decomposition
[TABLE]
with and satisfying the coupling condition
[TABLE]
The function is the unique solution of the Poisson problem
[TABLE]
and is unique up to an element from . Vice versa, for each given by (17) with and satisfying (18), it follows that with for all . Moreover,
[TABLE]
with positive constants and , which depend only on the constant of Friedrichs’ inequality.
Proof.
Let be the unique solution of the variational problem
[TABLE]
For we receive from integration by parts
[TABLE]
This implies in the distributional sense. According to Lemma 4.1, there exists a function such that
[TABLE]
For integration by parts provides
[TABLE]
With (21) it follows that
[TABLE]
For the reverse direction, assume that (17) and (18) hold. By using the integration by parts formula from above we obtain
[TABLE]
where (18) makes the boundary contributions vanish. This immediately implies that is bounded w.r.t. the -norm, i.e. with .
In order to show (20), note that (19) implies
[TABLE]
Hence,
[TABLE]
using Friedrichs’ inequality , where denotes the -semi-norm.
With these inequalities we obtain for the estimate from above
[TABLE]
and for the estimate from below
[TABLE]
Therefore, (20) holds with and . ∎
Remark 4.3*.*
By applying Korn’s inequality to we obtain
[TABLE]
where denotes the -orthogonal complement of in for spaces . Then it follows that
[TABLE]
So, provided the unique element is chosen for the decomposition, stability follows from (20) in standard -norms.
4.1 The coupling condition
Theorem 4.2 shows that each function can be represented by a pair of functions with
[TABLE]
Observe that (18) involves only traces of and on . We obviously have
[TABLE]
where is given by the following definition:
Definition 4.4**.**
For fixed we define
[TABLE]
So consists of those functions that fulfill (18), which becomes in this context a boundary condition for with given . In particular, functions from , the space associated to , satisfy the corresponding homogeneous boundary conditions.
It is essential for deriving a decoupled formulation that is a direct sum of two subspaces, which we will show next. For this we construct, for each , a specific function as follows: Let be a fixed edge on with boundary , where , are ordered in counterclockwise direction. We set
[TABLE]
Here denotes the arc length parametrization of in counterclockwise direction with and for some . Next we extend on the whole boundary by connecting its values at linearly on . By this becomes a continuous function on with a weak tangential derivative in satisfying
[TABLE]
Finally, let be the harmonic extension of , which is well-defined, since we obviously have .
Lemma 4.5**.**
For each , let \psi[q]\in{\color[rgb]{0,0,0}{(H^{1}(\Omega))^{2}}} be given as described above. Then and we have
[TABLE]
Moreover, there is a constant such that
[TABLE]
Proof.
For all , we have
[TABLE]
since on , which shows that . The decomposition (23) can easily be derived from the representation
[TABLE]
The sum is direct, since for . Finally, for showing (24), observe that
[TABLE]
where in the counterclockwise parametrization of we have and and denotes the length of . From this and (22) it easily follows that
[TABLE]
Here denotes the space of functions with weak tangential derivative with corresponding norm , see, e.g., [22]. The rest follows from standard trace and inverse trace inequalities. ∎
Remark 4.6*.*
The above construction relies on the assumption that we have at least one clamped edge, which we made at the beginning of this paper. However, this construction can be extended for general mixed boundary conditions using the freedom we have in the choice of on clamped and simply supported edges and the compatibility conditions on .
Lemma 4.7**.**
The space is equal to the set of all functions that satisfy the following boundary conditions:
[TABLE]
with some constants for each edge and functions for each connected component satisfying the compatibility conditions , if is an adjacent edge to a component of , where is the enclosed corner point and is the normal on . Moreover, for each set of constants and functions that satisfy the compatibility conditions, there is a function , for which the boundary conditions (25) hold.
Proof.
For and we have
[TABLE]
using integration by parts and the boundary conditions for . Now let and let be an edge from . For each function , one can easily construct a function with and on . Since , we have , which reduces to
[TABLE]
by using (26). Hence, is equal to a constant on . By a similar argument it follows that is equal to a constant on each edge .
Using that is edgewise constant on {\color[rgb]{0,0,0}{\Gamma_{s}\cup\Gamma_{f}}} and is edgewise constant on , we obtain from (26) by edgewise integration by parts:
[TABLE]
Now let and be two adjacent edges from with the common corner point and let . Then the condition reduces to
[TABLE]
Observe that on each edge of and is the trace of an -function. Therefore, must be continuous on , which implies . Since can be chosen arbitrarily, it follows that . So is not only constant on each edge of but it is equal to the same constant on each edge of a connected component of . Since we additionally know from above that is constant on such an edge, it easily follows that on each edge of with . Since is continuous on , is continuous, too. Then it follows that is equal to a common constant on . Hence, on .
Let be an edge adjacent to a connected component of with enclosed corner point . By a similar argument as above one can deduce from and (27) the compatibility condition .
For proving the reverse direction, let satisfy the boundary conditions (25). Using (27) we have
[TABLE]
for all for the following reasons: on all interior corner points of , is continuous on , and on corner points on the interface of or with , and the compatibility conditions on corner points on the interface of and . So it follows that .
Note, on all interior corner points of , since on . This makes the tangential derivative vanish at this corner points for two linear independent tangential directions. Therefore, we obtain and
For the last part, let a set of data for each edge and for each connected component be given, which satisfy the compatibility conditions. We will first construct a continuous function on with for each edge , where is the set of polynomials of degree , by prescribing its values on all corner points as follows:
[TABLE]
Here and are defined as follows: For a common corner point of , is uniquely given by
[TABLE]
For a common corner point of and , is uniquely given by
[TABLE]
Let be the harmonic extension of . It is easy to verify that the boundary conditions (25) are satisfied. ∎
In order to eliminate and in (25) we introduce the following Clément-type projection operator on .
Definition 4.8**.**
Let . Then the projection is given by , where is constructed as in the last part of the proof of Lemma 4.7 from the data and , which are the -projection of onto the set of constant functions and the -projection of onto , respectively. Except if is an adjacent edge to a component of , then , where is the enclosed corner point and is the normal on , in order to enforce the compatibility conditions.
With this notation the boundary conditions (25) can be rewritten as
[TABLE]
with .
4.2 Decoupled formulation
Using the representations
[TABLE]
together with (23) leads to the following equivalent formulation of (12): Find , and such that
[TABLE]
for all , and . For the representations of and recall Theorem 4.2, in particular for we use identity (19) and for we rely on the reverse direction. Therefore, the mixed formulation of the Kirchhoff plate bending problem is equivalent to three (consecutively to solve) elliptic second-order problems:
The -problem: Find such that
[TABLE] 2. 2.
The -problem: For given , find such that
[TABLE] 3. 3.
The -problem: For given , find such that
[TABLE]
Remark 4.9*.*
For the rotated function the -problem becomes a linear elasticity problem
[TABLE]
with a appropriately rotated material tensor .
Remark 4.10*.*
If we only have clamped and simply supported boundary parts, we know from Section 4.1 that on . Therefore, the terms involving just vanish. Furthermore, in the purely clamped case and become .
Remark 4.11*.*
The -problem and the -problem are standard Poisson problems with mixed boundary conditions on and . 2. 2.
From (30) we obtain
[TABLE]
therefore, . With the representation , using , we receive that the solution of the -problem satisfies the second-order differential equation
[TABLE]
the (essential) boundary conditions (see (28))
[TABLE]
and the following condition for the flux :
[TABLE]
If , then (35) is equivalent to the following (natural) boundary conditions
[TABLE]
and
[TABLE]
where on is used (see the -problem). 3. 3.
For the rotated function , (33) is a linear elasticity problem
[TABLE]
with the corresponding boundary conditions for and \big{(}\hat{\mathcal{C}}^{-1}\varepsilon(\phi^{\perp})\big{)}n, which can be interpreted as displacement and traction.
Remark 4.12*.*
So far we have only considered homogeneous boundary conditions. In the following we indicate how to adapt the decoupled formulation introduced above to inhomogeneous boundary conditions of the form (cf. [27, 18]):
[TABLE]
and the corner forces
[TABLE]
In the -problem (29) the additional contribution on the right-hand side is given as
[TABLE] 2. 2.
In the -problem (30) the boundary value needed in the construction of has to be adapted. With the same notations as used for (22) we set
[TABLE]
where is edgewise constant, given by
[TABLE]
Here, the edges for are numbered consecutively in counterclockwise direction with starting from . Furthermore, we denote the vertex at the end point of by and use the convention for corner points .
As additional contribution on the right-hand side of the -problem (30) we obtain
[TABLE]
provided . 3. 3.
In the -problem (31) we get as additional contribution on the right-hand side, where is any extension of the Dirichlet data .
5 The discretization method
Let be a shape-regular family of subdivisions of the domain into polygonal elements. The diameter of an element is denoted by and we define . We denote the set of all edges of elements with by and with by . The length of an edge is denoted by . Moreover, we assume that the total number of edges in is bounded by . Here and in the sequel denotes a generic constant independent of , possibly different at each occurrence. Note, this assumption is weaker than requiring a quasiuniform family of subdivisions. It can be viewed as a quasiuniformity condition in a neighborhood of the boundary.
Remark 5.1*.*
Observe that the symbol is used to indicate element edges, while the symbol used in the preceding sections is reserved for edges of the domain as introduced at the beginning of Section 2.
Let be a finite dimensional subspace of of piecewise polynomials with degree associated with and we set . For , with , we assume the standard approximation property
[TABLE]
for all . Moreover, we require the discrete trace inequality
[TABLE]
and the continuous trace inequality
[TABLE]
Here and in the following the -norm on an element and an edge are denoted by and , respectively. The properties (A1), (A2), (A3) are satisfied for standard finite element spaces or isogeometric B-spline discretization spaces under standard assumptions.
The method we propose consists of three consecutive steps:
The discrete -problem: Find such that
[TABLE] 2. 2.
The discrete -problem: For given , find such that
[TABLE]
with
[TABLE]
where
[TABLE]
for some penalty parameter . 3. 3.
The discrete -problem: For given , find such that
[TABLE]
with
[TABLE]
Remark 5.2*.*
- (a)
The discrete -problem is the standard Galerkin method applied to (29). 2. (b)
The discrete -problem is a Nitsche method applied to (30), which is derived as follows. We start from the identity
[TABLE]
which follows from (32) by multiplying with a test function and using integration by parts.
Plugging in the second term of (42) the representation of leads to
[TABLE]
with . For the next step note that on and according to Lemma 4.7 there exists a such that on . Then the natural boundary conditions (36) and (37) (with replaced by ) lead to
[TABLE]
provided . Then the method is obtained by first extending (42) by the terms and , which vanish for the exact solution (see (34)), and then by replacing , , and with , , and . Following [11] we call , , and the consistency, symmetry and penalty terms, respectively. 3. (c)
The discrete -problem is the standard Galerkin method applied to (31), where the right-hand side is reformulated as follows. By using (42) and (44) with we obtain for the right-hand side of (31):
[TABLE]
where we additionally extend by the term , which vanishes for the exact solution. Then (41) is obtained by replacing , , and with , , and h.
Remark 5.3*.*
Since only and appear in the numerical method, the extensions of and to the interior are not needed. Although the functions do not have local support, the linear systems can still be assembled with optimal complexity.
Remark 5.4*.*
Our decomposition of the continuous problem also leads to a new interpretation of the well-known Hellan-Herrmann-Johnson (HHJ) method; see [15, 16, 19]. We can proceed similar as in Theorem 4.2 and derive a discrete regular decomposition for the approximation space of the auxiliary variable, leading to a reformulation of the HHJ method in form of three consecutively to solve discretized second-order problems, as it has already been worked out in details in the purely clamped situation in [20]. The HHJ method is mainly restricted to triangular meshes. In [28] a HHJ-type method on rectangular meshes is considered. The new method introduced above is more flexible in the sense that triangular and general quadrilateral meshes can be handled and also isogeometric B-spline discretization spaces can be used.
The main result of this section is the following a priori discretization error estimate for the proposed method.
Theorem 5.5**.**
Assume that is convex. Let , with , be the solution of the mixed formulation and , with , be the approximate solution, given by (38), (39), (40). For , and , with and , we have the estimate
[TABLE]
Especially, for , and we obtain
[TABLE]
We will derive these estimates by discussing the discretization errors of the -problem, the -problem, and the -problem consecutively.
5.1 Error estimates for the -problem
We start with the -problem (29) and its discretization (38). It is well-known that the following error estimates hold:
Lemma 5.6** (-problem).**
Under the assumptions of Theorem 5.5 we have
[TABLE]
We refer to standard literature for the proof. Note that the convexity of is used only for the -estimates.
5.2 Error estimates for the -problem
We follow the standard approach as outlined, e.g., in [11] and introduce two mesh-dependent semi-norms: the jump semi-norm and the average semi-norm , which here are given by
[TABLE]
The analysis relies on the discrete coercivity and the boundedness of the bilinear form in appropriate norms.
Lemma 5.7** (Coercivity).**
There is a constant such that
[TABLE]
provided is sufficiently large, where the mesh-dependent norm is given by
[TABLE]
Lemma 5.8** (Boundedness).**
There is a constant such that
[TABLE]
for all , with and , where the mesh-dependent norm is given by
[TABLE]
The proofs of these two lemmas are analogous to the proofs of similar results in [11] and are, therefore, omitted. However, for later use, we explicitly mention here the fundamental estimates for the consistency, symmetry, and penalty terms which are used for proving coercivity and boundedness: For all , , we have
[TABLE]
Obviously, (46) simplifies to
[TABLE]
Additionally we need an estimate of the consistency error.
Lemma 5.9** (Consistency error).**
Under the assumptions of Theorem 5.5 we have
[TABLE]
Proof.
From Remark 5.2 it follows that satisfies
[TABLE]
for all . Therefore, the difference to the right-hand side in (39) is given as
[TABLE]
From the Cauchy inequality on and (47), (49), (48) we obtain
[TABLE]
From the continuous trace inequality (A3) it follows that
[TABLE]
From the definition of and one obtains
[TABLE]
for all , , and .
For the first inequality note that
[TABLE]
where and with and are the data used in the construction of in Definition 4.8. On an edge we have
[TABLE]
By similar arguments analogous results hold for and . Combining these estimates with
[TABLE]
provides the first inequality. The second inequality holds since
[TABLE]
Using that the total number of edges in is bounded by it follows that
[TABLE]
and, therefore,
[TABLE]
Then the estimate immediately follows from the error estimates in Lemma 5.6. ∎
From the last three lemmas we obtain the following error estimate for the -problem:
Lemma 5.10** (-problem).**
Under the assumptions of Theorem 5.5 we have
[TABLE]
Proof.
From coercivity and boundedness we obtain by standard arguments:
[TABLE]
Since , with , it follows from assumptions (A1) and (A3) that
[TABLE]
This approximation property and Lemma 5.9 directly imply the error estimate. ∎
5.3 Error estimates for the -problem
Lemma 5.11** (-problem).**
Under the assumptions of Theorem 5.5 we have
[TABLE]
Proof.
The first lemma of Strang provides
[TABLE]
The first term can be estimated by the approximation property (A1). It remains to estimate the consistency error. Using (31) with (45) and (41) we have
[TABLE]
Subtracting (42) and (39) leads to
[TABLE]
By subtracting the last two equations we obtain
[TABLE]
The five terms on the right-hand side, denoted by , , … in consecutive order of their appearance, are estimated as follows: From the Cauchy inequality on and (46), (47), (49), (48) we obtain
[TABLE]
for all . In particular, we choose , where denotes the -orthogonal projection onto . Then, following , e.g., [11], it can be shown that
[TABLE]
With the stability estimate (24) it follows that
[TABLE]
Observe that
[TABLE]
and
[TABLE]
see the estimates in the proof of Lemma 5.10. Then the result follows directly from the estimates in Lemma 5.6, Lemma 5.10, and (A3*). ∎
Finally, we obtain the proof of the main result:
Proof of Theorem 5.5.
By combining the results of Lemma 5.6 and Lemma 5.10 we obtain
[TABLE]
Together with Lemma 5.11 this completes the proof. ∎
6 Numerical experiments
We consider a square plate with simply supported north and south boundary, clamped west boundary and free east boundary. The material tensor is the identity, and the load is given by
[TABLE]
The exact solution is of the form
[TABLE]
which satisfies the boundary conditions on the simply supported boundary parts anyway. The constants and are chosen such that the four remaining boundary conditions (on the clamped and free boundary parts) are fulfilled, for details, see [27].
In order to illustrate the flexibility of our discretization method we use for isogeometric B-spline discretization spaces of degree with maximum smoothness; see, e.g, [9, 10] for information on isogeometric analysis. For , the discretization space coincides with the standard finite element space of continuous and piecewise bilinear elements. In all experiments a sparse direct solver is used for each of the three sub-problems. The implementation is done in the framework of G+Smo ("Geometry + Simulation Modules"), an object-oriented C++ library, see https://ricamsvn.ricam.oeaw.ac.at/trac/gismo/wiki/WikiStart.
In Tables 1, 2, 3 the discretization errors for are shown. The first column shows the refinement level , i.e. the number of uniform -refinements of . The column "order" contains the error reduction relative to the previous level. The experiments show optimal convergence rates for and as predicted by the analysis. For the columns containing the errors for and , the (analytically not available) exact solutions and are replaced by their numerical solutions on level . Note that also for and optimal convergence rates are observed.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. A. Adams and J. J. F. Fournier. Sobolev Spaces. 2nd ed. New York, NY: Academic Press, 2nd ed. edition, 2003.
- 2[2] I. Babuška, J. Osborn, and J. Pitkäranta. Analysis of mixed methods using mesh dependent norms. Math. Comput. , 35:1039–1062, 1980.
- 3[3] L. Beirão Da Veiga, J. Niiranen, and R. Stenberg. A family of C 0 superscript 𝐶 0 {C}^{0} finite elements for Kirchhoff plates. I: Error analysis. SIAM J. Numer. Anal. , 45(5):2047–2071, 2007.
- 4[4] L. Beirão da Veiga, J. Niiranen, and R. Stenberg. A family of C 0 superscript 𝐶 0 C^{0} finite elements for Kirchhoff plates. II: Numerical results. Comput. Methods Appl. Mech. Eng. , 197(21-24):1850–1864, 2008.
- 5[5] H. Blum and R. Rannacher. On mixed finite element methods in plate bending analysis. I: The first Herrmann scheme. Comput. Mech. , 6(3):221–236, 1990.
- 6[6] D. Boffi, F. Brezzi, and M. Fortin. Mixed Finite Element Methods and Applications . Berlin: Springer, 2013.
- 7[7] F. Brezzi and P. Raviart. Mixed finite element methods for 4th order elliptic equations. Topics in numerical analysis III, Proc. R. Irish Acad. Conf., Dublin 1976, 33-56 (1977)., 1977.
- 8[8] L. Chen and X. Huang. Differential complex, Helmholtz decompositions, and decoupling of mixed methods. Ar Xiv e-prints , Nov. 2016.
