Next Article in Journal
Quantum Vision Transformers for Quark–Gluon Classification
Previous Article in Journal
Quasi-Configurations Derived by Special Arrangements of Lines
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A C0 Nonconforming Virtual Element Method for the Kirchhoff Plate Obstacle Problem

1
College of Mathematics and Systems Science, Xinjiang University, Urumqi 830017, China
2
School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an 710049, China
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(5), 322; https://doi.org/10.3390/axioms13050322
Submission received: 19 March 2024 / Revised: 3 May 2024 / Accepted: 8 May 2024 / Published: 13 May 2024

Abstract

:
This paper investigates a novel C 0 nonconforming virtual element method (VEM) for solving the Kirchhoff plate obstacle problem, which is described by a fourth-order variational inequality (VI) of the first kind. In our study, we distinguish our approach by introducing new internal degrees of freedom to the traditional lowest-order C 0 nonconforming VEM, which originally lacked such degrees. This addition not only facilitates error estimation but also enhances its intuitiveness. Importantly, our novel C 0 nonconforming VEM naturally satisfies the constraints of the obstacle problem. We then establish an a priori error estimate for our novel C 0 nonconforming VEM, with the result indicating that the lowest order of our method achieves optimal convergence. Finally, we present a numerical example to validate the theoretical result.

1. Introduction

The Kirchhoff plate model is employed to characterize the bending behavior of thin plates. It is based on thin plate theory and is suitable for structures with relatively small thicknesses [1,2,3]. The model assumes that the thin plate remains planar during bending, disregarding thickness variations and shear deformations, and solely focusing on the bending and stretching behaviors of the plate [4]. It is widely utilized in engineering fields such as aerospace, civil engineering, and automotive engineering. Mathematically, the Kirchhoff plate problem is typically formulated as a fourth-order partial differential equation (PDE) that describes the deflection of the plate [5]. The Kirchhoff plate obstacle problem is a mathematical model utilized for investigating the behavior of thin plates in the presence of obstacles or constraints, with significant implications in various engineering and scientific fields such as structural mechanics [6] and material science.
The Kirchhoff plate obstacle problem addressed in this paper can be formulated as a typical variational inequality (VI) of the first kind [7,8]. A VI is a mathematical concept utilized to describe specific types of constrained optimization problems arising in situations where the goal is to minimize a certain functional while adhering to constraints defined by inequalities. VIs arise in various domains of mathematics and physics, such as the investigation of PDEs, optimization, and game theory [9,10,11,12]. They offer a robust framework for modeling and analyzing problems with constraints and have been extensively researched in the field of nonlinear functional analysis. In general, there is no exact solution to VIs, so it is crucial to develop effective numerical methods for solving them. Particularly, for the plate obstacle problem, which arises in various engineering and physical applications, understanding the numerical solution of these problems helps in practical engineering designs and simulations. Furthermore, developing efficient algorithms for solving the plate obstacle problem can lead to improvements in computational efficiency and accuracy. Investigating different numerical methods and their performance can help in designing better algorithms for similar types of problems [13,14,15]. Therefore, investigating the numerical solution of the plate obstacle problem is essential for advancing both the theoretical understanding of numerical methods for PDEs and their practical applications in various fields.
The virtual element method (VEM) is a numerical technique utilized for solving PDEs, initially proposed in [16]. A key characteristic of the VEM is its capability to handle general polygonal (or polyhedral) meshes and hanging nodes, which are commonly encountered in practical engineering applications but pose challenges for traditional finite element methods (FEMs) [17,18,19]. The VEM formulation allows for the utilization of different polynomial degrees or even non-polynomial functions for approximating the solution and its derivatives within an element, providing flexibility in balancing accuracy and computational cost.
Additionally, the VEM allows for the incorporation of various types of boundary conditions and material properties, making it suitable for a wide range of problems, such as linear elasticity [20,21,22], Stokes or Navier–Stokes equations [23,24,25], Cahn–Hilliard equations [26], and so on. It also has the potential to achieve high accuracy while maintaining a low computational cost, especially for problems with highly heterogeneous materials or discontinuous solutions. Overall, the VEM is a promising approach for solving PDEs, offering a flexible and efficient numerical technique that can handle a wide range of practical engineering problems. In the context of plate problems, Brezzi and Marini introduced the conforming VEM in [27]. To relax continuity requirements, Zhao et al. developed the C 0 nonconforming VEM for the plate problem in [28]. Subsequently, a Morley-type VEM with fewer degrees of freedom was also formulated for handling fourth-order problems [29,30].
In recent years, VEMs have been successfully used for solving variational inequalities [31,32,33,34,35,36,37]. Particularly, for the study of VIs in the plate problem, Wang and Zhao studied conforming and nonconforming VEMs for plate friction contact problems [38]. Compared to the conforming VEM, the nonconforming VEM relaxes the continuity requirements and reduces the degrees of freedom. The C 0 and fully nonconforming VEMs for the first kind of VI problems were studied in [39]. As a continuation of the aforementioned method, this study investigates the application of a C 0 nonconforming VEM to solve the Kirchhoff plate obstacle problem, which is expressed by a fourth-order VI of the first kind. For the conventional lowest-order C 0 nonconforming VEM, which initially lacked internal degrees of freedom, our novel approach involves introducing new internal degrees of freedom. This addition not only simplifies error estimation but also improves its intuitiveness. Crucially, our novel C 0 nonconforming VEM naturally satisfies the constraints of the obstacle problem. Subsequently, we establish an a priori error estimate for our novel C 0 nonconforming VEM. The outcome of this error estimate reveals that the lowest order of our method achieves optimal convergence. Finally, we present a numerical example to verify the results of the theoretical analysis.
The remainder of this paper is structured as follows. Section 2 outlines the plate obstacle problem and its variational formulation. Section 3 focuses on C 0 nonconforming VEMs for solving the target problem. In Section 4, we provide a priori error analysis, illustrating that the lowest-order VEM achieves optimal convergence order. In Section 5 presents a numerical example to verify the results of the theoretical analysis. Finally, in Section 6, we provide a summary of this paper.

