1. Introduction
As is known, classical solutions for boundary value problems for elliptic equations with discontinuous coefficients do not exist. Therefore, the notion of a generalized (weak) solution was introduced. Based on this definition and on the Galerkin method, numerous numerical methods were developed for finding approximate solutions of such problems. However, these methods for boundary value problems with singularity lose accuracy, which depends on the smoothness of the solution of the original differential problem (see, for example, [
1,
2]). The singularity of the solution of the boundary value problem can be caused by the presence of re-entrant corners on the domain boundary, by the degeneration of the coefficients and right-hand sides of equation and boundary conditions, or by the internal properties of the solution (see, for example, [
3,
4,
5,
6,
7,
8,
9]). For boundary problems with a singularity, we proposed to determine an
-generalized solution. The existence, uniqueness and differential properties of this kind of solution in the weighted Sobolev spaces were studied in [
10,
11,
12,
13,
14,
15]. Based the
-generalized solution, a weighted finite element method was developed for boundary value problems for elliptic equations in two-dimensional domain with a singularity in a finite set of boundary points [
16,
17,
18,
19,
20]. A weighted FEM was constructed and studied for the Lamé system in a domain with re-entrant corners [
21,
22]. To find an approximate solution of Maxwell’s equations in an L-shaped domain, a weighted edge-based finite element method was proposed in [
23,
24]. In [
25,
26] a weight analogue of the condition of Ladyzhenskaya-Babuška-Brezzi was proved, a numerical method was developed for the Stokes and Oseen problems in domains with corner singularity. The main feature of all the developed methods is the convergence of the approximate solution to the exact one with the rate
in the norms of the Sobolev and Monk weighted spaces, regardless of the reasons causing the solution singularity and its value.
In this paper we consider the Dirichlet problem for an elliptic equation with degeneration of the solution on the entire boundary of a two-dimensional domain. In [
27] a finite element method was constructed for this problem and the convergence of this method was established. The paper [
28] singles out the weighted subspace of functions for which the approximate solutions converge to an exact solution with a speed
on a mesh with a special compression of nodes close to the boundary (see [
29]). The compression parameters depend on the constructed subspace. Our method of constructing mesh with a special compression of nodes differs from the methods proposed by other authors (see, for example, [
30,
31,
32]).
Here we test model problems with singularities in a symmetric domain. We carry out a comparative numerical analysis of finite element methods on quasi-uniform meshes and meshes with a special compression of nodes close to the boundary. We obtain experimental confirmation of theoretical estimates and demonstrate the advantage of the proposed method over the classical finite element method. By analogy with [
22], we found that it is impossible to use FEM with a strong thickening of mesh, and introduction of an R-generalized solution is required. The existence and uniqueness of the R-generalized solution for this problem were proved in [
33].
2. Problem Formulation
Let be a bounded convex two-dimensional domain with twice differentiable boundary , and let be the closure of , i.e., ; and .
We assume that a positive function belongs to the space and coincides in the boundary strip of width with the distance from x () to the boundary .
We introduce the weighted Sobolev space
with the norm
where
is a real number satisfying the inequalities
;
;
,
,
,
are integer nonnegative numbers.
We denote by
the space of functions
f with the norm
We consider the first boundary value problem for a second order elliptic equation
We suppose that the input data of Equation (
1) satisfy the conditions:
- (a)
- (b)
(
) are differentiable functions on
, such that the inequalities
hold,
- (c)
the function
satisfies the inequalities
Here , () are constants independent of x, and are any real parameters, .
Remark 1. If Conditions (2)–(6) are fulfilled for the input data, Equation (1) is called a Dirichlet boundary value problem for an elliptic equation with degeneration of the solution on the entire boundary of a two-dimensional domain. Such problems are encountered in gas dynamics, electromagnetism and other subject areas of mathematical physics. The differential properties of solutions of problems with degeneracy on the entire boundary were studied, for the first time, in [7,8,9]. We introduce the bilinear and linear forms
A function
u in
is called a generalized solution of the first boundary value Equation (
1) if for any
w in
the identity
holds.
We note that if Conditions (
2)–(
6) are satisfied, then there exists a unique generalized solution of the Equation (
1) in the space
(see Theorem 1 from [
8]). In addition
(see Theorem 1 from [
9]). Moreover, if the function
and the parameter
is sufficiently small, then the generalized solution
u belongs to the space
which is a subspace of
(see [
28]).
Remark 2. Knowing that the solution belongs to the space allows us to construct a finite element method for finding a generalized solution for the Dirichlet problem with the degeneration of the solution on the entire boundary of the domain with a convergence speed in the norm .
3. The Scheme of the Finite Element Method
We construct a scheme of the finite element method for finding an approximate generalized solution of the first boundary value Equation (
1). We perform a triangulation of the domain
(see, for example,
Figure 1).
We draw the curves
,
, at distance
,
, to the boundary
. Here
r is the exponent of compression and
;
,
is the diameter of the circle inscribed in
. In this case the line
divides the domain
into two subdomains
and
. The subdomain
is the outer domain on the boundary strip of width
b,
is the inner domain. On each curve
,
, (
,
) we fix
equidistant points, which we call the nodes. Here
,
,
is the length of the curve
(
denotes the integer part of
x) and
. All nodes on the curve
,
, are connected by the broken line. Then, we connect each node on the curve
,
, with closest nodes on the curve
. As a result, the subdomain
is divided into triangles with the compression of nodes to the boundary
. The union of all triangles with vertices on
and
is a layer
. (In
Figure 1 the subdomain
is divided into the layers
,
). The parameter
h denotes the greatest in length of the sides of the triangles in
.
The subdomain is divided quasi-uniformly into a finite number of the triangles. The sides of these triangles can not be greater than h. Moreover, the vertices of the triangles on the boundary belong to the set of vertices of the triangles in .
The algorithm and code description of this triangulation are given in [
29].
Let
be the union of closed triangles
, and
,
, is the finite element. The vertices
,
, of these triangles are the nodes of the triangulation. We denote by
the number of the internal nodes. To each node
,
, we assign the function
which is equal to 1 at the point
and zero at all other nodes, and
is linear on each triangle
K. We denote by
the linear span
. Next, we associate the following discrete problem with the constructed finite-dimensional space
: find the function
satisfying the equality
for any function
.
An approximate (finite element) generalized solution will be found in the form
where
. We assume that
,
.
The coefficients
are defined from system of equations
or
where
It is obvious that the approximate generalized solution of Problems (
1)–(
6) by the finite element method exists and is unique.
For the performed triangulation of the domain
with the exponent of the compression of the mesh
and for functions in the space
we have convergence estimates:
Here, the positive constants , are independent of u, , f and h.
4. Numerical Experiments
In this section we present the results of numerical experiments for two model problems.
Let
be a circle of unit radius with center at the point
. We consider the boundary value Equation (
1) in the domain
. The right-hand side and coefficients of Equation (
1) are given as
where
and
be a function that is infinitely differentiable and satisfies the following conditions:
The exact solution of this problem is .
For finding an approximate solution of model problems we used mesh with the compression of nodes to the boundary (), quasi-uniform mesh () and the finite element method scheme from paragraph three. For the mesh we set the number of layers n and the exponent of compression of the mesh , .
We investigate the convergence rate of the approximate solution to the exact one in the norms of the spaces and on the mesh and . The absolute value of the error in the mesh nodes on the mesh and is analyzed.
Model Problem 1. We set the parameters
,
,
, at which the solution, the coefficients and the right-hand side of the equation in Equation (
1) have the form
the exponent of compression of the mesh
.
In
Table 1 we give the number of nodes and their percentage to the total number of mesh nodes
N, in which the absolute value of the error
is not less than the specified value of the limit error. In this Table the patterns of the absolute error distribution at the nodes of the
and
meshes are also showed. We present data on the
mesh for
N nodes and on the
mesh for
N and
nodes.
In
Table 2 we present the norms of the difference between an exact and an approximate solution
and
for
and
and find the ratios of the norms
when the mesh parameter
h is reduced by a factor two. The value of the parameter
h in the domain
for
varies by changing number of layers
n.
The distribution of the absolute values of the error
e in the mesh nodes with a decrease in the
h parameter by a factor of two on the meshes
and
is given in
Table 3.
Model Problem 2. We set the parameters
,
,
, at which the solution, the coefficients and the right-hand side of Equation (
1) have the form
the exponent of compression of the mesh
.
A numerical analysis of this problem was carried out by analogy with Model Problem 1. The results of the research are presented in
Table 4,
Table 5 and
Table 6.
In
Figure 2a,b we present graphs of the error
as a function of the parameter
h on the grids
and
in a logarithmic scale. In the first case the parameter
h decreases due to an increase in the number of layers
n at a fixed value
(
Figure 2a).
In the second case
h changes due to a decrease in the width of the border strip
b at a fixed number
n (
Figure 2b).