Abstract
In this paper, we propose new basis functions defined on curved sides or faces of curvilinear elements (polygons or polyhedrons with curved sides or faces) for the weak Galerkin finite element method. Those basis functions are constructed by collecting linearly independent traces of polynomials on the curved sides/faces. We then analyze the modified weak Galerkin method for the elliptic equation and the interface problem on curvilinear polytopal meshes with Lipschitz continuous edges or faces. The method is designed to deal with less smooth complex boundaries or interfaces. Optimal convergence rates for and errors are obtained, and arbitrary high orders can be achieved for sufficiently smooth solutions. The numerical algorithm is discussed and tests are provided to verify theoretical findings.
Keywords: Lipschitz Continuous Boundaries or Interfaces, Curvilinear Elements, Weak Galerkin Method, Traces of Polynomials, High Orders, Second-Order PDEs, 65N30, 65N12, 35J25
1. Introduction
It has been a challenging question: how to design high-order numerical methods solving Partial Differential Equations (PDEs) on domains (2D or 3D) with less smooth curved boundaries or interfaces if the solutions are sufficiently smooth? We refer [1, 2, 3, 4, 5] for high-order methods with piecewise boundaries or interfaces, and [6, 7] for high-order methods relying on the smoothness of the boundaries/interfaces. Many numerical methods fall within those two categories. Our approach based on the weak Galerkin finite element method only needs boundaries or interfaces to be Lipschitz continuous, and the convergence rates depend on the solution, not the geometry. The weak Galerkin method [8, 9, 10, 11] among others (e.g., HDG [12, 4], nonconforming VEM [13, 14], HHO[15, 16]) as a new variation of Galerkin methods has been applied to various partial differential equations [9, 17, 18, 19]. The main advantages of those methods lie in using discontinuous basis functions inside the element and on its boundaries, employing general shape elements, ensuring mass conservation, and producing continuous numerical fluxes. HDG, HHO, VEM, and other methods with curved elements dealing with elliptic interface problems and Dirichlet boundary value problems can be found in [12, 4, 15, 16, 7, 20] and references therein. The method proposed here is significantly different from them, it uses fitted meshes, and there is no need to map to reference elements and redefine basis functions. An early version of this paper in 2019, without numerical experiments, can be found on arXiv, see [21]. Similar idea was also introduced in the Virtual Element context for 2D problems, see [22]. Later development by other researchers includes [17, 23, 24, 25], but our method is still unique with relaxed requirements for regularities of boundaries/interfaces and uniform treatment in 2D and 3D. The key idea of the weak Galerkin finite element method is the definition of “weak gradient”. Suppose we have a curvilinear polygonal or polyhedral domain with interior part and boundary , see Figure 1 for a 2D example. A discontinuous function on is defined as: , . Then we denote as the space of those discontinuous functions
| (1) |
Figure 1:
A star-shaped curvilinear element with a curved side
For any , the “weak gradient” of is a linear functional in the dual space of , it’s defined by in (2)
| (2) |
where is the outward normal vector to . The discrete “weak gradient” of is defined as the solution of equation (3)
| (3) |
where is the polynomial space with degree no more than , where is a non-negtive integer. For brevity, in following sections, we use to represent .
The paper is structured as follows. In Section 2, the shape-regular assumptions for curvilinear elements are given, and new projections on curved sides/faces are defined. Based on the assumptions and projections, necessary lemmas are proved. Then the weak Galerkin finite element scheme and new basis functions are proposed. Section 3 is devoted to solving Poisson’s equation. The newly defined basis functions are used to solve the equation on curvilinear polytopal meshes with Lipschitz continuous edges or faces, where optimal convergence rates in and norms are proved. In Section 4, we apply the proposed weak Galerkin method to solve the elliptic interface problem, which involves Lipschitz continuous curved interfaces/boundaries. We also provide an error analysis that demonstrates optimal convergence rates. Section 5 shows the numerical results in 2D. Problems in 3D can be solved similarly but not presented here. Poisson’s equation with the Neumann boundary condition on the curved domain is also considered. The elliptic interface problem with the non-homogeneous jump condition on the interface is tested. For convenience, Lipschitz continuous curved sides on an element are constructed by connecting short lines, but the basis functions are defined on the whole curve. The convergence results for and elements are all optimal. Conclusions are drawn in Section 6.
2. Shape regularity
The shape regular assumptions are similar to [26, 19]. Assume
(A1) is a curvilinear polygonal/polyhedral domain with diameter ,
(A2) is star-shaped with respect to a disc/ball with radius ,
(A3) has a uniform lower bound .
Figure 1 is a curvilinear polygonal domain, which has a Lipschitz continuous curved side. Let denote (constant) . is shape-regular if it satisfies (A1)-(A3). The following Lemmas in Section 2 are valid on such , and the hidden constants only depend on and degrees of employed polynomials.
Lemma 2.1.
(Bramble-Hilbert Estimates) [27]. is shape-regular implies that:
Lemma 2.2.
(Trace Inequality (2.18)) [26]. If is shape-regular, then we have
Remark 1.
(2.18) in [26] is also valid for here with curved sides/faces. The proof is the same.
2.1. Projection Operators
We define the projection as
| (4) |
where is the projection operator from to ; is the projection operator from to , where is a side or face of , no need to be straight or flat, and is the space of restricted parts of polynomials with degrees no more than on .
Then, let be the projection operator from to , .
With shape-regular and definitions of and , we obtain Lemmas 2.3 to 2.6. The proof of Lemma 2.3 can be found in [26] (see Lemma 2.3 and Lemma 3.9). Proofs of Lemmas 2.4 and 2.5 (Lemma 2.5 depends on Lemma 2.1 and (6)) are similar to Lemmas 3 and 6 in [19], respectively. Lemma 2.6 is crucial for the error analysis of our method.
Lemma 2.3.
[26] Assume that is shape-regular. Then, we have
| (5) |
| (6) |
Lemma 2.4.
[19] For any , is shape-regular, we have
Lemma 2.5.
[19] Let be shape-regular, then for , we have
| (7) |
| (8) |
Lemma 2.6.
Let be the operator in (4). Then with shape-regular , we have
| (9) |
| (10) |
| (11) |
where , the hidden constants only depend on and .
Proof. By (3), integration by parts and the definitions of , we have
so that (9) is obtained.
To get (10), with Lemma 2.4, we have
| (12) |
then let ,
so that with Lemma 2.2 and inequality (7), let be , we have
| (13) |
with (12) and (13), we get (10).
To get (11), from (9), we have
let , with (12)
Remark 2.
If edge/face is part of a line/plane, then .
2.2. The Weak Galerkin Finite Element Scheme
Let be a bounded domain (2D or 3D) with boundary or interface. Suppose is the partition of , each element of is shape-regular, and is the set of sides/faces in , .
Let be the inner part of , be the space of polynomials on with degrees no more than , and on each side/face, , let be the space of traces of polynomials on , so the basis functions on shared , see Figure 2, are uniquely determined by collecting the linearly independent traces of . For example, traces of on , in Figure 2, are . Then the weak Galerkin finite element space is given by (14)
| (14) |
Figure 2:
is shared by two elements
Let the space be the subspace of which has vanishing boundary value on
| (15) |
We then define as the space and .
Lemma 2.7.
If is shape-regular, for any and , we have
| (16) |
| (17) |
where and the hidden constant only depends on and .
Proof. To get (16), we have
for the first term on the right side, we have
with Lemma 2.2, Lemma 2.5 and (13), then (16) is obtained.
To get (17), we have
Lemma 2.8.
[19] Assume that is shape-regular. Then we have
| (18) |
the hidden constant only depends on and .
3. The weak Galerkin finite element method for elliptic equation
Let be a bounded domain with boundary in , the Poisson’s equation is
| (19) |
For any , the weak gradient of is defined on each element by (3), respectively. For any , the bilinear form is defined as
| (20) |
The stabilization term is:
| (21) |
A numerical solution for (19) can be obtained by seeking such that
| (22) |
Then the weak-1 norm of is defined as
| (23) |
where is an integer.
We generate Figure 3 by PolyMesher [28] to show how the mesh in 2D could be.
Figure 3:
A shape regular partition of domain
Lemma 3.1.
Suppose the partition is shape-regular. Then we have
the hidden constant only depends on and .
Proof. The key to proving Lemma 3.1 is that on each edge or face is unique. Then, same as Lemma 7.1 in [10], we have the discrete Poincaré inequality.
Also, we have the existence and uniqueness of the solution of (22).
3.1. Error Analysis
Let be the solution of (19) and . Then, multiply (19) by of we have
| (24) |
where .
It follows from (3), (9) and the integration by parts
| (25) |
Combining (24) and (25), we have
| (26) |
Adding to both sides of (26) gives
| (27) |
Subtracting (22) from (27), we have the error equation
| (28) |
where
which is the error between the weak Galerkin finite element solution and the projection of the exact solution. Then we define a norm as
Theorem 3.1.
Let be the weak Galerkin finite element solution of the problem (19). Assume that the exact solution is so regular that . Then we have
| (29) |
| (30) |
the hidden constants only depend on and .
Proof. Let in (28), we have
It then follows from (10) and Lemma 2.7
| (31) |
Based on (31), firstly, we prove (29),
with Lemma 2.5 and Lemma 2.6 and
we have (29).
Secondly, with Lemma 2.8, we have
which means
Also by Lemma 2.5
then we have (30)
Theorem 3.2.
Let be the weak Galerkin finite element solution of the problem (19). Assume that the exact solution is so regular that . Then we have
| (32) |
the hidden constant only depends on and .
Proof. We begin with a dual problem seeking such that . Suppose we have .
Then we have
| (33) |
Let and in (25), we have
| (34) |
Combining (33) and (34), we have
| (35) |
So that by Lemma 2.6 and Lemma 2.7, we have
| (36) |
| (37) |
Then let in (28), such that
where
Same as the proof of Theorem 8.2 in [10], we have
and
Then
where
by Lemma 2.2, Lemma 2.3, Lemma 2.5 and Lemma 2.6
Then
| (38) |
By (31), (35), (36), (37) and (38), we have
with
the error estimate (32) is obtained.
4. The weak Galerkin finite element method for elliptic interface problem
Let be a bounded domain with boundary in be the interface, , the equation is
| (39) |
where is the outward normal vector to are two positive constants defined on and respectively. For simplicity, let .
The mesh contains shape-regular curvilinear polygons or polyhedrons which have edges or faces as parts of or , and there is no element cross . Here we use the same weak Galerkin finite element schemes as in Section 2.2. For any , the weak gradient of is defined on each element by (3), respectively. For any , the bilinear form is defined by
| (40) |
The stabilization term is:
| (41) |
A numerical solution for (39) can be obtained by seeking such that
| (42) |
where . Then we define a new weak norm as
| (43) |
Also, we have the existence and uniqueness of the solution of (39) as in [11].
4.1. Error Analysis
Let and , be the solution of (39) and . Then, multiply (39) by of we have
| (44) |
where .
It follows from (3), (9) and the integration by parts
| (45) |
Combining (44) and (45), adding to both sides, we have
| (46) |
Subtracting (42) from (46), we have the error equation
| (47) |
where
which is the error between the weak Galerkin finite element solution and the projection of the exact solution. Then we define a norm as
and suppose , we define
Theorem 4.1.
Let be the weak Galerkin finite element solution of the problem (39). Assume that the exact solution is so regular that . Then we have
| (48) |
| (49) |
the hidden constants only depend on and .
Proof. Let in (47), we have
| (50) |
It then follows from (10) and Lemma 2.7
| (51) |
Based on (51), firstly, we prove (48),
with Lemma 2.5 and Lemma 2.6 and
we have (29).
Secondly, with Lemma 2.8, we have
which means
Also with Lemma 2.5
so that we have (49)
Theorem 4.2.
Let be the weak Galerkin finite element solution of the problem (39). Assume that the exact solution is so regular that . Then we have
| (52) |
the hidden constant only depends on and .
Proof. We begin with a dual problem seeking such that , and as in (39). Suppose we have .
Then we have
| (53) |
Let and in (45), we have
| (54) |
Combining (53) and (54), we have
| (55) |
By Lemma 2.6 and Lemma 2.7, we have
| (56) |
| (57) |
Then let in (47)
where
Same as the proof of Theorem 8.2 in [10], we have
and
Then by Lemma 2.3, Lemma 2.5, Lemma 2.6
where
so that
Then we have
| (58) |
By (51), (55), (56), (57) and (58), we have
with
the error estimate (52) is obtained.
5. Numerical Experiments
In this section, we focus on 2D problems with curved boundaries or interfaces. The main difference compared with the classical weak Galerkin method is the construction of basis functions on curved sides. For the following tests, each element in the mesh has four sides, and one or more sides are curves. We choose two types of curved sides, the special Lipschitz continuous ones formed by connecting points with short lines, and the smooth ones. Basis functions are linearly independent traces of on the curved side, for example, it’s easy to prove if the side is not straight, basis functions are always chosen: . Let , and the set of traces for on the side be
Instead of determining if the traces are linearly independent analytically, in practice, we can let be sample points on the curved side, the number of those points should be sufficiently large. For each , we can get a vector
then collect all those vectors and choose the linearly independent ones, the corresponding traces are basis functions on the curved side. Numerical integration on the curved side or curvilinear element is simple, we just need to make sure it is accurate enough to calculate convergence rates. The algorithm in 2D can be easily generalized to 3D problems.
5.1. Poisson’s Equation
This subsection is to verify that elements with Lipschitz continuous or smooth curved edges can also guarantee optimal convergence rates for solving Poisson’s equation as long as they satisfy the shape-regular assumptions. Let
be the exact solution to Poisson’s equation on a given domain with Dirichlet/Neumann Boundary conditions, we use and elements in Example 5.1.1 to Example 5.1.5.
Example 5.1.1.
Let the domain be [0, 1] × [0, 1], see Figure 5. We consider Poisson’s equation with the Dirichlet boundary condition (on the blue lines). In the mesh, each element has a Lipschitz continuous curved side which contains three short lines, basis functions are defined on the whole green-colored curved side, there are three for element and six for element. From Table 1, we can see the convergence rates for and errors are optimal.
Figure 5:
Example 5.1.1. Left: domain; Middle: initial mesh; Right: refined mesh
Table 1:
Example 5.1.1. Convergence Rates for and Elements,
| h≈ | error | error | error | error | ||||
|---|---|---|---|---|---|---|---|---|
| d/2 | 4.826e-01 | Rate | 1.758e+00 | Rate | 1.516e-01 | Rate | 1.256e+00 | Rate |
| d/4 | 1.396e-01 | 1.79 | 7.943e-01 | 1.15 | 1.825e-02 | 3.05 | 3.017e-01 | 2.06 |
| d/8 | 3.630e-02 | 1.94 | 3.711e-01 | 1.10 | 2.112e-03 | 3.11 | 7.155e-02 | 2.08 |
| d/16 | 9.167e-03 | 1.99 | 1.815e-01 | 1.03 | 2.558e-04 | 3.05 | 1.754e-02 | 2.03 |
| d/32 | 2.298e-03 | 2.00 | 9.019e-02 | 1.01 | 3.169e-05 | 3.01 | 4.360e-03 | 2.01 |
| d/64 | 5.748e-04 | 2.00 | 4.503e-02 | 1.00 | 3.952e-06 | 3.00 | 1.089e-03 | 2.00 |
Example 5.1.2.
Following Example 5.1.1, we define a parameter M which makes the curved side more flat if it is increasing, see Figure 5 (the middle one with M = 10) and Figure 6. For the same Poisson’s equation and element, we test the condition numbers of the stiff matrices on coarse meshes and obtain the convergence rates with fixed M and refined meshes. We observe that the condition number of the stiff matrix is increasing as M increases, see Table 2. However, from Table 3, we can see that the convergence rates for and errors are still optimal (even slightly better compared with Table 1 with element). So large condition numbers do not necessarily reduce the accuracy.
Figure 6:
Example 5.1.2. Meshes withes 4 elements, left: = 102; right: = 104
Table 2:
Example 5.1.2. Condition Numbers for stiff matrices on coarse meshes with basis functions
| h≈ | = 5 | = 10 | = 102 | = 103 | = 104 |
|---|---|---|---|---|---|
| 2.5861e+03 | 9.9975e+03 | 9.8530e+05 | 9.8446e+07 | 9.8438e+09 | |
| 1.0442e+04 | 3.7529e+04 | 3.6133e+06 | 3.6097e+08 | 3.6094e+10 | |
| 1.3266e+05 | 1.4676e+05 | 1.3561e+07 | 1.3547e+09 | 1.3547e+11 |
Table 3:
Example 5.1.2. Errors for Element with and ,
| h≈ | error | 102 | error | 102 | error | 104 | error | 104 |
|---|---|---|---|---|---|---|---|---|
| d/2 | 4.785e-01 | Rate | 1.760e+00 | Rate | 4.785e-01 | Rate | 1.760e+00 | Rate |
| d/4 | 1.378e-01 | 1.80 | 7.868e-01 | 1.16 | 1.378e-01 | 1.80 | 7.867e-01 | 1.16 |
| d/8 | 3.572e-02 | 1.95 | 3.674e-01 | 1.10 | 3.572e-02 | 1.95 | 3.673e-01 | 1.10 |
| d/16 | 9.012e-03 | 1.99 | 1.796e-01 | 1.03 | 9.010e-03 | 1.99 | 1.795e-01 | 1.03 |
| d/32 | 2.258e-03 | 2.00 | 8.923e-02 | 1.01 | 2.258e-03 | 2.00 | 8.922e-02 | 1.01 |
| d/64 | 5.648e-04 | 2.00 | 4.455e-02 | 1.00 | 5.647e-04 | 2.00 | 4.454e-02 | 1.00 |
Example 5.1.3.
Let the domain be [0,1]×[0,1], see Figure 7. Still, we consider Poisson’s equation with the Dirichlet boundary condition (on the blue lines). In the mesh, each element has a smooth curved side which is part of a quadratic function, basis functions are defined on the green-colored smooth curved side, there are three for element, and five for element. From Table 4, we can see the convergence rates for and errors are optimal.
Figure 7:
Example 5.1.3. Left: domain; Middle: initial mesh; Right: refined mesh
Table 4:
Example 5.1.3. Convergence Rates for and Elements,
| h≈ | error | error | error | error | ||||
|---|---|---|---|---|---|---|---|---|
| d/2 | 4.871e-01 | Rate | 1.757 | Rate | 1.526e-01 | Rate | 1.266 | Rate |
| d/4 | 1.414e-01 | 1.78 | 8.003e-01 | 1.13 | 1.864e-02 | 3.03 | 3.082e-01 | 2.04 |
| d/8 | 3.683e-02 | 1.94 | 3.743e-01 | 1.10 | 2.183e-03 | 3.09 | 7.387e-02 | 2.06 |
| d/16 | 9.309e-03 | 1.98 | 1.831e-01 | 1.03 | 2.661e-04 | 3.04 | 1.819e-02 | 2.02 |
| d/32 | 2.334e-03 | 2.00 | 9.100e-02 | 1.01 | 3.303e-05 | 3.01 | 4.531e-03 | 2.01 |
| d/64 | 5.839e-04 | 2.00 | 4.543e-02 | 1.00 | 4.121e-06 | 3.00 | 1.131e-03 | 2.00 |
Example 5.1.4.
Domain with Lipschitz continuous boundaries, let N = 192 and
if , then connect points and by straight lines, we obtain the curve (blue color); similarly, for r = 1.2, we have curve (red color), the domain is bounded by and , points are marked on curves, see Figure 8. We consider Poisson’s equation with the Dirichlet boundary condition on the blue curve and the Neumann Boundary condition on the red curve. In Figure 8, each element has at least one Lipschitz continuous curved side which contains multiple short lines, basis functions are defined on the whole curved side. From Table 5, we can see the convergence rates for and errors are optimal.
Figure 8:
Example 5.1.4. Left: domain; Middle: initial mesh; Right: refined mesh
Table 5:
Example 5.1.4. Convergence Rates for and Elements,
| h≈ | error | error | error | error | ||||
|---|---|---|---|---|---|---|---|---|
| d/2 | 5.407e-02 | Rate | 7.279e-01 | Rate | 2.263e-02 | Rate | 4.034e-01 | Rate |
| d/4 | 1.649e-02 | 1.71 | 3.172e-01 | 1.20 | 3.168e-03 | 2.84 | 1.044e-01 | 1.95 |
| d/8 | 4.213e-03 | 1.97 | 1.465e-01 | 1.11 | 4.368e-04 | 2.86 | 2.740e-02 | 1.93 |
| d/16 | 1.051e-03 | 2.00 | 7.038e-02 | 1.06 | 5.737e-05 | 2.93 | 7.049e-03 | 1.96 |
| d/32 | 2.624e-04 | 2.00 | 3.468e-02 | 1.02 | 7.302e-06 | 2.97 | 1.783e-03 | 1.98 |
Example 5.1.5.
Domain with smooth curved boundaries:
On this domain, we consider Poisson’s equation with the Dirichlet boundary condition on the blue curve and the Neumann Boundary condition on the red curve, see Figure 9. In Figure 9, each element has at least one smooth curved side, basis functions are defined on the curved side. From Table 6, we can see the convergence rates for and errors are optimal.
Figure 9:
Example 5.1.5. Left: domain; Middle: initial mesh; Right: refined mesh
Table 6:
Example 5.1.5. Convergence Rates for and Elements,
| h≈ | error | error | error | error | ||||
|---|---|---|---|---|---|---|---|---|
| d/2 | 3.548e-02 | Rate | 5.707e-01 | Rate | 1.582e-02 | Rate | 3.052e-01 | Rate |
| d/4 | 1.158e-02 | 1.62 | 2.507e-01 | 1.19 | 2.086e-03 | 2.92 | 7.838e-02 | 1.96 |
| d/8 | 3.029e-03 | 1.93 | 1.167e-01 | 1.10 | 2.722e-04 | 2.94 | 2.020e-02 | 1.96 |
| d/16 | 7.645e-04 | 1.99 | 5.656e-02 | 1.04 | 3.474e-05 | 2.97 | 5.130e-03 | 1.98 |
| d/32 | 1.915e-04 | 2.00 | 2.800e-02 | 1.01 | 4.377e-06 | 2.99 | 1.291e-03 | 1.99 |
5.2. Elliptic Interface Problem
Let and the exact solution be
for (39) with non-homogeneous jump condition. Suppose , , then we use , elements in examples 5.2.1 and 5.2.2. Except for the new basis functions, the employed numerical scheme is the same as in [11].
Example 5.2.1.
Domain with Lipschitz continuous boundaries/interfaces, let N = 192 and
if , then connect points and by straight lines, we obtain the curve ; similarly, for , we have curves , , . The points are marked on curves in Figure 10. is the region between and , the two red cures in the left domain of Figure 10; is the whole region with boundaries and , excluding . We consider the elliptic interface problem with the Dirichlet boundary condition on the blue curve. In Figure 10, each element has at least one Lipschitz continuous curved side which contains multiple short lines. Basis functions are defined on the whole curved side. From Table 7, we can see the convergence rates for and errors are optimal.
Figure 10:
Example 5.2.1. Left: domain; Middle: initial mesh; Right: refined mesh
Table 7:
Example 5.2.1. Convergence Rates for and Elements,
| h≈ | error | error | error | error | ||||
|---|---|---|---|---|---|---|---|---|
| d/2 | 1.055e-01 | Rate | 8.156e-01 | Rate | 2.488e-02 | Rate | 4.146e-01 | Rate |
| d/4 | 2.739e-02 | 1.95 | 4.027e-01 | 1.02 | 3.845e-03 | 2.69 | 1.141e-01 | 1.86 |
| d/8 | 6.755e-03 | 2.02 | 1.955e-01 | 1.04 | 5.574e-04 | 2.79 | 3.108e-02 | 1.88 |
| d/16 | 1.675e-03 | 2.01 | 9.587e-02 | 1.03 | 7.509e-05 | 2.89 | 8.138e-03 | 1.93 |
| d/32 | 4.177e-04 | 2.00 | 4.763e-02 | 1.01 | 9.727e-06 | 2.95 | 2.080e-03 | 1.97 |
Example 5.2.2.
Domain with smooth curved boundaries and interfaces:
We consider the elliptic interface problem with the Dirichlet boundary condition on the blue curve, see Figure 11. In Figure 11, each element has at least one smooth curved side. Basis functions are defined on the curved side. From Table 8, we can see the convergence rates for and errors are optimal.
Figure 11:
Example 5.2.2. Left: domain; Middle: initial mesh; Right: refined mesh
Table 8:
Example 5.2.2. Convergence Rates for and Elements,
| h≈ | error | error | error | error | ||||
|---|---|---|---|---|---|---|---|---|
| d/2 | 5.072e-02 | Rate | 4.716e-01 | Rate | 6.251e-03 | Rate | 1.773e-01 | Rate |
| d/4 | 1.297e-02 | 1.97 | 2.251e-01 | 1.07 | 8.378e-04 | 2.90 | 4.620e-02 | 1.94 |
| d/8 | 3.248e-03 | 2.00 | 1.094e-01 | 1.04 | 1.093e-04 | 2.94 | 1.187e-02 | 1.96 |
| d/16 | 8.119e-04 | 2.00 | 5.416e-02 | 1.01 | 1.395e-05 | 2.97 | 3.008e-03 | 1.98 |
| d/32 | 2.030e-04 | 2.00 | 2.700e-02 | 1.00 | 1.761e-06 | 2.99 | 7.567e-04 | 1.99 |
6. Conclusions
This paper tries to answer the question of solving second-order PDEs on domains with curved Lipschitz continuous boundaries or interfaces by high-order methods if the exact solutions are smooth enough. Our method has arbitrary high order, doesn’t introduce geometrical errors, and guarantees optimal convergence rates. Also, basis functions are easy to construct, don’t depend on the smoothness of sides/faces, and are consistent in 2D and 3D. Though not given here, the weak Galerkin schemes, for Poisson’s equation with Neumann boundary condition or the elliptic interface problem with non-homogeneous jump condition (same as in [11]) also have optimal convergence rates and can be proved similarly. There is still room to improve the current method by reducing the unknowns on the sides/faces as in [29], and it provides a way to deal with small edges/faces in the mesh by combining them and treat the connected lines/faces as a whole side/face. Our next steps are to extend the work to PDEs with nonlinear boundary conditions on curved boundaries or interfaces, which are common in biological models, see [30], and design similar basis functions on curved sides/faces for fourth-order problems.
Figure 4:
A domain with interface
Highlights.
A modified weak Galerkin method with high order accuracy is proposed for solving Poisson’s equation and elliptic interface problems with Lipschitz continuous curved boundaries or interfaces.
A novel approach to defining basis functions on curved sides/faces of curvilinear elements is presented. The basis functions are constructed by collecting linearly independent traces of polynomials on the curved sides/faces.
The proposed method achieves optimal convergence rates for and errors and can attain arbitrarily high orders for sufficiently smooth solutions. The rate of convergence is independent of the geometry.
The proposed method is discussed in terms of its numerical algorithm, and tests are presented to verify its theoretical findings.
Acknowledgments
The second author is funded by Grant R01EB034143. The third author has received support from the National Natural Science Foundation of China (Grant Number: 12001325).
Footnotes
Publisher's Disclaimer: This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.
Contributor Information
Qingguang Guan, School of Mathematics and Natural Sciences, University of Southern Mississippi, Hattiesburg, MS 39406.
Gillian Queisser, Department of Mathematics, Temple University, Philadelphia, PA 19122, USA.
Wenju Zhao, School of Mathematics, Shandong University, Jinan, Shandong 250100.
References
- [1].Guyomarc’h G, Lee C-O, Jeon K, A discontinuous galerkin method for elliptic interface problems with application to electroporation, Communications in numerical methods in engineering 25 (10) (2009) 991–1008. [Google Scholar]
- [2].Guo R, Lin T, An immersed finite element method for elliptic interface problems in three dimensions, Journal of Computational Physics 414 (2020) 109478. [Google Scholar]
- [3].Guo R, Zhang X, Solving three-dimensional interface problems with immersed finite elements: A-priori error analysis, Journal of Computational Physics 441 (2021) 110445. [Google Scholar]
- [4].Cockburn B, Qiu W, Solano M, A priori error analysis for HDG methods using extensions from subdomains to achieve boundary conformity, Mathematics of computation 83 (286) (2014) 665–699. [Google Scholar]
- [5].He C, Zhang S, Zhang X, Error analysis of petrov-galerkin immersed finite element methods, Computer Methods in Applied Mechanics and Engineering 404 (2023) 115744. [Google Scholar]
- [6].Cottrell JA, Hughes TJ, Bazilevs Y, Isogeometric analysis: toward integration of CAD and FEA, John Wiley & Sons, 2009. [Google Scholar]
- [7].Beirão da Veiga L, Russo A, Vacca G, The virtual element method with curved edges, ESAIM: Mathematical Modelling and Numerical Analysis 53 (2) (2019) 375–404. [Google Scholar]
- [8].Wang J, Ye X, A weak Galerkin finite element method for second-order elliptic problems, Journal of Computational and Applied Mathematics 241 (2013) 103–115. [Google Scholar]
- [9].Wang J, Ye X, A weak Galerkin mixed finite element method for second order elliptic problems, Mathematics of Computation 83 (289) (2014) 2101–2126. [Google Scholar]
- [10].MU L, WANG J, YE X, Weak Galerkin finite element methods on polytopal meshes., International Journal of Numerical Analysis & Modeling 12 (1). [Google Scholar]
- [11].Mu L, Wang J, Ye X, Zhao S, A new weak Galerkin finite element method for elliptic interface problems, Journal of Computational Physics 325 (2016) 157–173. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [12].Cockburn B, Gopalakrishnan J, Sayas F-J, A projection-based error analysis of HDG methods, Mathematics of Computation 79 (271) (2010) 1351–1367. [Google Scholar]
- [13].de Dios BA, Lipnikov K, Manzini G, The nonconforming virtual element method, ESAIM: Mathematical Modelling and Numerical Analysis 50 (3) (2016) 879–904. [Google Scholar]
- [14].Dedner A, Hodson A, Robust nonconforming virtual element methods for general fourth-order problems with varying coefficients, IMA Journal of Numerical Analysis 42 (2) (2022) 1364–1399. [Google Scholar]
- [15].Solano M, Vargas F, A high order HDG method for stokes flow in curved domains, Journal of Scientific Computing 79 (3) (2019) 1505–1533. [Google Scholar]
- [16].Burman E, Delay G, Ern A, The unfitted HHO method for the stokes problem on curved domains, in: Numerical Mathematics and Advanced Applications ENUMATH 2019, Springer, 2021, pp. 389–397. [Google Scholar]
- [17].Mu L, Weak Galerkin finite element with curved edges, Journal of Computational and Applied Mathematics 381 (2021) 113038. [Google Scholar]
- [18].Guan Q, Gunzburger M, Zhao W, Weak-Galerkin finite element methods for a second-order elliptic variational inequality, Computer Methods in Applied Mechanics and Engineering 337 (2018) 677–688. [Google Scholar]
- [19].Guan Q, Weak Galerkin finite element method for poisson’s equation on polytopal meshes with small edges or faces, Journal of Computational and Applied Mathematics 368 (2020) 112584. [Google Scholar]
- [20].Bertoluzza S, Pennacchio M, Prada D, Weakly imposed dirichlet boundary conditions for 2d and 3d virtual elements, Computer Methods in Applied Mechanics and Engineering 400 (2022) 115454. [Google Scholar]
- [21].Guan Q, Weak Galerkin finite element method for second order problems on curvilinear polytopal meshes with lipschitz continuous edges or faces, arXiv:1902.02400v1. [DOI] [PMC free article] [PubMed]
- [22].Beirão da Veiga L, Brezzi F, Marini L, Russo A, Polynomial preserving virtual elements with curved edges, Mathematical Models and Methods in Applied Sciences 30 (08) (2020) 1555–1590. [Google Scholar]
- [23].Li D, Wang C, Wang J, Curved elements in weak Galerkin finite element methods, arXiv preprint arXiv:2210.16907.
- [24].Yang L, Peng H, Zhai Q, Zhang R, The weak Galerkin finite element method for stokes interface problems with curved interface, arXiv preprint arXiv:2211.11926.
- [25].Yemm L, A new approach to handle curved meshes in the Hybrid High-Order method, arXiv preprint arXiv:2212.05474.
- [26].Brenner SC, Sung L-Y, Virtual element methods on meshes with small edges or faces, Mathematical Models and Methods in Applied Sciences 28 (07) (2018) 1291–1336. [Google Scholar]
- [27].Bramble JH, Hilbert S, Estimation of linear functionals on Sobolev spaces with application to Fourier transforms and spline interpolation, SIAM Journal on Numerical Analysis 7 (1) (1970) 112–124. [Google Scholar]
- [28].Talischi C, Paulino GH, Pereira A, Menezes IF, PolyMesher: a general-purpose mesh generator for polygonal elements written in Matlab, Structural and Multidisciplinary Optimization 45 (3) (2012) 309–328. [Google Scholar]
- [29].Mu L, Wang J, Ye X, A weak Galerkin finite element method with polynomial reduction, Journal of Computational and Applied Mathematics 285 (2015) 45–58. [Google Scholar]
- [30].Guan Q, Queisser G, Modeling calcium dynamics in neurons with endoplasmic reticulum: Existence, uniqueness and an implicit–explicit finite element scheme, Communications in Nonlinear Science and Numerical Simulation 109 (2022) 106354. [DOI] [PMC free article] [PubMed] [Google Scholar]