2. Plate Obstacle Model

In this section, we initially present the plate obstacle model and its variational form. Subsequently, we provide detailed pointwise relations of the model.

2.1. Model Problem and Its Variational Inequality

Consider an open, bounded two-dimensional domain D , and let α be a positive integer. We utilize the notations · α , D and | · | α , D to represent the norm and seminorm, respectively, of the Sobolev space H α ( D ) . When α = 0 , H α ( D ) reduces to the standard Lebesgue space L 2 ( D ) with norm | · | D and the associated L 2 inner product ( · , · ) D . For the sake of brevity, we omit the subscript in cases where D = Ω . For any nonnegative integer k, P k ( D ) represents the space of polynomial functions with degree at most k. We denote the unit outward normal to the boundary of D as n and the unit tangential vector as t . If v H 1 ( D ) , n v and t v denote the normal and tangential derivatives on the boundary, respectively.
Our focus is on the plate obstacle problem, which is expressed as a first-kind fourth-order elliptic variational inequality [40,41]. Given a downward force f in the center of an elastic thin plate with a fixed and non-rotatable boundary, there exists an obstacle ψ beneath the plate. When the force f causes deformation of the thin plate, the bounded region Ω can be divided into two parts: the contact area Ω 0 and the non-contact area Ω + , as shown in Figure 1. This equilibrium problem, involving the upper plate covering the obstacle ψ , can be described by a variational inequality in Problem P.
In the context of a thin plate occupying the space Ω × ( d / 2 , d / 2 ) , where Ω R 2 is a bounded polygonal domain and d > 0 represents the small thickness of the plate, the boundary of Ω is denoted by Γ . Assume the material to be isotropic and linearly elastic, characterized by a positive Young’s modulus E and a positive Poisson’s ratio with ν < 0.5 . Within this setting, let D 0 f denote the normal force density acting on the plate, and let D 0 represent the bending rigidity. Generally, the bending rigidity depends on the material properties of the plate and its thickness. For a thin plate, the bending rigidity can be expressed as
D 0 = E d 3 12 ( 1 ν 2 ) ,
Let us consider the following elliptic variational inequality for the Kirchhoff plate obstacle problem.
Target Problem T . For a given right-hand side l L 2 ( Ω ) and obstacle ξ H 2 ( Ω ) with the constraint ξ 0 on Γ , we seek to find u S that satisfies the following equation:
A ( u , v u ) ( l , v u ) v S ,
where
S = { v H 0 2 ( Ω ) ; v ξ in Ω } .
Here, the bilinear form is
A ( u , v ) = Ω Δ u Δ v + ( 1 ν ) ( 2 12 u 12 v 11 u 22 v 22 u 11 v ) d x .
The bilinear form A ( · , · ) in Target Problem T is characterized by both boundedness and coercivity, meaning that there exist constants λ 1 and λ 2 such that
A ( u , v ) λ 1 | u | 2 | v | 2 u , v H 2 ( Ω ) ,
A ( v , v ) λ 2 | v | 2 2 v H 2 ( Ω ) ,
where λ 1 = 1 + ν and λ 2 = 1 ν [28]. According to the theory of VI, it has been established that Target Problem T is well posed [42,43].
For our target problem, we posit that u lies within the space H 3 ( Ω ) [43,44]. To streamline the bilinear form, we give the following auxiliary matrix-valued function [41]:
ϵ = ( 1 ν ) 2 u ν tr ( 2 u ) I ,
where I denotes the second-order identity matrix and tr ( · ) represents the operation of computing the trace of matrices. The notation v indicates the gradient of v, while 2 v signifies the Hessian of v. The normal and tangential components of ϵ n are defined as ϵ n = ϵ n · n and ϵ t = ϵ n ϵ n n , respectively.
Let us introduce the double-dot inner product between ϱ and ϵ as ϵ : ϱ = i , j = 1 2 ϵ i j ϱ i j and define the corresponding norm | ϱ | = ( ϱ : ϱ ) 1 / 2 , where ϱ and ϵ are second-order tensors. We note that for a scalar function v and a symmetric matrix-valued function ϱ , the following integration-by-parts formula holds:
D v · ( · ϱ ) d x = D 2 v : ϱ d x D v · ( ϱ n ) d s + D v n · ( · ϱ ) d s ,
Utilizing the definition (5) of ϵ , we can express (2) as
A ( u , v ) = Ω ϵ : 2 v d x ,
or split it as
A ( u , v ) = T T h A T ( u , v ) = T T h T ϵ : 2 v d x ,
where T h denotes a decomposition of Ω ¯ . Alternatively, we can express (1) as
Ω ϵ : 2 ( v u ) d x Ω l ( v u ) d x .

2.2. Pointwise Relations of the Solution

To comprehend the behavior of the solutions and conduct numerical analysis, it is essential to have the following lemma regarding pointwise relations.
Lemma 1.
Given the regularity condition u H 3 ( Ω ) for the solution of Target Problem T , the following results hold within the domain Ω:
· ( · ϵ ) l 0 , u ξ 0 , · ( · ϵ ) l ( u ξ ) = 0 .
Proof. 
By utilizing (6) and considering that v u = n ( v u ) = 0 on Γ , we can rewrite (7) as
Ω · ( · ϵ ) l ( v u ) d x 0 .
Consider (9), where we let v = u + O K for any O C 0 ( Ω ) with O 0 . This leads to the inequality
Ω · ( · ϵ ) l O d x 0 O C 0 ( Ω ) , O 0 ,
so
· ( · ϵ ) l 0 i n Ω .
Partition Ω into two regions, one without contact and one with contact, according to the following scheme:
Ω + = { x Ω : u ( x ) > ξ ( x ) } ,
Ω 0 = { x Ω : u ( x ) = ξ ( x ) } .
Given any Q ( x ) C 0 ( Ω ) such that 0 Q ( x ) 1 , it follows that Q ( x ) ξ + ( 1 Q ( x ) ) u S . Substituting v with Q ( x ) ξ + ( 1 Q ( x ) ) u in (9) yields
Ω · ( · ϵ ) l Q ( x ) ( ξ u ) d x 0 Q ( x ) C 0 ( Ω ) , 0 Q ( x ) 1 .
And then
Ω + · ( · ϵ ) l Q ( x ) ( ξ u ) d x 0 Q ( x ) C 0 ( Ω ) , 0 Q ( x ) 1 ,
and thus
· ( · ϵ ) l 0 in Ω + .
By combining (10) and (11), we conclude that
· ( · ϵ ) l = 0 in Ω + .
Consequently, the following results are derived:
· ( · ϵ ) l = 0 in Ω + = { x Ω ; u ( x ) > ξ ( x ) } , · ( · ϵ ) l 0 in Ω 0 = { x Ω ; u ( x ) = ξ ( x ) } , ( · ( · ϵ ) l ) ( u ξ ) = 0 i n Ω .

