Abstract
This paper is dedicated to the numerical solution of a fourth-order singular perturbation problem using the interior penalty virtual element method (IPVEM). Compared with the original IPVEM proposed in Zhao et al. (Math Comp 92(342):1543–1574, 2023), the study introduces modifications to the jumps and averages in the penalty term, as well as presents a mesh-dependent selection of the penalty parameter. Drawing inspiration from the modified Morley finite element methods, we leverage the conforming interpolation technique to handle the lower part of the bilinear form in the error analysis. We establish the optimal convergence in the energy norm and provide a rigorous proof of uniform convergence concerning the perturbation parameter in the lowest-order case.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let \(\Omega \) be a bounded polygonal domain of \({\mathbb {R}}^2\) with boundary \(\partial \Omega \). For \(f\in L^2(\Omega )\), we consider the following boundary value problem of the fourth-order singular perturbation equation:
where \({\varvec{n}} = (n_1,n_2)\) is the unit outer normal to \(\partial \Omega \), \(\Delta \) is the standard Laplacian operator and \(\varepsilon \) is a real parameter satisfying \(0< \varepsilon \le 1\). This equation can be considered as a linear model for a clamped thin elastic plate under tension that is subjected to a transverse loading (represented by the function f), with \(\varepsilon \) quantifying the ratio of bending rigidity to tensile stiffness in the plate. As \(\varepsilon \) approaches zero, this plate model degenerates into an elastic membrane problem. Such problems also arise when studying the linearization of the vanishing moment method for the fully nonlinear Monge-Ampère equation [13, 35, 44].
When \(\varepsilon \) is not small, the problem can be numerically resolved as the biharmonic equation by using some standard finite element methods for fourth-order problems. However, in this article, we are primarily concerned with the case where \(\varepsilon \rightarrow 0\), or the differential equation formally degenerates to the Poisson equation (see (4.14)), but with the “extra” normal boundary condition in (1.1), which will produce boundary layers in the first derivatives of u [35]. Due to the presence of the fourth-order term, \(H^2\)-conforming finite elements with \(C^1\) continuity were considered in [35], but these methods are quite complicated even in two dimensions. To overcome this difficulty, it is preferred to use nonconforming finite elements. Since the differential equation reduces to the Poisson equation in the singular limit, \(C^0\)-conforming finite elements are better suited for the task, as shown in [33]. In that work, the method was proved to converge uniformly in the perturbation parameter in the energy norm, and a counterexample was given to show that the Morley method diverges for the reduced second-order equation (see also the patch test in [40]). Considering that the Morley element has the least number of element degrees of freedom (DoFs), Wang et al. proposed in [41] a modified Morley element method. This method still uses the DoFs of the Morley element, but linear approximation of finite element functions is used in the lower part of the bilinear form:
where
and \(\Pi _h^1\) is the interpolation operator corresponding to linear conforming element for second-order partial differential equations. It was also shown that the modified method converges uniformly in the perturbation parameter. On the other hand, among the robust methods with respect to the singular parameter \(\varepsilon \), the \(C^0\) interior penalty methods [13, 15] may be most attractive as they utilize the standard \(C^0\) finite element spaces. These spaces are primarily designed for solving second-order problems and effectively reduce the computational cost to a certain extent.
This paper focuses on virtual element methods (VEMs), which are a generalization of the standard finite element method that allows for general polytopal meshes. First proposed and analyzed in [7], with other pioneering works found in [2, 8], VEMs have several advantages over standard finite element methods. For example, they are more convenient for handling partial differential equations on complex geometric domains or those associated with high-regularity admissible spaces. To date, a considerable number of conforming and nonconforming VEMs have been developed to address second-order elliptic equations [2, 7, 20, 26] as well as fourth-order elliptic equations [6, 17, 22, 24, 48]. The versatility and effectiveness of the VEM have made it a popular choice for tackling a wide range of scientific and engineering problems, including the Stokes problem [5, 19, 32], the Navier–Stokes equation [10, 11, 29], the magnetohydrodynamic system [3, 9], the sine-Gordon equation [1], the topology optimization problems [5, 23, 46], the fourth-order singular perturbation problems [45] and the variational and hemivariational inequalities [27, 28, 31, 34, 37,38,39, 43]. For a comprehensive understanding of recent advancements in the VEM, we recommend referring to the book [4] and the associated references.
Recently, the interior penalty technique for VEMs has been explored in [47] for the biharmonic equation, which is equipped with the same DoFs for the \(H^1\)-conforming virtual elements [7], and the numerical scheme can be regarded as a combination of the virtual element space and discontinuous Galerkin scheme, since the resulting global discrete space is not \(C^0\)-continuous and an interior penalty formulation is adopted to enforce the continuity of the solution. The interior penalty method is then applied to address the fourth-order singular perturbation problem in [44], with some adaptations to the original space. These modifications encompass alterations in the definition of the \(H^1\)-type projection and the selection of the DoFs. Compared to the \(C^0\)-continuous nonconforming virtual element method in [45], the IPVEM boasts a reduced number of the DoFs, rendering it more appropriate for tackling fourth-order singular perturbation problems.
In contrast to the methodology in [44], we adopt the original formulation introduced in [47] to address the fourth-order singular perturbation problem (1.1). However, since the original IPVEM space lacks \(C^0\) continuity, it brings some troubles on the error analysis for the consistency error for the lower part of the bilinear form as for the method in [44]. Specifically, when u denotes the exact solution to (1.1) and \(v_h\) represents a function in the original IPVEM space \(V_h\), we encounter the consistency term
with \({\mathcal {E}}_h\) denoting the set of edges in the subdivision and \([v_h]\) the jump across e. In the error analysis, it is expected that this consistency term either vanishes or exhibits an error on the order of \({\mathcal {O}}(h^{\alpha })\) for some \(\alpha \ge 1\). The comparison of the treatments for this consistency term is summarized as follows.
-
For the method in [44], the authors developed a new space with new DoFs by using a revised projection to impose some restrictions on the local space of \(H^2\)-conforming virtual element. This adjustment ensures the continuity of the moments of functions on edges in the lowest-order case, i.e., \(\int _e [v_h] \textrm{d}s = 0\) or \(\Pi _{0,e}^0 [v_h] =0\) (in the lowest order case), where \(\Pi _{0,e}^0\) represents the \(L^2\) projector onto \({\mathbb {P}}_0(e)\), leading to (see Eq. (4.27) in [44]):
$$\begin{aligned} \sum \limits _{e \in {\mathcal {E}}_h} \int _e \frac{\partial u}{\partial {\varvec{n}}_e}[v_h] \textrm{d}s&= \sum \limits _{e \in {\mathcal {E}}_h} \int _e \frac{\partial u}{\partial {\varvec{n}}_e}( [v_h] - \Pi _{0,e}^0 [v_h]) \textrm{d}s \\&\le \sum \limits _{e \in {\mathcal {E}}_h} \Big \Vert \frac{\partial u}{\partial {\varvec{n}}_e} \Big \Vert _{0,e} \Vert [v_h] - \Pi _{0,e}^0 [v_h] \Vert _{0,e} \lesssim h |u|_2 |v_h|_{1,h}. \end{aligned}$$This nonconformity error is not optimal (see the remark below Theorem 4.5 of [44]), which was observed in the numerical test with a higher convergence rate as \(\varepsilon \) becomes small.
-
Inspired by the technique in (1.2) for discontinuous elements, we address this issue by introducing a linear conforming interpolation operator in the lower part of the bilinear form. Consequently, the consistency term can be expressed as
$$\begin{aligned}\sum \limits _{e \in {\mathcal {E}}_h} \int _e \frac{\partial u}{\partial {\varvec{n}}_e}[I_h^c v_h] \textrm{d}s, \qquad v_h \in V_h,\end{aligned}$$where \(I_h^c\) is the conforming interpolation operator for \(V_h\). Since \(I_h^c v_h\) is continuous across the edges, the above term naturally vanishes, a departure from the concept of enforcing weak continuity of \(v_h\) along edges as discussed in [44]. In this case, we get the optimal estimate for the nonconformity error as shown in Theorem 4.1. It is worth noting that in the context of VEMs, the linear conforming interpolation operator can be omitted as it yields the same first-order elliptic projection (see Remark 3.2). For this reason, there is no need to modify the lower part, and the modification is solely utilized in the error analysis. From this point of view, the original interior penalty virtual elements exhibit similar behaviors to \(C^0\)-continuous elements despite its discontinuity.
The remainder of the paper is structured as follows. We begin by introducing the continuous variational problem and presenting some useful results in VEM analysis in Sect. 2. Section 3 is dedicated to the introduction of the IPVEM. In contrast to the jump and average terms in [47], we include the elliptic projector \(\Pi _h^\nabla \) for all v and w in the penalty terms \(J_i(v,w)\) for \(i=1,2,3\) to simplify the implementation. This modification can be interpreted by the numerical integration (see Remark 3.1). Consequently, the resulting approach is denoted as a modified IPVEM (mIPVEM). Additionally, we provide a heuristic mesh-dependent selection of the penalty parameter \(\lambda _e\), following a similar deduction as described in [18]. In Sect. 4, we establish the optimal convergence of the mIPVEM in the energy norm and provide a uniform error estimate in the lowest-order case. Our analysis demonstrates that the mIPVEM is robust with respect to the perturbation parameter. This is based on the observation that we can equivalently include the \(H^1\)-conforming interpolation in the lower part of the bilinear form, as in (1.2), since all required degrees of freedom are accessible. Numerical examples for second- and third-order virtual elements are presented in Sect. 5 to validate the theoretical predictions.
2 The Continuous Variational Problem
We first introduce some notations and symbols frequently used in this paper. For a bounded Lipschitz domain D of dimension \(d ~(d=1,2)\), the symbol \(( v, w)_D = \int _D v w \textrm{d}x\) denotes the \(L^2\)-inner product on D, \(\Vert \cdot \Vert _{0,D}\) or \(\Vert \cdot \Vert _{D}\) denotes the \(L^2\)-norm, and \(|\cdot |_{s,D}\) is the \(H^s(D)\)-seminorm. If \(D=\Omega \), for simplicity, we abbreviate \(\Vert \cdot \Vert _{\Omega }\) as \(\Vert \cdot \Vert \) . For vectorial functions \({\varvec{v}} = (v_1,v_2)^T\) and \({\varvec{w}} = (w_1,w_2)^T\), the inner product is defined as \(( {\varvec{v}}, {\varvec{w}})_D = \int _D (v_1w_1 + v_2 w_2) \textrm{d}x\). For all integer \(k\ge 0\), \({\mathbb {P}}_k(D)\) is the set of polynomials of degree \(\le k\) on D. The set of scaled monomials \({\mathbb {M}}_r(D)\) is given by
with the element denoted by \(m_{D}\), where \(h_D\) is the diameter of D, \({\varvec{x}}_D\) is the centroid of D, and r is a non-negative integer. For the multi-index \({\varvec{s}} \in {{\mathbb {N}}^d}\), we follow the usual notation
Conventionally, \({\mathbb {M}}_r (D) =\{0\}\) for \(r\le -1\).
Let \({\mathcal {T}}_h:=\{K\}_{K\in {\mathcal {T}}_h}\) be a mesh of \(\Omega \) into polygons. For a generic element K, define \(h=\max _{K\in {\mathcal {T}}_h}h_K\) and \(h_K=\textrm{diam}(K)\). Let \(e \subset \partial K\) be the common edge for elements \(K = K_-\) and \(K_+\), and let v be a scalar function defined on e. We introduce the jump and average of v on e by \([v] = v^- - v^+\) and \(\{v\} = \frac{1}{2} (v^- + v^+)\), where \(v^-\) and \(v^+\) are the traces of v on e from the interior and exterior of K, respectively. On a boundary edge, \([ v ] = v\) and \(\{ v \} = v \). Moreover, for any two quantities a and b, “\(a\lesssim b\)" indicates “\(a\le C b\)" with the constant C independent of the mesh size \(h_K\), and “\(a\eqsim b\)" abbreviates “\(a\lesssim b\lesssim a\)".
The variational formulation of (1.1) reads: Find \(u\in V:=H_0^2(\Omega )\) such that
where \(a(u,v) = (\nabla ^2u,\nabla ^2v)\) and \( b(u,v)=(\nabla u,\nabla v) \).
According to [33, Lemma 5.1], if \(f\in L^2(\Omega )\) and \(\Omega \) is a convex polygonal domain, then the weak solution \(u \in H_0^2(\Omega ) \cap H^3(\Omega )\), i.e., there exists a constant \(c=c(\varepsilon )\) independent of f such that \(\Vert u\Vert _3 \le c\Vert f\Vert _{-1}\), where c depends on \(\varepsilon \) and may blow up as \(\varepsilon \) tends to zero (see Lemma 4.5). However, for general polygonal domains, the solution u only belongs to \(H^{2+\alpha }(\Omega )\) whenever \(f \in H^{-2 + \alpha }(\Omega )\) for some \(\alpha \in (1/2,1]\) [15]. In this article, we always assume that \(\Omega \) is a bounded convex polygon. In this case, if f has higher regularity, viz., \(f\in H^{s-4}(\Omega )\) with \(s \ge 3\), we may assume that \(u\in H_0^2(\Omega )\cap H^s(\Omega )\).
In the context of geometric subdivisions, we consider a family of polygonal meshes \(\{ {\mathcal {T}}_h \}_{h>0}\) satisfying the following condition (cf. [16, 21]):
- H.:
-
For each \(K\in {{\mathcal {T}}}_h\), there exists a “virtual triangulation" \({{\mathcal {T}}}_K\) of K such that \({{\mathcal {T}}}_K\) is uniformly shape regular and quasi-uniform. The corresponding mesh size of \({{\mathcal {T}}}_K\) is proportional to \(h_K\). Each edge of K is a side of a certain triangle in \({{\mathcal {T}}}_K\).
As shown in [21], this condition covers the usual geometric assumptions frequently used in the context of VEMs. Under this geometric assumption, we can establish some fundamental results in VEM analysis as used in [30].
According to the standard Dupont-Scott theory (cf. [14]), for all \(v\in H^l(K)\) (\(0\le l \le k\)) there exists a certain \(q \in {\mathbb {P}}_{l-1}(K)\) such that
The following trace and Poincaré-Friedrichs inequalities are very useful for our forthcoming analysis [12, 14].
Lemma 2.1
For any \(K\in {\mathcal {T}}_h\), there hold
3 The Interior Penalty Virtual Element Method
3.1 The \(H^1\)-Projection in the Lifting Space
An interior penalty virtual element method (IPVEM) was proposed in [47]. In the construction, the authors first introduced a \(C^1\)-continuous virtual element space
which can be viewed as the lifting version of the standard kth order \(C^1\)-continuous virtual element space for fourth-order singular perturbation problems. This local space can be equipped with the following DoFs (cf. [17, 24]):
-
\(\tilde{{\varvec{\chi }}}^p:\) the values of v at the vertices of K,
$$\begin{aligned} {\tilde{\chi }}_z^p(v) = v(z), \quad z \hbox {is a vertex of} K. \end{aligned}$$(3.1) -
\(\tilde{ {\varvec{\chi }}}^g\): the values of \(h_z\nabla v\) at the vertices of K,
$$\begin{aligned} {\tilde{\chi }}_z^g(v) = h_z\nabla v(z), \quad z \hbox {is a vertex of} K, \end{aligned}$$(3.2)where \(h_z\) is a characteristic length attached to each vertex z, for instance, the average of the diameters of the elements having z as a vertex.
-
\(\tilde{{\varvec{\chi }}}^e\): the moments of v on edges up to degree \(k-2\),
$$\begin{aligned} {\tilde{\chi }}_e(v) = |e|^{-1}(m_e, v)_e, \quad m_e \in {\mathbb {M}}_{k-2}(e), \quad e \subset \partial K. \end{aligned}$$(3.3) -
\(\tilde{{\varvec{\chi }}}^n\): the moments of \(\partial _{{\varvec{n}}_e} v\) on edges up to degree \(k-1\),
$$\begin{aligned} { {\tilde{\chi }}_e^n(v)} = (m_e,\partial _{{\varvec{n}}_e} v)_e, \quad m_e \in {\mathbb {M}}_{k-1}(e), \quad e \subset \partial K. \end{aligned}$$(3.4) -
\(\tilde{{\varvec{\chi }}}^K\): the moments on element K up to degree k,
$$\begin{aligned} {\tilde{\chi }}_K(v) = |K|^{-1}(m_K,v)_K, \quad m_K \in {\mathbb {M}}_k(K). \end{aligned}$$(3.5)
Given \(v_h \in {\widetilde{V}}_{k+2}(K)\), the usual definition of the \(H^1\)-elliptic projection \(\Pi _K^{\nabla } v_h \in \) \({\mathbb {P}}_k(K)\) is described by the following equations:
where \({\mathcal {V}}_K\) is the set of the vertices of K. This elliptic projection can be computed using the DoFs (3.1)–(3.5) by checking the right-hand side of the integration by parts formula:
However, the goal of the IPVEM is to make \(\Pi _K^\nabla v_h\) computable by only using the DoFs of \(H^1\)-conforming virtual element spaces given by (cf. [2, 7])
where
and the corresponding global virtual element space is
To do so, Ref. [47] considered the approximation of the right-hand side by some numerical formula. In view of the \({\mathbb {P}}_k\) accuracy, namely \(\Pi _K^\nabla v_h = v_h\) for \(v_h\in {\mathbb {P}}_k(K)\), the modified \(H^1\)-projection is defined as
with
where \((\omega _i, {\varvec{x}}_i^e)\) are the \((k+1)\) Gauss-Lobatto quadrature weights and points with \({\varvec{x}}_0^e\) and \({\varvec{x}}_k^e\) being the endpoints of e. The piecewise \(H^1\)-projector \(\Pi _h^{\nabla }\) is defined by setting \(\Pi _h^{\nabla }|_K=\Pi _K^{\nabla }\) for all \(K\in {\mathcal {T}}_h\). In this case, the DoFs {\(\tilde{{\varvec{\chi }}}^p\), \(\tilde{{\varvec{\chi }}}^e\)} on e should be replaced by the \((k+1)\) Gauss-Lobatto points. Notice that when \(v_h\in {\mathbb {P}}_k(K)\), the integrand of \(\int _e v_h \partial _{{\varvec{n}}_e} q \textrm{d} s\) is a polynomial of order \(2k-1\) on e, while the algebraic accuracy is exactly \(2k-1\) for the \((k+1)\) Gauss-Lobatto points. In particular, we have \(2k-1 = 3\) for \(k=2\), corresponding to the Simpson’s rule.
For the computation of the \(L^2\) projector \(\Pi _{0,K}^k\) onto \({\mathbb {P}}_k(K)\), we can decrease the degrees of freedom by employing the standard enhancement technique [2]. In fact, one can find that the moments on element K with degrees \(k-1\) and k are not required for the computation of the modified \(H^1\)-elliptic projection. For this reason, we substitute the redundant moments of v with those of \(\Pi _K^{\nabla }v\). The resulting space is given by
3.2 The IP Virtual Element Spaces
The \(H^1\)-elliptic projection is uniquely determined by the DoFs for the \(H^1\)-conforming virtual element space \(V_h^{1,c}\). As for the \(L^2\) projection, one can use the enhancement technique to replace the additional DoFs of \(v\in W_k(K)\) by the ones of \(\Pi _K^\nabla v\). The local interior penalty space is then defined as
which satisfies \(\Pi _K^{\nabla } v=v\) for \(v \in {\mathbb {P}}_k(K)\), \({\mathbb {P}}_k(K) \subset V_k(K)\), and \(V_k(K) \subset H^2(K)\). The associated DoFs are then given by
-
\( {\varvec{\chi }}^p:\) the values of v(z), \(z \in {\mathcal {V}}_K\);
-
\( {\varvec{\chi }}^e:\) the values of \(v(\varvec{x}_i^e)\), \(i=1,2 \ldots , k-1\), \(e \subset \partial K\);
-
\({\varvec{\chi }}^K\): the moments \(|K|^{-1}( m_K, v)_K\), \(m_K \in {\mathbb {M}}_{k-2}(K)\).
Furthermore, we use \(V_h\) to denote the global space of nonconforming virtual element by
Since \(V_h\) and \(V_h^{1,c}\) share the same DoFs, we can introduce the interpolation from \(V_h\) to \(V_h^{1,c}\). For any given \(v_h\in V_h\), let \(I_h^c v_h\) be the nodal interpolant of \(v_h\) in \(V_h^{1,c}\). One can define the \(H^1\)-elliptic projection \(\Pi _h^\nabla I_h^c v_h\) as in (3.6) and find that
since \(\chi _i(I_h^c v_h) = \chi _i(v_h)\) and \(\Pi _h^\nabla \) is uniquely determined by the DoFs, where \(\chi _i \in {\varvec{\chi }}\) with \({\varvec{\chi }}= \{{\varvec{\chi }}^p,{\varvec{\chi }}^e,{\varvec{\chi }}^K \}\) denoting the union of the DoFs for \(V_h\).
As usual, we can define the \(H^2\)-projection operator \(\Pi _K^{\Delta }: V_k(K) \rightarrow {\mathbb {P}}_k(K)\) by finding the solution \(\Pi _K^{\Delta } v \in {\mathbb {P}}_k(K)\) of
for any given \(v \in V_k(K)\), where the quasi-average \({\widehat{v}}\) is defined by
Following the similar arguments in [47, Lemma 3.4] and [47, Corollary 3.6 and Corollary 3.7], we may derive the inverse inequalities, the boundedness of the \(H^1\) projector and the projection error estimates described in the following Lemma.
Lemma 3.1
For all \(v_h\in V_k(K)\) there hold
where \(m=1,2\) and \(0\le \ell \le m\).
3.3 The IP Virtual Element Method with Modified Jump and Penalty Terms
Given the discrete bilinear form
with
where \(\{\chi _i\}\) are the local DoFs on K with \(n_K\) being the number of the DoFs. Let
where \(\lambda _e\ge 1\) is some edge-dependent parameter, and the additional terms are given by
In contrast to the jump and average terms in [47], here we include the elliptic projector \(\Pi _h^\nabla \) for all v and w in \(J_i\) for \(i=1,2,3\) to simplify the implementation. According to the definition of \(V_k(K)\), one easily finds that \(J_2\) (or \(J_3\)) defined here coincides with the one given in [47], viz.,
Remark 3.1
In Ref. [47], the penalty term is expressed as
where the integration can be approximated by the Gauss-Lobatto formula
with \({\varvec{x}}_0^e\) and \({\varvec{x}}_k^e\) being the endpoints of e. By the definition of \(V_h\),
Our penalty term can be interpreted as replacing every term in the summation with the right-hand side expression for every i.
Our modified interior penalty virtual element methods for the problem (1.1) can be described as follows: Find \(u_h\in V_h\) such that
where
\(a_h(v,w)=\sum _{K\in {\mathcal {T}}_h} a_h^K(v,w)\) and \(b_h(v,w)=\sum _{K\in {\mathcal {T}}_h} b_h^K(v,w)\), with
The right-hand side is
with \(\Pi _{0,K}^k\) being the \(L^2\) projector onto \({\mathbb {P}}_k(K)\).
Remark 3.2
In view of Eq. (3.7), we have
which is crucial in the error analysis. We also have
which implies
This along with (3.9), (3.10) and (3.7) gives
By the inverse inequality for polynomials,
Noting that \(\chi _K(I_h^c v_h) = \chi _K(v_h)\), where \(\chi _K(v_h) = |K|^{-1}\int _K v_h \textrm{d}x\), we obtain from the Poincaré-Friedrichs inequality (2.6) that
In what follows, we define
Lemma 3.2
\(\Vert \cdot \Vert _h\) and \(\Vert \cdot \Vert _{\varepsilon ,h}\) are norms on \(V_h\).
Proof
It is enough to prove that \(\Vert v_h\Vert _h = 0\) implies \(v_h = 0\) for any given \(v_h \in V_h\). By definition, \(\Vert v_h\Vert _h = 0\) is equivalent to
The equation \(|v_h|_{2,h} = 0\) shows that \(\nabla _h v_h\) is a piecewise constant on \({\mathcal {T}}_h\). On the other hand, the direct manipulation yields
where \(v, w \in V_h\). Thus, \(J_1(v_h,v_h) = 0\) implies \(\Pi ^{k-1}_{0,e} \Big [\frac{\partial v_h}{\partial {\varvec{n}}_e}\Big ] = 0\), where \(k \ge 2\). Since \(\nabla _h v_h\) is piecewise constant, we further obtain \(\Big [\frac{\partial v_h}{\partial {\varvec{n}}_e}\Big ] = 0\) over the edges of \({\mathcal {T}}_h\). That is, the normal derivative of \(v_h\) is continuous over interior edges and vanishes on the boundary of \(\Omega \). This reduces to the discussion in the proof of Lemma 4.2 in [47], so we omit the remaining argument. \(\square \)
3.4 Well-Posedness of the Discrete Problem
In [47], the mesh-dependent parameter \(\lambda _e\) was chosen as a sufficiently large constant \(\lambda \). The stability for the bilinear forms can be obtained by using the similar arguments used in the proof of Theorem 4.3 in [47]. We omit the details with the results described as follows.
-
k-consistency: for all \(v \in V_k(K)\) and \(q \in {\mathbb {P}}_k(K)\), it holds that
$$\begin{aligned} a_h^K(v, q)=a^K(v, q), \quad b_h^K(v, q)=b^K(v, q). \end{aligned}$$(3.21) -
Stability: there exist two positive constants \(\alpha _*\) and \(\alpha ^*\), independent of h, such that
$$\begin{aligned}&\alpha _*a^K(v, v) \le a_h^K(v, v) \le \alpha ^* a^K(v, v), \end{aligned}$$(3.22)$$\begin{aligned}&\alpha _* b^K(v,v) \le b_h^K(v,v) \le \alpha ^* b^K(v,v) \end{aligned}$$(3.23)for all \(v \in V_k(K)\).
Note that under the given mesh assumption, \(\alpha _*\) and \(\alpha ^*\) are constants independent of the elements. Therefore, we can select the same \(\alpha _*\) or \(\alpha ^*\) for both equations.
Here, we aim to provide an automated mesh-dependent selection of \(\lambda _e\) following a similar deduction with that described in [18].
Lemma 3.3
For every constant \(a_{\lambda } \) satisfying
where \(\alpha _*\) is given in (3.22), define the penalty parameter as
where \(C_{\nabla ,e} = \max \{C_{\nabla ,K_+}, C_{\nabla ,K_-}\}\) with \(C_{\nabla ,K_\pm }\) being the hidden constants in (3.9), \(T_+\) and \(T_-\) are the neighboring virtual triangles for an interior edge \(e \in {\mathcal {E}}_h^0\), \(T_+\) is the adjacent virtual triangle for a boundary edge \(e \in {\mathcal {E}}_h^{\partial }\), and \(N_K\) is the maximum number of edges of elements. Then there holds
with the constant
Proof
For every \(\kappa >0\), consider the difference
where the stability (3.22) is used. For every \(\epsilon >0\), the Young’s inequality gives
This reduces to the estimate of the average \(\Big \{\frac{\partial ^2\Pi _h^{\nabla }v_h}{\partial {\varvec{n}}_e^2}\Big \} = \Big \{{\varvec{n}}_e^T (\nabla _h^2\Pi _h^{\nabla }v_h) {\varvec{n}}_e\Big \}\).
For an interior edge e with the neighboring virtual triangles \(T_+\) and \(T_-\), the definition of the average and the Young’s inequality give
for any \(\alpha >0\). Since \((\nabla _h^2\Pi _h^{\nabla }v_h)|_{T_\pm }\) are polynomials of degree \(k-2\), referring to the result in [18, 42], we derive
The optimal value \(\alpha = |T_+|/|T_-|\) and the boundedness of \(\Pi _h^{\nabla }\) in (3.9) of Lemma 3.1 lead to
For a boundary edge e with adjacent virtual triangle \(T_+\), we can get
Consequently, with the choice of \(\lambda _e\), the sum over all edges and the finite overlap of the edge patches lead to
The above discussion gives
Every choice of \(0< \kappa \le \min \{ \alpha _* - 1/(a_\lambda \epsilon ), 1 - \epsilon \}\) leads to a nonnegative lower bound, and so proves the claim that
Taking \(\epsilon = 1/\sqrt{a_\lambda }\) with \( a_\lambda > \max \{ 1, \frac{1}{\sqrt{\alpha _*}}\}\) results in
as required. \(\square \)
Remark 3.3
In contrast to the finite element method discussed in [18], the parameter \(\lambda _e\) for the VEM depends on the unknown constants \(\alpha _*\) and \(C_{\nabla ,e}\). Although specifying these constants poses a challenge, they remain independent of mesh sizes under the given mesh assumption. Consequently, \(\lambda _e\) can be selected proportionally to \(\frac{N_K k(k-1) h_e^2 }{4} \Big ( \frac{1}{|T_+|} + \frac{1}{|T_-|} \Big )\) for an interior edge e. This also implies that the lower and upper bounds of \(\lambda _e\) are also independent of mesh sizes, indicating \(\lambda _e \eqsim 1\) under the given mesh assumption.
Theorem 3.1
For the parameter \(\lambda _e\) chosen as in Lemma 3.3, there exists a unique solution to the discrete problem (3.12).
Proof
For any \(v_h \in V_h\), Lemma 3.3 along with the stability (3.23) yields the coercivity
For the boundedness of the bilinear form, by the definition of \(\Vert \cdot \Vert _h\) given in (3.20), it suffices to consider \(\varepsilon ^2 J_2(v_h,w_h)\) for any \(v_h,w_h \in V_h\). The Cauchy-Schwarz inequality gives
For an interior edge e with the neighboring virtual triangles \(T_+\) and \(T_-\), we obtain from (3.25) and the definition of \(\lambda _e\) that
where a and \(N_K\) are defined in Lemma 3.3. For a boundary edge e, one can get
Therefore,
which together with (3.27) yields
The proof is finished by using the Lax-Milgram lemma. \(\square \)
4 Error Analysis
4.1 An Abstract Strang-Type Lemma
For any function \(v \in H_0^1(\Omega )\cap H^2(\Omega )\), its interpolation \(I_h v\) is defined by the condition that v and \(I_h v\) have the same degrees of freedom:
Since the computation of the elliptic projection \(\Pi _h^\nabla I_h u\) only involves the DoFs of u and \(\chi _i(I_h u) = \chi _i(u)\) for \(\chi _i\in {\varvec{\chi }}\), we define \(\Pi _h^\nabla u= \Pi _h^\nabla I_h u\) in what follows, which makes the expressions \(\Vert u-u_h\Vert _{\varepsilon ,h}\), \(\Vert u-I_hu\Vert _{\varepsilon ,h}\) and \(\Vert u-u_{\pi }\Vert _{\varepsilon ,h}\) well-defined in the following lemma, where u is the exact solution to (1.1).
As shown in Lemma 3.11 of [47], we can derive the following interpolation error estimate.
Lemma 4.1
For any \(v\in H^{\ell }(K)\) with \(2\le \ell \le k+1\), it holds
Lemma 4.2
Assume that \(u\in H_0^2(\Omega )\cap H^s(\Omega )\) is the solution to (2.1) with \(3\le s \le k+1\). Then we have the error estimate
where \(u_\pi \) is a piecewise polynomial with degree \(\le k\) that satisfies (2.2),
and the consistency term
with
where \(I_h^c\) is the conforming interpolation operator defined in Sect. 3.2.
Proof
Noting that \(u_\pi |_K \in V_k(K)\), we have \(I_h u_\pi = u_\pi \). By the triangle inequality,
The interpolation error estimate in Lemma 4.1 gives
For \(\varepsilon ^2J_1(I_h (u - u_\pi ),I_h (u - u_\pi ))\), we obtain from Lemma 2.1 and Lemma 3.1 that
where the inverse inequalities in (3.8) are used in the last step. By the definition of the norm,
Let \(\delta _h:= I_hu-u_h\). We have by the coercivity (3.26) and the definition of the discrete problem (3.12) that
where we have used (3.14) in Remark 3.2.
According to the k-consistency (3.21) and the stability formulas (3.22) and (3.23), combining with (3.16), we get
The proof is completed by using the triangle inequality (4.4). \(\square \)
Lemma 4.3
Let \(u\in H_0^2(\Omega )\cap H^s(\Omega )\) with \(3\le s \le k+1\). One can get rid of \(\varepsilon ^2 J_2(I_hu,v_h)\) in the consistency term (4.3) and obtain
where
where \({\varvec{t}}_e\) is a unit tangential vector of an edge \(e\in {\mathcal {E}}_h\).
Proof
For brevity, we use the summation convention whereby summation is implied when an index is repeated exactly two times. For any given \(v_h \in V_h\), the integration by parts gives
where \({\varvec{n}}_K = (n_1, n_2)\) denotes the unit outward normal vector along the boundary \(\partial K\). Since \(\partial _iv = n_i\partial _{{\varvec{n}}}v + t_i\partial _{{\varvec{t}}}v\), we immediately obtain
where \({\varvec{t}}_K = (t_1, t_2)\) denotes the unit counterclockwise tangential vector along the boundary \(\partial K\). Therefore,
where
and \(E_{A2}(u,v_h)\) and \(E_{A3}(u,v_h)\) are defined as in the lemma. For \({\widetilde{E}}_{A1}(u,v_h)\), we consider the decomposition
The result follows from Lemma 4.2. \(\square \)
4.2 Error Estimate
For \(3\le s \le k+1\), the estimate of the load term is
namely,
Replacing \(\Pi _{0,K}^{s-3}f\) by 0, one also easily finds that
We now consider the consistency term in Lemma 4.2.
Lemma 4.4
Given \(k \ge 2\) and \(f \in H^{s-2}(\Omega )\) with \(3 \le s \le \) \(k+1\), assume that \(u \in H_0^2(\Omega ) \cap H^s(\Omega )\) is the solution of (2.1) for \(s=3\), and it is the solution of (1.1) for \(s\ge 4\), respectively. Then the consistency error is bounded by
Proof
For clarity, we divide the proof into two steps.
Step 1: According to Lemma 4.3, one has
where \(E_{A1}(u,v_h)\) can be decomposed as the sum of \(E_{A1}^1(u,v_h)\) and \(E_{A1}^2(u,v_h)\), with
Applying the Cauchy-Schwarz inequality, the trace inequality and the projection error estimates, we can get
The inverse inequality for polynomials and the boundedness of \(\Pi _h^\nabla \) in (3.9) imply
This together with the Dupont-Scott theory, the Cauchy-Schwarz inequality and Lemma 4.1 gives
According to the Cauchy-Schwarz inequality,
The trace inequality, the inverse inequality on polynomials, the boundedness of \(\Pi _h^{\nabla }\) in (3.9), and \(\lambda _e \eqsim 1\) give
This along with the Dupont-Scott theory and Lemma 4.1 yields
Collecting above estimates to derive
For \(E_{A2}(u,v_h)\), similar to the arguments in [48, Lemma 5.3], one has
We next estimate
When \(s = 3\) or \(k=2\), the solution \(u \in H_0^2(\Omega ) \cap H^3(\Omega )\) is assumed to be the solution to (2.1). By definition,
The integration by parts gives
which implies
since \(C_0^\infty (\Omega )\) is dense in \(H_0^1(\Omega )\), \(u\in H^3(\Omega )\) and \(I_h^c v_h \in H_0^1(\Omega )\). Hence,
Noting that \(\chi _K(I_h^c v_h) = \chi _K(v_h)\), where \(\chi _K(v) = \int _K v \textrm{d}x/|K|\), one has \(\Pi _{0,K}^0 I_h^c v_h=\Pi _{0,K}^0 v_h\), yielding
By the Dupont-Scott theory and the estimates in (3.17) and (3.19),
When \(s\ge 4\) or \(k\ge 3\), the solution \(u \in H_0^2(\Omega ) \cap H^s(\Omega )\) is assumed to be the solution to (1.1). In this case, one can simply use the first equation in (1.1) to get
where the jump terms arising from the integration by parts vanish since \(I_h^c v_h\) is continuous, which also implies (4.12). Recalling the continuity of \(v_h\) at the vertices and Gauss-Lobatto points, we conclude that the quadrature formula is exact for polynomials of up to degree \((2k-1)\), which means
By the integration by parts in (4.12), along with the original equation (1.1) and \([I_h^c v_h]|_e=0\), it yields
Noting that
we have \((\Pi _{0,K}^{\ell } \Delta u, I_h^cv_h-v_h)_K = 0\) with \(0\le \ell \le k-2\), which yields
The standard argument from [25, 48] leads to
with \(\Pi _{0,e}^{s-4}\) being the \(L^2\) projector onto \({\mathbb {P}}_{s-4}(e)\). With \(q_e = \Pi _{0,e}^{s-4}\frac{\partial \Delta u}{\partial \varvec{n}_e}\in {\mathbb {P}}_{k-3}(e)\), combining the trace inequality, Lemma 4.1, (4.13), and the Cauchy-Schwarz inequality, we derive
Apply the Cauchy-Schwarz inequality, the Dupont-Scott theory and (3.19) to get
where \(\ell \) can be chosen as \(s-3\) or \(s-4\) since it gives \(0\le \ell \le k-2\) when \(4\le s \le k+1\). Combining the above two inequalities yields
Step 2: The remaining is to discuss \(\varepsilon ^2J_1(I_hu,v_h)\) and \(\varepsilon ^2J_3(I_hu,v_h)\). For \(\varepsilon ^2J_1(I_hu,v_h)\), the continuity of u leads to
As for the estimate of \(E_{A1}^1(u,v_h) \), this further gives
For \(\varepsilon ^2J_3(I_hu,v_h)\), the continuity of u, the trace inequality, the inverse inequality for polynomials, the boundedness of \(\Pi _h^{\nabla }\) in (3.9) and the Cauchy-Schwarz inequality give
The proof is completed by combining the estimates in the above two steps. \(\square \)
To sum up the above results, we obtain the error estimate for the mIPVEM described as follows.
Theorem 4.1
Under the assumption of Lemma 4.4, there holds
Proof
We only need to bound each term of the right-hand side of (4.2) in Lemma 4.2. By the trace inequality, the boundedness of \(\Pi _h^{\nabla }\) in (3.9), the interpolation error estimate in Lemma 4.1 and the Dupont-Scott theory, there exists \(u_\pi \in {\mathbb {P}}_k({\mathcal {T}}_h)\) such that
If \(\ell = \ell ' = s\), then
If \(\ell = s-1\), \(\ell ' = s\), then
The proof is completed by combining the above equations, (4.7) and Lemma 4.4. \(\square \)
4.3 Uniform Error Estimate in the Lowest Order Case
Let \(u^0\) be the solution of the following boundary value problem:
The following regularity is well-known and can be found in [33] for instance.
Lemma 4.5
If \(\Omega \) is a bounded convex polygonal domain, then
for all \(f\in L^2(\Omega )\).
Theorem 4.2
Let \(k=2\) be the order of the virtual element space. Assume that \(f \in L^2(\Omega )\) and \(u \in H_0^2(\Omega )\cap H^3(\Omega )\) is the solution to (2.1). If \(\Omega \) is a bounded convex polygonal domain, then
Proof
We only need to estimate the right-hand side of (4.2) in Lemma 4.2 term by term.
Step 1:Similar to the procedure in [45, Theorem 4.3], we have
where the derivation involves the boundary value problem (4.14) and the second estimate in Lemma 4.5. Notice that \(\Pi _h^{\nabla }u=\Pi _h^{\nabla }I_hu\), which means
On the other hand, by the trace inequality (2.3) and the boundedness of \(\Pi _h^{\nabla }\), \(\lambda _e \eqsim 1\), combining with (2.2) and Lemma 4.5, one gets
By the definition of the norm, we obtain from (4.16)–(4.19) that
The estimate of \(\Vert f-f_h\Vert _{V'_h}\) on the right-hand side of (4.2) is given in (4.8).
Step 2: For the consistency term, we first consider \(E_{A1}(u,v_h), E_{A2}(u,v_h), E_{A3}(u,v_h)\) defined in Lemma 4.3. By the trace inequalities in Lemma 2.1,
This along with the boundedness of \(\Pi _h^{\nabla }\), the interpolation error estimate in Lemma 4.1, the projection error estimates in Lemma 3.1 and Lemma 4.5 gives
Similar to the derivation of (4.22), we can obtain
Therefore,
For \(E_{A2}(u,v_h)\), we first obtain from the continuity of \(v_h\) at vertices that
By setting \(w|_e=\dfrac{\partial ^2 u}{\partial {\varvec{n}}_e \partial {\varvec{t}}_e} = {\varvec{n_e}}^T \nabla ^2 u {\varvec{t}}_e\), where w is extended outside e so that \({\varvec{n}}_e\) and \({\varvec{t}}_e\) are constant along the lines perpendicular to e, this implies
where we have used the minimization property of \(L^2\) projection and e is an edge of K. As done in the last step of (4.21), we immediately obtain
For \(E_{A3}(u,v_h)\), we choose \(k=2\) with the formula given in (4.12), i.e.,
where
is the direct consequence of the interpolation error estimate in (3.19). We obtain from the Cauchy-Schwarz inequality, the trace inequalities (2.3) and (2.4), and the interpolation error estimates (3.17) and (3.18) that
This implies
if \(\varepsilon \le h\). On the other hand, for \(\varepsilon \ge h\),
Step 3: It remains to discuss the consistency terms \(\varepsilon ^2J_1(I_hu,v_h)\) and \(\varepsilon ^2J_3(I_hu,v_h)\). By the trace inequality, the boundedness of \(\Pi _h^{\nabla }\), the Dupont-Scott theory, the interpolation error estimate in Lemma 4.1, and the regularity result in Lemma 4.5, we have
The estimation of \(\varepsilon ^2J_3(I_hu,v_h)\) can be carried out similarly, so we omit the details with the result given by
The uniform estimate follows by combining the above bounds. \(\square \)
5 Numerical Examples
In this section, we report the performance with several examples by testing the accuracy and the robustness with respect to the singular parameter \(\varepsilon \). Unless otherwise specified, we only consider the lowest-order element (\(k = 2\)) and the domain \(\Omega \) is taken as the unit square \((0,1)^2\). Note that we also perform the numerical test for \(k=3\) in Example 5.2 and consider the original penalty term (3.11) in [47] in Example 5.1.
All examples are implemented in MATLAB R2019b. Our code is available from GitHub (https://github.com/Terenceyuyue/mVEM) as part of the mVEM package which contains efficient and easy-following codes for various VEMs published in the literature. The subroutine Fourth_order_Singular_Perturbation_IPVEM.m is used to compute the numerical solutions. The test script main_Fourth_order_Singular_Perturbation_IPVEM.m verifies the convergence rates.
In contrast to the jump and average terms in [47], we include the elliptic projector \(\Pi _h^\nabla \) for all v and w in \(J_i\) for \(i=1,2,3\). This modification simplifies the implementation process, as \(\{\varphi _j = \Pi _h^{\nabla } \phi _j\}\) are polynomials with the same formulation, where \(\{\phi _j\}\) represent the basis functions on an element. Consequently, we can assemble the integrals involving jumps and averages in a manner consistent with finite element methods. According to Lemma 3.3, we choose the penalty parameter as follows:
where \(c_p = 10\) is fixed in the implementation, and \(|T_\pm |\) are approximated by \(|K_\pm |/N_{K_\pm }\).
Example 5.1
The source term is chosen in such a way that the exact solution is
Let u be the exact solution of (1.1) and \(u_h\) the discrete solution of the underlying VEM (3.12). Since the VEM solution is not explicitly known inside the polygonal elements, we will evaluate the errors by comparing the exact solution u with the elliptic projections. In this way, the discrete error in terms of the discrete energy norm is quantified by
To evaluate the accuracy of the proposed method, we examine a series of meshes consisting of a Centroidal Voronoi Tessellation of the unit square with 32, 64, 128, 256, and 512 polygons. These meshes are generated by using the MATLAB toolbox—PolyMesher as described in [36]. The convergence orders of the errors against the mesh size h are shown in Table 1. As depicted in Table 1, the VEM guarantees at least first-order convergence for all \(\varepsilon \in (0,1]\). As \(\varepsilon \) approaches zero, a nearly quadratic convergence rate is observed, aligning with the theoretical prediction in Theorem 4.1. Additionally, a stable error trend is noted in this case.
We remark that our analysis also applies to the original penalty term (3.11) in [47] when replacing \(\lambda \) by \(\lambda _e\) as in our approach. Using the same parameters, we conduct numerical simulations for this original form, with the results displayed in Table 2. We observe nearly identical results. The test script main_Fourth_order_Singular_Perturbation_IPVEM_Zhao.m.
Example 5.2
The exact solution is given by \(u = \sin (\pi x)^2\sin (\pi y)^2\).
In this example, we repeat the numerical simulation using distorted meshes illustrated in Fig. 1, showcasing both the numerical and exact solutions for \(\varepsilon = 10^{-10}\). These two figures exhibit good agreement. The convergence rates of the errors relative to the mesh size h are detailed in Table 3, revealing similar trends to those observed in Example 5.1.
Let \((\xi , \eta )\) be the coordinates on the original mesh. The nodes of the distorted mesh are obtained by the following transformation
where (x, y) is the coordinate of new nodal points; \(t_c\), taken as 0.1 in the computation, is the distortion parameter.
We also perform the numerical test for \(k=3\), with the results displayed in Table 4, frow which we observe the optimal second-order convergence when \(\varepsilon \) is relatively large and third-order convergence when \(\varepsilon \) tends to zero. The test script is main_Fourth_order_Singular_Perturbation_IPVEM_k3.m. Similar behaviors are observed for problems with boundary layers in the next three examples. For this reason, we opt to exclude the numerical outcomes. Interested readers can reproduce the experiments by executing our provided code.
Example 5.3
In this example, we test the performance of the VEM to resolve a solution with boundary layer effect. The solution with a layer is constructed such that
The right-hand side \(f(x,y) = 2y\) is independent of the singular parameter \(\varepsilon \).
We continue to examine the distorted meshes outlined in Example 5.2. The convergence rates for small \(\varepsilon \) are consolidated in Table 5. Despite the presence of strong boundary layers in the exact solution, a stable trend with a quadratic convergence rate is still evident. Numerical and exact solutions are displayed in Fig. 2.
Example 5.4
In this example, we once again assess the capability of the VEM to handle a solution affected by boundary layers. The exact solution takes on a more intricate form, defined as
The convergence rates for the distorted meshes with \(\varepsilon = 1\) and \(\varepsilon = 10^{-10}\) are depicted in Fig. 3. Similar behaviors to those in the last example are observed. Additionally, we evaluate the performance on an L-shaped domain (refer to Fig. 4 for a snapshot of the numerical and exact solutions). The meshes are composed of 100, 200, 300, 400, and 500 polygons, with the corresponding results presented in Table 6.
Example 5.5
For the Poisson problem (4.14), the exact solution is taken as
Then we compute the right-hand side of (1.1) by
The solution u of the singular perturbation problem displays strong boundary layers for very small \(\varepsilon \), but the solution u is unknown. So we focus on the error [34]
For very small \(\varepsilon (\le h)\), we can ensure a half-order convergence for the error \(\Vert u^0-u_h\Vert _{\varepsilon ,h}\). By assessing the relative error in (5.1) with u replaced by \(u^0\), we consistently observe second-order convergence in this example (see Table 7).
Data Availability
Data sharing is not applicable to this article as no data was generated or analyzed.
References
Adak, D., Natarajan, S.: Virtual element method for semilinear sine-Gordon equation over polygonal mesh using product approximation technique. Math. Comput. Simul. 172, 224–243 (2020)
Ahmad, B., Alsaedi, A., Brezzi, F., Marini, L.D., Russo, A.: Equivalent projectors for virtual element methods. Comput. Math. Appl. 66(3), 376–391 (2013)
Alvarez, S.N., Beirão Da Veiga, L., Dassi, F., Gyrya, V., Manzini, G.: The virtual element method for a 2D incompressible MHD system. Math. Comput. Simul. 211, 301–328 (2023)
Antonietti, P.F., Beirão da Veiga, L., Manzini, G.: The Virtual Element Method and Its Applications. Springer, Cham (2022)
Antonietti, P.F., Bruggi, M., Scacchi, S., Verani, M.: On the virtual element method for topology optimization on polygonal meshes: a numerical study. Comput. Math. Appl. 74(5), 1091–1109 (2017)
Antonietti, P.F., Manzini, G., Verani, M.: The fully nonconforming virtual element method for biharmonic problems. Math. Models Methods Appl. Sci. 28(2), 387–407 (2018)
Beirão Da Veiga, L., Brezzi, F., Cangiani, A., Manzini, G., Marini, L.D., Russo, A.: Basic principles of virtual element methods. Math. Models Methods Appl. Sci. 23(1), 199–214 (2013)
Beirão Da Veiga, L., Brezzi, F., Marini, L.D., Russo, A.: The Hitchhiker’s guide to the virtual element method. Math. Models Methods Appl. Sci. 24(8), 1541–1573 (2014)
Beirão Da Veiga, L., Dassi, F., Manzini, G., Mascotto, L.: The virtual element method for the 3D resistive magnetohydrodynamic model. Math. Models Methods Appl. Sci. 33(3), 643–686 (2023)
Beirão Da Veiga, L., Lovadina, C., Vacca, G.: Virtual elements for the Navier-Stokes problem on polygonal meshes. SIAM J. Numer. Anal. 56(3), 1210–1242 (2018)
Beirão Da Veiga, L., Mora, D., Vacca, G.: The Stokes complex for virtual elements with application to Navier–Stokes flows. J. Sci. Comput. 81, 990–1018 (2019)
Brenner, S.C.: Poincaré–Friedrichs inequalities for piecewise \(H^1\) functions. SIAM J. Numer. Anal. 41(1), 306–324 (2003)
Brenner, S.C., Neilan, M.: A \(C^0\) interior penalty method for a fourth order elliptic singular perturbation problem. SIAM J. Numer. Anal. 49, 869–892 (2011)
Brenner, S.C., Scott, L.R.: The Mathematical Theory of Finite Element Methods. Springer, New York (2008)
Brenner, S.C., Sung, L.: \(C^0\) interior penalty methods for fourth order elliptic boundary value problems on polygonal domains. J. Sci. Comput. 22(23), 83–118 (2005)
Brezzi, F., Buffa, A., Lipnikov, K.: Mimetic finite differences for elliptic problems. M2AN Math. Model. Numer. Anal. 43(2), 277–295 (2009)
Brezzi, F., Marini, L.D.: Virtual element methods for plate bending problems. Comput. Methods Appl. Mech. Eng. 253, 455–462 (2013)
Bringmann, P., Carstensen, C., Streitberger, J.: Local parameter selection in the \(C^0\) interior penalty method for the biharmonic equation. J. Numer. Math. 6, 66 (2023)
Cáceres, E., Gatica, G.N.: A mixed virtual element method for the pseudostress-velocity formulation of the Stokes problem. IMA J. Numer. Anal. 37, 296–331 (2017)
Cangiani, A., Manzini, G., Sutton, O.J.: Conforming and nonconforming virtual element methods for elliptic problems. IMA J. Numer. Anal. 37(3), 1317–1354 (2016)
Chen, L., Huang, J.: Some error analysis on virtual element methods. Calcolo 55(1), 5 (2018)
Chen, L., Huang, X.: Nonconforming virtual element method for \(2m\)-th order partial differential equations in \(R^n\). Math. Comput. 89(324), 1711–1744 (2020)
Chi, H., Pereira, A., Menezes, I.F.M., Paulino, G.H.: Virtual element method (VEM)-based topology optimization: an integrated framework. Struct. Multidiscip. Optim. 62(3), 1089–1114 (2020)
Chinosi, C., Marini, L.D.: Virtual element method for fourth order problems: \(L^2\)-estimates. Comput. Math. Appl. 72(8), 1959–1967 (2016)
Ciarlet, P.G.: The Finite Element Methods for Elliptic Problems. North-Holland, Amsterdam (1978)
De Dios, B.A., Lipnikov, K., Manzini, G.: The nonconforming virtual element method. ESAIM Math. Model. Numer. Anal. 50(3), 879–904 (2016)
Feng, F., Han, W., Huang, J.: Virtual element method for an elliptic hemivariational inequality with applications to contact mechanics. J. Sci. Comput. 81(3), 2388–2412 (2019)
Feng, F., Han, W., Huang, J.: A nonconforming virtual element method for a fourth-order hemivariational inequality in Kirchhoff plate problem. J. Sci. Comput. 90(3), 89 (2022)
Gatica, G.N., Munar, M.: A mixed virtual element method for the Navier–Stokes equations. Math. Models Methods Appl. Sci. 28(14), 2719–2762 (2018)
Huang, J., Yu, Y.: A medius error analysis for nonconforming virtual element methods for Poisson and biharmonic equations. J. Comput. Appl. Math. 386, 113229 (2021)
Ling, M., Wang, F., Han, W.: The nonconforming virtual element method for a stationary Stokes hemivariational inequality with slip boundary condition. J. Sci. Comput. 85(3), Paper No. 56 (2020)
Liu, X., Li, J., Chen, Z.: A nonconforming virtual element method for the Stokes problem on general meshes. Comput. Methods Appl. Mech. Eng. 320, 694–711 (2017)
Nilssen, T.K., Tai, X., Winther, R.: A robust nonconforming \(H^2\)-element. Math. Comput. 70(234), 489–505 (2001)
Qiu, J., Wang, F., Ling, M., Zhao, J.: The interior penalty virtual element method for the fourth-order elliptic hemivariational inequality. Commun. Nonlinear Sci. Numer. Simul. 127(4644807), Paper No. 107547 (2023)
Semper, B.: Conforming finite element approximations for a fourth-order singular perturbation problem. SIAM J. Numer. Anal. 29(4), 1043–1058 (1992)
Talischi, C., Paulino, G.H., Pereira, A., Ivan Menezes, F.M.: Polymesher: a general-purpose mesh generator for polygonal elements written in Matlab. Struct. Multidiscip. Optim. 45(3), 309–328 (2012)
Wang, F., Wei, H.: Virtual element method for simplified friction problem. Appl. Math. Lett. 85(3820290), 125–131 (2018)
Wang, F., Wu, B., Han, W.: The virtual element method for general elliptic hemivariational inequalities. J. Comput. Appl. Math. 389(4194398), Paper No. 113330 (2021)
Wang, F., Zhao, J.: Conforming and nonconforming virtual element methods for a Kirchhoff plate contact problem. IMA J. Numer. Anal. 41(2), 1496–1521 (2021)
Wang, M.: On the necessity and sufficiency of the patch test for convergence of nonconforming finite elements. SIAM J. Numer. Anal. 39(2), 363–384 (2001)
Wang, M., Xu, J., Hu, Y.: Modified Morley element method for a fourth order elliptic singular perturbation problem. J. Comput. Math. 24(2), 113–120 (2006)
Warburton, T., Hesthaven, J.S.: On the constants in \(hp\)-finite element trace inverse inequalities. Comput. Methods Appl. Mech. Eng. 192(25), 2765–2773 (2003)
Xiao, W., Ling, M.: Virtual element method for a history-dependent variational–hemivariational inequality in contact problems. J. Sci. Comput. 96(3), Paper No. 82 (2023)
Zhang, B., Zhao, J.: The virtual element method with interior penalty for the fourth-order singular perturbation problem. Commun. Nonlinear Sci. Numer. Simul. 133, Paper No. 107964 (2024)
Zhang, B., Zhao, J., Chen, S.: The nonconforming virtual element method for fourth-order singular perturbation problem. Adv. Comput. Math. 46(2), Paper No. 19 (2020)
Zhang, X., Chi, H., Paulino, G.H.: Adaptive multi-material topology optimization with hyperelastic materials under large deformations: a virtual element approach. Comput. Methods Appl. Mech. Eng. 370(4129484), 112976 (2020)
Zhao, J., Mao, S., Zhang, B., Wang, F.: The interior penalty virtual element method for the biharmonic problem. Math. Comp. 92(342), 1543–1574 (2023)
Zhao, J., Zhang, B., Chen, S., Mao, S.: The Morley-type virtual element for plate bending problems. J. Sci. Comput. 76(1), 610–629 (2018)
Acknowledgements
The authors deeply appreciate the anonymous referees for their meticulous line-by-line examination and for providing valuable comments and suggestions, which greatly improved an earlier version of the paper.
Funding
Fang Feng was supported by the National Science Foundation for Young Scientists of China (No. 12401528) and also partially supported by Central Government Special Fund for Basic Scientific Research Business Expenses of Colleges and Universities, No. 30924010837. Yue Yu was partially supported by the National Science Foundation for Young Scientists of China (No. 12301561).
Author information
Authors and Affiliations
Contributions
Fang Feng and Yue Yu collaborated closely to shape the conceptualization, methodology, and writing of this research. Additionally, Yue Yu took charge of implementing the discrete method in the study. Fang Feng also checked the implementation details.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Feng, F., Yu, Y. A Modified Interior Penalty Virtual Element Method for Fourth-Order Singular Perturbation Problems. J Sci Comput 101, 21 (2024). https://doi.org/10.1007/s10915-024-02665-4
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10915-024-02665-4