3. C 0 Nonconforming VEM

In this section, building upon the concepts outlined in [28,38], we present the C 0 nonconforming VEM for solving Target Problem T . Let { T h } h be a collection of decompositions acquired by dividing Ω ¯ into polygonal elements. We define h T = diam ( T ) , h e = diam ( e ) , and h = max { h T ; T T h } . The following assumptions are made [45].
A1. For every h and each T T h , a constant γ > 0 exists such that the following conditions hold:
  • T is star-shaped in relation to a ball with a radius greater than or equal to γ h T ;
  • The ratio of the shortest edge to h T is larger than γ .
Denote the set of all the edges of T h as D h , let D h i represent the set of all internal edges, and D h = D h D h i . For any e D h i , let I e : = T + T , where it represents the intersection of element T + and T . n T stands for the unit outward normal vectors pointing from T + to T for any T T h , and n e represents a unit normal of an edge e D h . The orientation of n e is selected arbitrarily but remains consistent from T + to T for every e = T + T . This orientation aligns with the outward normal of Ω for boundary edges. The jump of a function ω across the edge e = T + T is given by
[ ω ] : = ω + ω ,
where ω + denotes the part of ω that lies within T + and ω denotes the part within T . For any e D h , we define [ ω ] : = ω . The jump can be similarly defined for vector-valued functions. Additionally, we introduce the broken Sobolev space for any positive constant m.
H m ( T h ) : = { v L 2 ( Ω ) ; v | T H m ( T ) T T h } ,
with the broken H m -norm
v m , h 2 : = T T h v m , T 2 ,
and the broken H m -seminorm
| v | m , h 2 : = T T h | v | m , T 2 .
Following [28,38], we define the finite-dimensional space V h and, for clarity, present subspaces of H 2 ( T h ) .
H 2 , nc ( T h ) = v h H 0 1 ( Ω ) H 2 ( T h ) ; e n v h d s = 0 e E h .

3.1. Construction of the C 0 Nonconforming VEM

In this subsection, the C 0 nonconforming virtual element (VE) method for solving Target Problem T is developed. In obstacle problems, achieving high regularity in solutions is challenging, even when the force l = 0 , the obstacle function ξ , and the boundary of the region are sufficiently smooth. As a result, optimal convergence orders cannot be attained with high-order methods. Therefore, our focus in this study is on utilizing lowest-order VEMs with k = 2 .
Local construction of V h T . For any element T T h with m edges, the local virtual element space V h T is defined as follows:
V h T : = v H 2 ( T ) ; Δ 2 v P 0 ( T ) , v | e P 2 ( e ) , Δ v | e P 0 ( e ) e T .
The degrees of freedom (d.o.f.s) associated with the space V h T are as follows:
D 1 : The value of the function v at the vertex of the element T ;
D 2 : 1 h e e v d s e T ;
D 3 : e n v d s e T ;
D 4 : 1 | T | T v d x .
Figure 2 illustrates the DOFs in (13)–(16), and the total number of DOFs is given by
N dof T , nc = 3 m + 1 .
Lemma 2.
Assuming T is a convex polygon, the degrees of freedom in (13)–(16) are unisolvent for V h T .
Proof. 
Since the dimension of V h T equals the total number of DOFs in (13)–(16), showing that all DOFs uniquely determine a function in V h T is sufficient to prove uniqueness. Assuming that all DOFs of v are zero, it is sufficient for us to prove that v is equal to 0. For each edge e of the element T, we know that v | e P 2 ( e ) and v | T C 0 ( T ) . And since the degrees of freedom in (13) and (14) are all zero, we can derive that v | T = 0 . Using the twice Green’s formula, we have
T | Δ v | 2 d x = T v Δ 2 v d x + T Δ v v n T d s T v Δ v n T d s = T v Δ 2 v d x + T Δ v v n T d s .
Since V h T is defined in (12), it follows that Δ 2 v P 0 ( T ) and Δ v | e P 0 ( e ) . Given that the degrees of freedom in (15) and (16) are all zero, the right-hand side of the above equation evaluates to zero. Consequently, we have Δ v = 0 on T. On the boundary of the element T, it holds that v = 0 , thus leading to the conclusion that v 0 . □
The global construction of V h . The global space for C 0 nonconforming virtual elements with k = 2 is characterized by
V h : = { v H 2 , nc ( T h ) ; v | T V h T T T h } .
The global DOFs are as follows:
D ˜ 1 : The value of the function v at the vertex of the mesh ;
D ˜ 2 : 1 h e e v d s for all edges of the mesh ;
D ˜ 3 : e n v d s for all edges of the mesh ;
D ˜ 4 : 1 | T | T v d x for all elements of the mesh .
For each element T T h , suppose that χ i represents the operator corresponding to the i-th local degree of freedom, as defined in (13)–(16), where i = 1 , 2 , , N dof T , nc . The construction implies that for any sufficiently smooth function g, there exists a unique interpolation g I V h T satisfying
χ i ( g g I ) = 0 , i = 1 , 2 , , N dof T , nc .
Subsequently, the following approximation results are valid.
Lemma 3
([28]). For every element T T h and every function g belonging to the Sobolev space H s ( T ) , where 2 r 3 , there exist functions g I V h T and g π P 2 ( T ) satisfying
g g I m , T C h r m | g | r , T , m = 0 , 1 , 2 ,
g g π m , T C h r m | g | r , T , m = 0 , 1 , 2 .
Construction of A h . Following the approach outlined in [28,38], we construct a discrete bilinear form A h that is both symmetric and computable. Utilizing (6), we obtain
A T ( p , v ) = T · ( · ϵ ( p ) ) v d x T ( ϵ ( p ) n ) · v d s + T ( · ϵ ( p ) ) · n v d s
for any p P 2 ( T ) and v V h T . Using the local DOF of v as defined in (13)–(16), the terms on the right-hand side of (24) can be computed straightforwardly.
Prior to establishing A h ( · , · ) , we initially introduce a projection operator Π T : V h T P 2 ( T ) V h T , defined as
A T ( Π T η , q ) = A T ( η , q ) q P 2 ( T ) η V h T , Π T η ^ = η ^ , T Π T η d s = T η d s .
Here, we define the quasi-average η ^ as the average value computed from the values at the m vertices b i of T, given by
η ^ = 1 m i = 1 m η ( b i ) .
Verification of the fact that
Π T v = v v P 2 ( T ) .
is straightforward. Furthermore, consider
S T ( v , w ) = i = 1 N dof nc , T h i 2 χ i ( v ) χ i ( w ) ,
where h i represents the characteristic length associated with each degree of freedom χ i . Subsequently, we establish
A h T ( u , v ) : = A T ( Π T u , Π T v ) + S T ( u Π T u , v Π T v ) u , v V h T .
We can observe that the bilinear form A h T satisfies the following properties:
Polynomial consistency: v h V h T ,
A h T ( v h , p ) = A T ( v h , p ) p P k ( T ) ;
Stability: The constants β * > 0 and β * > 0 exist, which are independent of h and T, such that
β * A T ( v h , v h ) A h T ( v h , v h ) β * A T ( v h , v h ) v h V h T .
It should be emphasized that (3) and (4) remain valid for functions in V h T .
A T ( u h , v h ) λ 1 | u h | 2 , T | v h | 2 , T u h , v h V h T , A T ( v h , v h ) λ 2 | v h | 2 , T 2 v h V h T .
Consider that | · | 2 , h defines a norm on the space H 2 , nc ( T h ) [38]. Moreover, (3) and (4) remain valid for functions in H 2 , nc ( T h ) . The stability (27) of A h ( · , · ) and the continuity requirement (3) of A ( · , · ) straightforwardly imply the continuity
A h T ( u h , v h ) β * λ 1 | u h | 2 , T | v h | 2 , T u h , v h V h T .
Define the bilinear form
A h ( u h , v h ) = T T h A h T ( u h , v h ) .
By the same argument as in [28], the stability (27) and continuity (28) lead to
A h ( u h , v h ) β * λ 1 | u h | 2 , h | v h | 2 , h u h , v h V h ,
A h ( v h , v h ) β * λ 2 | v h | 2 , h 2 v h V h .
Construction of the right-hand side l h .
Define l h ( V h ) such that
l h , v h = T T h T P 0 T l v h ^ d x v h V h .
Consequently, the approximation property is given by
l l h ( V h ) C h l 0 ,
where l l h ( V h ) = sup v h V h ( l , v h ) l h , v h | v h | 2 , h .

3.2. C 0 Nonconforming VE Scheme

After establishing the VE space, A h and l h , we can now introduce the C 0 nonconforming VE scheme for solving the plate obstacle problem, denoted as Target Problem T .
Target Problem T h . Find u h S h such that
A h ( u h , v h u h ) l h , v h u h v h S h ,
where
S h = { v h V h ; D ˜ i ( v h ) D ˜ i ( ξ ) , i = 1 , 2 , 4 . } .

4. Error Estimation

In this section, we derive a priori error estimation of the C 0 nonconforming VEM applied to solve for Target Problem T h .
Theorem 1.
Let u H 3 ( Ω ) H 0 2 ( Ω ) be the solution of Target Problem T and u h be the solution of Target Problem T h . Assuming that ξ H 3 ( Ω ) , l L 2 ( Ω ) and · ( · ϵ ) L 2 ( Ω ) , we have
| u u h | 2 , h C h ,
where the constant C depends only on l , ξ , u and constants λ 1 , λ 2 , β * , β * .
Proof. 
Decompose the error e into two components e I and e h :
e = u u h = u u I + u I u h = e I + e h ,
where e I and e h are defined accordingly. By applying (26), (31) and (33),
β * λ 2 | e h | 2 , h 2 A h ( e h , e h ) = A h ( u I , e h ) A h ( u h , e h ) A h ( u I , e h ) l h , e h = T T h A h T ( u I u π , e h ) + A h T ( u π , e h ) l h , e h = T T h A h T ( u I u π , e h ) + A T ( u π , e h ) l h , e h = T T h A h T ( u I u π , e h ) + A T ( u π u , e h ) + T T h A T ( u , e h ) ( l , e h ) + ( l , e h ) l h , e h = R 1 + R 2 + R 3 ,
where
R 1 = T T h ( A h T ( u I u π , e h ) + A T ( u π u , e h ) ) ,
R 2 = ( l , e h ) l h , e h ,
R 3 = T T h A T ( u , e h ) ( l , e h ) .
Applying the continuity of the bilinear forms A h T and A T , we have
R 1 λ 1 ( β * | u I u π | 2 , h | e h | 2 , h + | u π u | 2 , h | e h | 2 , h ) .
Using (32), we find
R 2 l l h ( V h ) | e h | 2 , h .
Thus, we obtain
| e h | 2 , h 2 C | u I u π | 2 , h + | u π u | 2 , h + l l h ( V h ) | e h | 2 , h + R 3 .
Additionally, we have
| u u I | 2 , h + | u u π | 2 , h + l l h ( V ˜ h ) C h .
To estimate R 3 , we partition T h into the following three parts:
T h + = { T T h : T Ω + } , T h 0 = { T T h : T Ω 0 } , T h b = T h ( T h + T h 0 ) ,
where T h 0 denotes the set of elements in the contact domain and T h + signifies the set of all elements in the non-contact domain.
By (6), we have
R 3 = T T h T ϵ : 2 e h d x ( l , e h ) = T T h T e h n T · ( · ϵ ) d s T T h T e h · ( · ϵ ) d x T T h T ( ϵ n T ) · e h d s ( l , e h ) = E 1 + E 2 + E 3 ,
where
E 1 = e D h e e h [ n e · ( · ϵ ) ] d s ,
E 2 = T T h T ( ϵ n T ) · e h d s = e D h e ϵ n e · [ e h ] d s ,
E 3 = Ω μ e h d s .
Here, we denote μ = · ( ϵ ) l .
We now proceed to estimate E 1 . Given u H 3 ( Ω ) , · ϵ L 2 ( Ω ) , and · ( · ϵ ) = l L 2 ( Ω ) , we can infer that · ϵ H ( div ) ; consequently, [ n e · ( · ϵ ) ] = 0 on D h i . Additionally, since e h = 0 on Γ , we have E 1 =0.
Next, we analyze E 2 . Given u H 3 ( Ω ) , we have ϵ [ H 1 ( Ω ) ] 2 × 2 , leading to [ ϵ n e ] = 0 for all e D h i . Since e h | e P 2 ( e ) , t e h is continuous. Thus,
E 2 = T T h T ( ϵ n T ) · e h d s = e D h e ϵ n e · [ e h ] d s = e D h e ϵ n [ n e h ] d s .
Following the argument in [28] and considering e h V h H 2 , nc ( T h ) , we find
e [ n e h ] d s = 0 e D h ,
which yields
e ϵ n [ n e h ] d s = e ( ϵ n P 0 T ϵ n ) [ n e h P 0 e ( n e h ) ] d s ϵ n P 0 T ϵ n 0 , e [ n e h P 0 e ( n e h ) ] 0 , e .
Here, P m T represents the L 2 -projection onto the space of m-order polynomials on the element T. Utilizing the standard approximation estimates [46], for each edge e D h , we obtain
ϵ n P 0 T ϵ n 0 , e C h T 1 2 | u | 3 , ω e , [ n e h P 0 e ( n e h ) ] 0 , e C h T 1 2 | e h | 2 , ω e .
This implies
e D h i e ( ϵ n ) [ n e h ] d s C h | u | 3 | e h | 2 , h .
Let us analyze E 3 step by step. We start with its definition:
E 3 = T T h T μ ( u I u h ) d x = A 1 + A 2 + A 3 ,
where
A 1 = T T h + T μ ( u I u h ) d x ,
A 2 = T T h 0 T μ ( u I u h ) d x ,
A 3 = T T h b T μ ( u I u h ) d x .
We can show that A 1 = 0 by Lemma 1. In order to estimate A 2 , we define
P 0 T v : = 1 | T | T v d x , R 0 T v : = v P 0 T v .
Since μ 0 , we have P 0 T μ 0 . Given the definition of S h , we know that D i ( u h ) D i ( ξ ) , i = 1 , 2 , 4 . Additionally, D i ( ξ h ) = D i ( ξ ) , and 1 | T | T v d x represents the fourth type of degrees of freedom. Thus, T ( ξ I u h ) d x 0 . This leads to
T μ ( ξ I u h ) d x T R 0 T μ R 0 T ( ξ I u h ) d x R 0 T μ 0 , T R 0 T ( ξ I u h ) 0 , T .
Note that in T T h 0 , where u = ξ , and given ξ H 3 ( Ω ) , we have
T μ ( ξ I u h ) d x R 0 T μ 0 , T R 0 T ( ξ I u h ) 0 , T C h T μ 0 , T | ξ I u h | 1 , T C h T μ 0 , T ( | ξ I ξ | 1 , T + | ξ u h | 1 , T ) C h T μ 0 , T ( h T 2 | ξ | 3 , T + | u u h | 1 , T ) ,
this implies
A 2 = T T h 0 T μ ( u I u h ) d x = T T h 0 T μ ( ξ I u h ) d x C h μ 0 h 2 | ξ | 3 + | u u h | 1 , h C h μ 0 h 2 | ξ | 3 + | u u h | 2 , h .
Now, let us consider the last term
A 3 = T T h b T μ ( u I u + ξ ξ I ) d x + T μ ( u ξ ) d x + T μ ( ξ I u h ) d x = T T h b T μ [ ( u ξ ) I ( u ξ ) ] d x + T μ ( ξ I u h ) d x = A 3 , 1 + A 3 , 2 ,
where
A 3 , 1 = T T h b T μ [ ( u ξ ) I ( u ξ ) ] d x , A 3 , 2 = T T h b T μ ( ξ I u h ) d x .
We can estimate A 3 , 1 as follows:
T μ [ ( u ξ ) I ( u ξ ) ] d x C h T 3 μ 0 , T | u ξ | 3 , T .
Let us now analyze A 3 , 2
T μ ( ξ I u h ) d x T R 0 T μ R 0 T ( ξ I u h ) d x T R 0 T μ R 0 T ( ξ I ξ ) + R 0 T μ R 0 T ( ξ u ) + R 0 T μ R 0 T ( u u h ) d x .
We estimate each of the three terms as follows:
T R 0 T μ R 0 T ( ξ I ξ ) d x C h T μ 0 , T | ξ I ξ | 1 , T C h T 3 μ 0 , T | ξ | 3 , T ,
T R 0 T μ R 0 T ( u u h ) d x μ 0 , T R 0 T ( u u h ) 0 , T C h T μ 0 , T | u u h | 1 , T ,
T R 0 T μ R 0 T ( ξ u ) d x R 0 T μ 0 , T R 0 T ( ξ u ) 0 , T C h T μ 0 , T | ξ u | 1 , T .
By the embedding theorem,
( ξ u ) H 2 C 0 ,
and there exists D T , which means that ( D ) > 0 such that
ξ = u D , ξ = u D .
According to the Bramble–Hilbert lemma, we have | ξ u | 1 , T C h T 2 | ξ u | 3 , T , so
T R 0 T μ R 0 T ( ξ u ) d x C h T 3 μ 0 , T | ξ u | 3 , T .
Combining (47)–(55), we find
E 3 C h 3 μ 0 | u | 3 + | ξ | 3 + h μ 0 | u u h | 2 , h ,
which implies
R 3 C h | u | 3 | e h | 2 , h + h 3 μ 0 | u | 3 + | ξ | 3 + h μ 0 | u u h | 2 , h ,
and thus (40) can be expressed as
| e h | 2 , h 2 C | u I u π | 2 , h + | u π u | 2 , h + l l h ( V h ) + h | u | 3 | e h | 2 , h + C h 3 μ 0 | u | 3 + | ξ | 3 + C h μ 0 | u u h | 2 , h .
Finally, applying the triangle inequality allows us to derive (35). □

5. Numerical Example

In this section, we conduct a numerical experiment to verify the accuracy and convergence properties of the C 0 nonconforming VEM that we proposed above. For details on how to implement the VEM, please refer to [47].
Example 1.
We consider the following setup for the Kirchhoff plate obstacle problem (1): Ω = ( 0.5 , 0.5 ) × ( 0.5 , 0.5 ) , ν = 0.3 , l = 0 , ξ ( x ) = 1 | x | 2 . The exact solution for this problem is given by
u ( x ) = C 1 | x | 2 ( ln | x | ) + C 2 | x | 2 + C 3 ( ln | x | ) + C 4 , r 0 < | x | < 2 1 | x | 2 , | x | r 0 ,
where r 0 0.18134452 , C 1 0.52504063 , C 2 0.62860904 , C 3 0.01726640 , and C 4 1.04674630 .
We determine the convergence orders by discretizing the problem using square meshes with h = 2 / 2 n ( n = 3 , , 7 ) and polygon meshes. The results in Table 1 and Table 2 indicate that the C 0 nonconforming method exhibits linear convergence, consistent with the findings of Theorem 1. Here, the H 2 relative error is computed as
A h ( u I u h , u I u h ) A h ( u I , u I ) 1 / 2 .
Additionally, we also provide graphs corresponding to Table 1 and Table 2, as shown in Figure 3. The results further validate the linear convergence of the C 0 nonconforming VEM for k = 2 , aligning with the theoretical analysis in Theorem 1. In Figure 4, we present a surface diagram depicting the numerical solution obtained from a general polygonal mesh. The numerical solution obtained from the polygonal mesh closely aligns with the real solution on a uniformly divided rectangular mesh at the same location, indicating the effective use of virtual elements in general polygonal mesh computation.
Importantly, in Figure 5, we also plot the numerical solution u h minus the value of the obstacle function ξ at each point. In these figures, we can observe that the value of the numerical solution u h is greater than the value of ξ , which is consistent with the constraints of our VI problem (1).

6. Conclusions

In this paper, we investigate a novel C 0 nonconforming VEM for solving the Kirchhoff plate obstacle problem, which is formulated as a fourth-order variational inequality of the first kind. Our approach introduces new internal degrees of freedom to address the limitations of the traditional lowest-order C 0 nonconforming VEM, leading to improved error analysis and enhanced intuitiveness. Importantly, our method naturally satisfies the constraints of the obstacle problem and achieves optimal convergence in error estimates. Future work will focus on extending the method to handle different boundary conditions and exploring more efficient VEMs.

Author Contributions

Writing—original draft, B.W. and J.Q.; Writing—review and editing, B.W. and J.Q. All authors have read and agreed to the published version of the manuscript.

Funding

The work of Bangmin Wu was partially supported by the Talent Project of the Tianchi Doctoral Program in Xinjiang Uygur Autonomous Region (Grant No. 5105240152n) and the Natural Science Foundation of Xinjiang Uygur Autonomous Region (Grant No. 2023D14014).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Niiranen, J.; Khakalo, S.; Balobanov, V.; Niemi, A. Variational formulation and isogeometric analysis for fourth-order boundary value problems of gradient-elastic bar and plane strain/stress problems. Comput. Methods Appl. Mech. Eng. 2016, 308, 182–211. [Google Scholar] [CrossRef]
  2. Niiranen, J.; Niemi, A. Variational formulations and general boundary conditions for sixth-order boundary value problems of gradientelastic Kirchhoff plates. Eur. J. Mech. A-Solid. 2017, 61, 164–179. [Google Scholar] [CrossRef]
  3. Reissner, E. The effect of transverse shear deformation on the bending of elastic plates. J. Appl. Mech. 1945, 12, 69–77. [Google Scholar] [CrossRef]
  4. Timoshenko, S.; Woinowsky-krieger, S. Theory of Plates and Shells; Springer: Berlin/Heidelberg, Germany; McGraw-Hill: New York, NY, USA, 1959. [Google Scholar]
  5. Swider, J.; Kudra, G. Application of Kirchhoff’s plate theory for design and analysis of stiffened plates. J. Theor. 2017, 55, 805–817. [Google Scholar]
  6. Shahba, A.; Yas, H. Application of Galerkin method in solving static and dynamic problems of Kirchhoff plates. J. Solid Mech. 2015, 7, 374–384. [Google Scholar]
  7. He, H.; Peng, J.G.; Li, H.Y. Iterative approximation of fixed point problems and variational inequality problems on Hadamard manifolds. UPB Bull. Ser. A 2022, 84, 25–36. [Google Scholar]
  8. Lions, J.L.; Stampacchia, G. Variational inequalities. Commun. Pure Appl. Math. 1967, 20, 493–519. [Google Scholar] [CrossRef]
  9. Ferris, M.C.; Pang, J.S. Engineering and economic applications of complementarity problems. SIAM Rev. 1997, 39, 669–713. [Google Scholar] [CrossRef]
  10. Meng, S.; Meng, F.; Zhang, F.; Li, Q.; Zhang, Y. Observer design method for nonlinear generalized systems with nonlinear algebraic constraints with applications. Automatica 2024, 162, 111512. [Google Scholar] [CrossRef]
  11. Shi, M.; Hu, W.; Li, M.; Zhang, J.; Song, X.; Sun, W. Ensemble regression based on polynomial regression-based decision tree and its application in the in-situ data of tunnel boring machine. Mech. Syst. Signal. Pract. 2023, 188, 110022. [Google Scholar] [CrossRef]
  12. Shi, M.; Lv, L.; Xu, L. A multi-fidelity surrogate model based on extreme support vector regression: Fusing different fidelity data for engineering design. Eng. Comput. 2023, 40, 473–493. [Google Scholar] [CrossRef]
  13. Li, B.; Guan, T.; Dai, L.; Duan, G. Distributionally robust model predictive control with output feedback. IEEE Trans. Autom. Control 2023, 69, 3270–3277. [Google Scholar] [CrossRef]
  14. Zhou, X.; Liu, X.; Zhang, G.; Jia, L.; Wang, X.; Zhao, Z. An iterative threshold algorithm of log-sum regularization for sparse problem. IEEE. Trans. Circuits. Syst. Video Technol. 2023, 33, 4728–4740. [Google Scholar] [CrossRef]
  15. Zhang, H.; Xiang, X.; Huang, B.; Wu, Z.; Chen, H. Static homotopy response analysis of structure with random variables of arbitrary distributions by minimizing stochastic residual error. Comput. Struct. 2023, 288, 107153. [Google Scholar] [CrossRef]
  16. da Veiga, L.B.; Brezzi, F.; Cangiani, A.; Manzini, G.; Marini, L.D.; Russo, A. Basic principles of virtual element methods. Math. Models Methods Appl. Sci. 2013, 23, 199–214. [Google Scholar] [CrossRef]
  17. Li, J.; Liu, Y.; Lin, G. Implementation of a coupled FEM-SBFEM for soil-structure interaction analysis of large-scale 3D base-isolated nuclear structures. Comput. Geotech. 2023, 162, 105669. [Google Scholar] [CrossRef]
  18. Babu, B.; Patel, B.P. A new computationally efficient finite element formulation for nanoplates using second-order strain gradient Kirchhoff’s plate theory. Compos. Part. B-Eng. 2019, 168, 302–311. [Google Scholar] [CrossRef]
  19. Zhang, B.; Li, H.; Kong, L.; Zhang, X.; Feng, Z. Variational formulation and differential quadrature finite element for freely vibrating strain gradient Kirchhoff plates. Z. Angew. Math. Mech. 2021, 101, e202000046. [Google Scholar] [CrossRef]
  20. da Veiga, L.B.a.; Brezzi, F.; Marini, L.D. Virtual elements for linear elasticity problems. SIAM J. Numer. Anal. 2013, 51, 794–812. [Google Scholar] [CrossRef]
  21. Gain, A.L.; Talischi, C.; Paulino, G.H. On the virtual element method for three-dimensional elasticity problems on arbitrary polyhedral meshes. Comput. Methods Appl. Mech. Engrg. 2014, 282, 132–160. [Google Scholar] [CrossRef]
  22. Zhang, B.; Zhao, J.; Yang, Y.; Chen, S. The nonconforming virtual element method for elasticity problems. J. Comput. Phys. 2019, 378, 394–410. [Google Scholar] [CrossRef]
  23. Antonietti, P.F.; da Veiga, L.B.a.; Mora, D.; Verani, M. A stream function formulation of the Stokes problem for the virtual element method. SIAM J. Numer. Anal. 2014, 52, 386–404. [Google Scholar] [CrossRef]
  24. da Veiga, L.B.a.; Lovadina, C.; Vacca, G. Divergence free virtual elements for the Stokes problem on polygonal meshes. ESAIM Math. Model. Numer. Anal. 2017, 51, 509–535. [Google Scholar] [CrossRef]
  25. Zhao, J.; Zhang, B.; Mao, S.; Chen, S. The divergence-free nonconforming virtual element for the Stokes problem. SIAM J. Numer Anal. 2019, 57, 2730–2759. [Google Scholar] [CrossRef]
  26. Antonietti, P.F.; da Veiga, L.B.a.; Scacchi, S.; Verani, M. A C1 virtual element method for the Cahn-Hilliard equation with polygonal meshes. SIAM J. Numer. Anal. 2016, 54, 34–56. [Google Scholar] [CrossRef]
  27. Brezzi, F.; Marini, L.D. Virtual element methods for plate bending problems. Comput. Methods Appl. Mech. Engrg. 2013, 253, 455–462. [Google Scholar] [CrossRef]
  28. Zhao, J.; Chen, S.; Zhang, B. The nonconforming virtual element method for plate bending problems. Math. Models Methods Appl. Sci. 2016, 26, 1671–1687. [Google Scholar] [CrossRef]
  29. Antonietti, P.F.; Manzini, G.; Verani, M. The fully nonconforming virtual element method for biharmonic problems. Math. Models Methods Appl. Sci. 2018, 28, 199–214. [Google Scholar] [CrossRef]
  30. Zhao, J.; Zhang, B.; Chen, S.; Mao, S. The Morley-type virtual element for plate bending problems. J. Sci. Comput. 2018, 76, 610–629. [Google Scholar] [CrossRef]
  31. Feng, F.; Han, W.; Huang, J. Virtual element methods for elliptic variational inequalities of the second kind. J. Sci. Comput. 2019, 80, 60–80. [Google Scholar] [CrossRef]
  32. Feng, F.; Han, W.; Huang, J. Virtual element method for an elliptic hemivariational inequality with applications to contact mechanics. J. Sci. Comput. 2019, 81, 2388–2412. [Google Scholar] [CrossRef]
  33. Wang, F.; Wei, H. Virtual element method for simplified friction problem. Appl. Math. Lett. 2018, 85, 125–131. [Google Scholar] [CrossRef]
  34. Wang, F.; Wei, H.Y. Virtual element methods for the obstacle problem. IMA J. Numer. Anal. 2020, 40, 708–728. [Google Scholar] [CrossRef]
  35. Wang, F.; Wu, B.; Han, W. The virtual element method for general elliptic hemivariational inequalities. J. Comput. Appl. Math. 2021, 389, 113330. [Google Scholar] [CrossRef]
  36. Wriggers, P.; Rust, W.T.; Reddy, B.D. A virtual element method for contact. Comput. Mech. 2016, 58, 1039–1050. [Google Scholar] [CrossRef]
  37. Wu, B.; Wang, F.; Han, W. Virtual element method for a frictional contact problem with normal compliance. Commun. Nonlinear Sci. Numer. Simul. 2022, 107, 106125. [Google Scholar] [CrossRef]
  38. Wang, F.; Zhao, J. Conforming and nonconforming virtual element methods for a Kirchhoff plate contact problem. IMA J. Numer. Anal. 2021, 41, 1496–1521. [Google Scholar] [CrossRef]
  39. Qiu, J.; Zhao, J.; Wang, F. Nonconforming virtual element methods for the fourth-order variational inequalities of the first kind. J. Comput. Appl. Math. 2023, 425, 115025. [Google Scholar] [CrossRef]
  40. Duvaut, G.; Lions, J.L. Inequalities in Mechanics and Physics; Springer: Berlin, Germany, 1976. [Google Scholar]
  41. Wang, F.; Han, W.; Huang, J.; Zhang, T. Discontinuous Galerkin methods for an elliptic variational inequality of fourth-order. In Advances in Variational and Hemivariational Inequalities with Applications; Springer International: Cham, Switzerland, 2015; pp. 199–222. [Google Scholar]
  42. Atkinson, K.; Han, W. Theoretical Numerical Analysis: A Functional Analysis Framework; Springer: New York, NY, USA, 2009. [Google Scholar]
  43. Glowinski, R. Numerical Methods for Nonlinear Variational Problems; Springer: New York, NY, USA, 1984. [Google Scholar]
  44. Glowinski, R.; Lions, J.L.; Trèmolixexres, R. Numerical Analysis of Variational Inequalities; North-Holland: New York, NY, USA, 1981. [Google Scholar]
  45. da Veiga, L.B.a.; Lovadina, C. Stability analysis for the virtual element method. Math. Models Methods Appl. Sci. 2017, 27, 2557–2594. [Google Scholar] [CrossRef]
  46. Brenner, S.C.; Scott, L.R. Mathematical Theory of Finite Element Methods; Springer: New York, NY, USA, 1994. [Google Scholar]
  47. da Veiga, L.B.a.; Brezzi, F.; Marini, L.D.; Russo, A. The hitchhiker’s guide to the virtual element method. Math. Models Methods Appl. Sci. 2014, 24, 1541–1573. [Google Scholar] [CrossRef]
Figure 1. The obstacle problem P.
Figure 1. The obstacle problem P.
Axioms 13 00322 g001
Figure 2. The DOFs of the lowest-order C 0 nonconforming VE on V h T .
Figure 2. The DOFs of the lowest-order C 0 nonconforming VE on V h T .
Axioms 13 00322 g002
Figure 3. Relative errors of rectangular mesh and polygon mesh.
Figure 3. Relative errors of rectangular mesh and polygon mesh.
Axioms 13 00322 g003
Figure 4. The numerical solution and exact solution.
Figure 4. The numerical solution and exact solution.
Axioms 13 00322 g004
Figure 5. The numerical solution minus the value of the obstacle function ξ .
Figure 5. The numerical solution minus the value of the obstacle function ξ .
Axioms 13 00322 g005
Table 1. Convergence orders of H 2 relative errors on square meshes.
Table 1. Convergence orders of H 2 relative errors on square meshes.
h 2 / 2 3 2 / 2 4 2 / 2 5 2 / 2 6 2 / 2 7
H 2 relative error 2.587 × 10 1 1.787 × 10 1 1.019 × 10 1 5.343 × 10 2 2.720 × 10 2
Convergence order- 0.534 0.810 0.931 0.974
Table 2. Convergence orders of H 2 relative errors on polygonal meshes.
Table 2. Convergence orders of H 2 relative errors on polygonal meshes.
h 1.636 × 10 1 9.306 × 10 2 4.146 × 10 2 2.223 × 10 2 1.011 × 10 2
H 2 relative error 2.872 × 10 1 1.973 × 10 1 1.124 × 10 1 5.920 × 10 2 3.004 × 10 2
Convergence order- 0.665 0.706 1.029 0.861
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Wu, B.; Qiu, J. A C0 Nonconforming Virtual Element Method for the Kirchhoff Plate Obstacle Problem. Axioms 2024, 13, 322. https://doi.org/10.3390/axioms13050322

AMA Style

Wu B, Qiu J. A C0 Nonconforming Virtual Element Method for the Kirchhoff Plate Obstacle Problem. Axioms. 2024; 13(5):322. https://doi.org/10.3390/axioms13050322

Chicago/Turabian Style

Wu, Bangmin, and Jiali Qiu. 2024. "A C0 Nonconforming Virtual Element Method for the Kirchhoff Plate Obstacle Problem" Axioms 13, no. 5: 322. https://doi.org/10.3390/axioms13050322

APA Style

Wu, B., & Qiu, J. (2024). A C0 Nonconforming Virtual Element Method for the Kirchhoff Plate Obstacle Problem. Axioms, 13(5), 322. https://doi.org/10.3390/axioms13050322

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop