 Research
 Open Access
 Published:
A fourth order blockhexagonal grid approximation for the solution of Laplace’s equation with singularities
Advances in Difference Equations volume 2015, Article number: 59 (2015)
Abstract
The hexagonal grid version of the blockgrid method, which is a differenceanalytical method, has been applied for the solution of Laplace’s equation with Dirichlet boundary conditions, in a special type of polygon with corner singularities. It has been justified that in this polygon, when the boundary functions away from the singular corners are from the Hölder classes \(C^{4,\lambda}\), \(0<\lambda<1\), the uniform error is of order \(O(h^{4})\), h is the step size, when the hexagonal grid is applied in the ‘nonsingular’ part of the domain. Moreover, in each of the finite neighborhoods of the singular corners (‘singular’ parts), the approximate solution is defined as a quadrature approximation of the integral representation of the harmonic function, and the errors of any order derivatives are estimated. Numerical results are presented in order to demonstrate the theoretical results obtained.
Introduction
It is well known that angular singularities arise in many applied problems when the solution of Laplace’s equation is considered, and that finitedifference and finiteelement methods may become less accurate when singularities are not taken into account. In the last two decades, for the solution of singularity problems, various combined and highly accurate methods have been proposed (see [1–8], and references therein).
Among these methods the blockgrid method (BGM), presented in [6–8], on polygons with interior angles \(\alpha_{j}\pi\), \(j=1,2,\ldots,N\), where \(\alpha_{j}\in \{ \frac{1}{2},1,\frac{3}{2},2 \} \) (staircase polygons), requires the finite neighborhood of the singular vertices to be covered by sectors (blocks), and the remaining part of the domain by overlapping rectangles (‘nonsingular’ part). The finitedifference method with square grids is used for the approximate solution in the ‘nonsingular’ part, and in the blocks the integral representations of the harmonic function are approximated by the exponentially convergent midpoint quadrature rule (see [9]). Finally these subsystems are connected together by constructing an appropriate order matching operator. BGM is a highly accurate method not only for the approximation of the solution, but also for the approximation of its derivatives around singular points.
In this paper, the fourth order BGM is extended and justified for the Dirichlet problem of Laplace’s equation on polygons with interior angles \(\alpha_{j}\pi\), where \(\alpha_{j}\in \{ \frac{1}{3},\frac{2}{3} ,1,2 \} \) (nonstaircase), by gluing with the matching operator the 7point approximation on a hexagonal grid in the ‘nonsingular’ part and the approximation of the integral representations around the singular points (on ‘singular’ parts).
An advantage of using the hexagonal grid version of BGM in this domain is that a highly accurate approximation on the irregular grids is not required as in [8]. Thus the realization of the total system of algebraic equations becomes simpler. This may not be the case for this type of domain when square or rectangular grids are applied.
Furthermore it is justified that, when the boundary functions on the sides except the adjacent sides of the singular vertices are given in \(C^{4,\lambda}\), \(0<\lambda<1\), the proposed hexagonal grid version of BGM has an accuracy of \(O ( h^{4} ) \), h is the mesh step. The same order of accuracy is obtained for the 9point scheme on a square grid (see [10, 11]).
Finally in the last section of the paper, numerical experiments are demonstrated to support the theoretical results obtained.
Boundary value problem on a special type of polygon
Let D be an open simply connected polygon, \(\gamma_{j}\), \(j=1,2,\ldots,N\), be its sides, including the ends, enumerated counterclockwise (\(\gamma _{0}\equiv\gamma_{N}\), \(\gamma_{1}\equiv\gamma_{N+1}\)), and let \(\alpha _{j}\pi\), \(\alpha_{j}\in \{ \frac{1}{3},\frac{2}{3},1,2 \} \), be the interior angles formed by the sides \(\gamma_{j1}\) and \(\gamma_{j}\). Furthermore, let \(\dot{\gamma}_{j}=\gamma_{j1}\cap\gamma_{j}\) be the jth vertex of D, \(\gamma=\bigcup_{j=1}^{N}\gamma_{j}\) be the boundary of D; s is the arclength measured along the boundary of D in the positive direction, and \(s_{j}\) is the value of s at \(\dot{\gamma }_{j}\). We denote by \(r_{j}\), \(\theta_{j}\) the polar system of coordinates with poles in \(\dot{\gamma}_{j}\) and the angle \(\theta _{j}\) is taken counterclockwise from the side \(\gamma_{j}\).
Consider the boundary value problem
where \(\Delta\equiv\partial^{2}/\partial x^{2}+\partial^{2}/\partial y^{2}\), \(\varphi_{j}\), \(j=1,2,\ldots,N\), are given functions and
In addition, at the vertices \(\dot{\gamma}_{j}\), for \(\alpha _{j}=1/3 \), the following conjugation conditions are satisfied:
No compatibility conditions are required at the vertices for \(\alpha _{j}\neq1/3\). Moreover, it is required that when \(\alpha_{j}\neq 1/3\), the boundary functions on \(\gamma_{j1}\) and \(\gamma_{j}\) are given as algebraic polynomials of the arclength s measured along γ.
Let \(E= \{ j:\alpha_{j}\neq1/3, 1\leq j\leq N \} \). We construct two fixed block sectors in the neighborhood of \(\dot{\gamma}_{j}\), \(j\in E\), denoted by \(T_{j}^{i}=T_{j}(r_{ji})\subset D\), \(i=1,2\), where \(0< r_{j2}<r_{j1}<\min\{ s_{j+1}s_{j},s_{j}s_{j1} \} \), \(T_{j}(r)= \{ ( r_{j},\theta _{j} ) :0< r_{j}<r, 0<\theta_{j}<\alpha_{j}\pi \} \). On the closed sector \(\overline{T}_{j}^{1}\), \(j\in E\), we consider the carrier function \(Q_{j}(r_{j},\theta_{j})\) in the form given in [12], which satisfies the boundary conditions (2) on \(\gamma_{j1}\cap\overline{T}_{j}^{1}\) and \(\gamma_{j}\cap\overline{ T}_{j}^{1}\), \(j\in E\).
We set (see [12])
where
is the kernel of the Poisson integral for a unit circle.
The following lemma acts as a basis for the approximation of the solution around the vertices \(\dot{\gamma}_{j}\) with angle \(\alpha_{j}\pi\), \(\alpha_{j}\neq1/3\).
Lemma 2.1
([12])
The solution u of problem (1)(4) can be represented on \(\overline{T}_{j}^{2}\backslash V_{j}\), \(j\in E\), in the form
where \(V_{j}\) is the curvilinear part of the boundary of the sector \(T_{j}^{2}\).
For the approximation of problem (1), (2) in the domain \(\overline{D}\), we apply the hexagonal grid version of the blockgrid method (see [6–8]). The application of this method first of all requires the construction of two more sectors \(T_{j}^{3}\) and \(T_{j}^{4}\), where \(0< r_{j4}<r_{j3}<r_{j2}\). Let \(D_{T}=D\backslash ( \bigcup_{j\in E}\overline{T}_{j}^{4} ) \). The following steps are taken for the realization:

(1)
We blockade the singular corners \(\dot{\gamma}_{j}\), \(j\in E\), by the double sectors \(T_{j}^{i}(r_{ji})\), \(i=2,3\), with \(T_{k}^{2}\cap T_{l}^{3}=\emptyset\), \(k\neq l\), \(k,l\in E\), and cover the polygon D by overlapping parallelograms denoted by \(D_{l}^{\prime}\), \(l=1,2,\ldots ,M\), and sectors \(T_{j}^{3}\), \(j\in E\), such that the distance from \(\overline{ D}_{l}^{\prime}\) to \(\dot{\gamma}_{j}\) is not less that \(r_{j4}\) for all \(l=1,2,\ldots,M\).

(2)
On the parallelograms \(\overline{D}_{l}^{\prime}\), \(l=1,2,\ldots,M\), we use the 7point scheme for the hexagonal grid with step size \(h_{l}\leq h\), h a parameter, for the approximation of Laplace’s equation, and the singular part \(\overline{T}_{j}^{3}\), \(j\in E\), is approximated by using the harmonic function defined in Lemma 2.1.

(3)
The fourth order matching operator in a hexagonal grid is applied for connecting the subsystems.

(4)
Schwarz’s alternating procedure is used for solving the finitedifference system formed for Laplace’s equation on the parallelograms covering \(D_{T}\).
Let \(D_{l}^{\prime}\subset D_{T}\), \(l=1,2,\ldots,M\), be open fixed parallelograms and \(D\subset ( \bigcup_{l=1}^{M}D_{l}^{\prime} ) \cup ( \bigcup_{j\in E}T_{j}^{3} ) \subset D\). We denote by \(\eta _{l}\) the boundary of \(D_{l}^{\prime}\), \(l=1,2,\ldots M\), by \(V_{j}\) the curvilinear part of the boundary of the sector \(T_{j}^{2}\), and let \(t_{j}= ( \bigcup_{l=1}^{M}\eta_{l} ) \cap\overline{T}_{j}^{3}\). For the arrangement of the parallelograms \(D_{l}^{\prime}\), \(l=1,2,\ldots ,M\), it is required that any point P lying on \(\eta_{l}\cap D_{T}\), \(1\leq l\leq M\), or lying on \(V_{j}\cap D\), \(j\in E\), falls inside at least on of the parallelograms \(D_{l(P)}^{\prime}\), \(1\leq l(P)\leq M\), depending on P, where the distance from P to \(D_{T}\cap\eta_{l(P)}\) is not less than some constant \(\kappa_{0}\) independent of P.
Let \(h\in( 0,\kappa_{0}/4 ] \) be a parameter, and define a hexagonal grid on \(D_{l}^{\prime}\), \(1\leq l\leq M\), with maximal positive step \(h_{l}\leq h\), such that the boundary \(\eta_{l}\) lies entirely on the grid lines. Let \(D_{lh}^{\prime}\) be the set of grid nodes on \(D_{l}^{\prime}\), \(\eta_{l}^{h}\) be the set of nodes on \(\eta_{l}\), and let \(\overline{D}_{lh}^{\prime}=D_{lh}^{\prime}\cup\eta_{l}^{h}\). Furthermore, \(\eta_{l0}^{h}\) denotes the set of nodes on \(\eta_{l}\cap D_{T}\), \(\eta_{l1}^{h}=\eta_{l}^{h}\backslash\eta_{l0}^{h}\), and \(t_{j}^{h}\) denotes the set of nodes on \(t_{j}\).
We also specify a natural number \(n\geq [ \ln^{1+\chi}h^{1} ] +1\), where \(\chi>0\) is a fixed number, and the quantities \(n(j)=\max \{ 4, [ \alpha_{j}n ] \} \), \(\beta _{j}=\alpha_{j}\pi/n(j)\), and \(\theta_{j}^{m}=(m1/2)\beta_{j}\), \(j\in E\), \(1\leq m\leq n(j)\). On the arc \(V_{j}\) we choose the points \(( r_{j2},\theta_{j}^{m} ) \), \(1\leq m\leq n(j)\), and denote the set of these points by \(V_{j}^{n}\). Finally, we have
For the approximation of the solution at the points of the set \(\omega ^{h,n}\) we use the fourth order linear matching operator \(S^{4}\) constructed in [8], which can be represented as follows:
where \(\varphi= \{ \varphi_{j} \} _{j=1}^{N}\),
Consider the system of difference equations
where \(1\leq l\leq M\), \(j\in E\), and the operator S is defined as
The solution of this system is the approximation of the solution of problem (1), (2) on \(\overline{D}_{\ast}^{h,n}\).
Theorem 2.2
There is a natural number \(n_{0}\) such that for all \(n\geq n_{0}\) the system of equations (8)(11) has a unique solution.
Proof
Taking into account the corresponding homogeneous system of system (8)(10), the proof follows by analogy to Lemma 2 in [6]. □
Now consider the sector \(T_{j}^{\ast}=T_{j}(r_{j}^{\ast})\), where \(r_{j}^{\ast}=(r_{j2}+r_{j3})/2\), \(j\in E\). Let \(u_{h}\) be the solution of the system of equations (8)(11). The function
defined on \(T_{j}^{\ast}\) is an approximate solution of problem (1), (2), on the closed block \(\overline{T}_{j}^{3}\), \(j\in E\).
Error analysis of the 7point approximation on the special parallelogram
Let \(D^{\prime}\) be one of the parallelograms covering the ‘nonsingular’ part of the polygon D defined in Section 2. The boundaries of the parallelogram \(D^{\prime } \) are denoted by \(\gamma_{j}^{\prime}\), enumerated counterclockwise starting from left, including the ends, \(\dot{\gamma}_{j}^{\prime }=\gamma_{j1}^{\prime}\cap\gamma_{j}^{\prime}\), \(j=1,2,3,4\), denotes the vertices of \(D^{\prime}\), \(\gamma^{\prime}=\bigcup _{j=1}^{4}\gamma _{j}^{\prime}\), and \(\overline{D}^{\prime}=D^{\prime}\cup\gamma ^{\prime } \). Furthermore \(\gamma\cap\gamma^{\prime}\neq\emptyset\), but the vertices \(\dot{\gamma}_{m}^{\prime}\) with an interior angle of \(\alpha_{m}\pi\neq\pi/3\) are located either inside of D, or on the interior of a side \(\gamma_{m}\) of D, \(1\leq m\leq N\). We define the open parallelogram \(D^{\prime}\) as \(D^{\prime}= \{ ( x,y ) :0< y<\sqrt{3}a/2, dy/\sqrt{3} <x<ey/\sqrt{3} \}\). The boundary value problem (1)(4) is considered on \(D^{\prime}\):
where \(\psi_{j}\) are the values of the solution of problem (1)(4) on \(\gamma^{\prime}\).
Let \(h>0\), where \((ed)/h\geq2\), \(a/\sqrt{3}h \geq2\) are integers. We assign to \(D^{\prime}\) a hexagonal grid of the form \(D_{h}^{\prime}= \{ (x,y)\in D^{\prime}:x=\frac{h}{2}(1l)+kh, y=l\frac{\sqrt{3}h}{2}, k,l=0,\pm1,\pm2,\pm3,\ldots\} \). Let \(\gamma_{jh}^{\prime}\) be the set of nodes on the interior of \(\gamma _{j}^{\prime}\), and
We consider the system of finitedifference equations:
where
Since (17) has nonnegative coefficients and their sum is equal to 1, the solution of system (15), (16) exists and is unique (see [13]).
Everywhere below we will denote constants which are independent of h and of the cofactors on their right by \(c,c_{0},c_{1},\ldots\) , generally using the same notation for different constants for simplicity.
Lemma 3.1
Let
and
be satisfied on the vertices whose interior angles are \(\alpha_{j}\pi =\pi/3\), where \(j=1,2,3,4\). Then the solution of problem (13), (14)
Proof
The closed parallelogram \(\overline{D}^{\prime}\) lies inside the polygon D defined in Section 2, and the vertices \(\dot{\gamma} _{m}^{\prime}\) with an interior angle of \(\alpha_{m}\pi\neq\pi/3\) are located either inside of D or on the interior of a side \(\gamma_{m}\) of D, \(1\leq m\leq N\). Since the boundary functions (14), by the definition of the boundary functions \(\varphi_{j}\) in problem (1), (2) satisfy conditions (3), (4), from the results in [14], (20) follows. □
Let \(D_{h,k}^{\prime}\) be the set of nodes whose distance from the point \(P\in D_{h}^{\prime}\) to \(\gamma_{h}^{\prime}\) is \(\frac{\sqrt{3}}{2} kh\), \(1\leq k\leq a^{\ast}\), where \(a^{\ast}= [ \frac{2d_{t}}{\sqrt{3} h} ] \), \([ c ] \) denotes the integer part of c, and \(d_{t}\) is the minimum of the halflengths of the sides of the parallelogram.
Lemma 3.2
Let \(w_{h}^{k}\neq\mathrm{const.}\) be the solution of the system of equations
and \(z_{h}^{k}\neq\mathrm{const.}\) be the solution of the system of equations
where \(1\leq k\leq a^{\ast}\). If \(\vert f_{h}^{k}\vert \leq g_{h}^{k}\), then
Proof
The proof follows analogously to the proof of the comparison theorem given in [13]. □
Lemma 3.3
Let v be the trace of the solution of problem (13), (14) on \(\overline{D}_{h}^{\prime}\), and \(v_{h}\) be the solution of system (15), (16). If
and
on the vertices with an interior angle of \(\alpha_{j}\pi=\pi/3\), \(j=1,2,3,4\), then
Proof
Let \(\epsilon_{h}=v_{h}v\) on \(\overline{D}_{h}^{\prime}\). Clearly
Let \(D_{1h}^{\prime}\) contain the set of nodes whose distance from the boundary \(\gamma^{\prime}\) is \(\frac{\sqrt{3}h}{2}\), and hence for \((x,y)\in D_{1h}^{\prime}\), \((x+sH,y+sK)\in\overline{D}^{\prime}\) for \(0\leq s\leq1\), \(H=\pm\frac{h}{2}, \pm h\), \(K=0, \pm\frac{\sqrt{3}h}{2} \), \(H^{2}+K^{2}>0\), and \(D_{2h}^{\prime}=D_{h}^{\prime}\backslash D_{1h}^{\prime}\).
Moreover, let
We rewrite problem (23), (24) as
and
In order to obtain an estimation for \(Svv\) on \(D_{1h}^{\prime}\), we use Taylor’s formula. On the basis of Lemma 3.1, we have
Since at least two values of \(\epsilon_{h}^{1}\) in \(S\epsilon _{h}^{1}\) are lying on the boundary \(\gamma_{h}^{\prime}\), on which \(\epsilon _{h}^{1}=0\), from (26), (28), and the maximum principle (see [13]), we obtain
Hence
where \(c_{4}=3c_{3}\).
Next, we consider the estimation of \(\epsilon_{h}^{2}\). Let \(D_{2h,k}^{\prime}\) be the set of nodes whose distance from the point \(P\in D_{2h}^{\prime}\) to \(\gamma_{h}^{\prime}\) is \(\frac{\sqrt{3}}{2}kh\), \(2\leq k\leq a^{\ast}\), where \(a^{\ast}= [ \frac{2d_{t}}{ \sqrt{3}h} ] \), \([ c ] \) denotes the integer part of c, and \(d_{t}\) is the minimum of the halflengths of the sides of the parallelogram. Furthermore, \(D_{2h,1}^{\prime}\equiv D_{1h}^{\prime}\) and \(D_{2h,0}^{\prime}\equiv\gamma_{h}^{\prime}\). Since the vertices with \(\alpha_{j}=\frac{1}{3}\) of the parallelogram \(D^{\prime}\) are never used as a node of the hexagonal grid for the estimation of \(\vert Svv\vert \) on \(D_{2h,k}^{\prime}\), \(2\leq k\leq a^{\ast}\), we use the inequality
for the sixth order derivatives, where ρ is the distance from \((x,y)\in D^{\prime}\) to \(\gamma_{m}^{\prime}\). Hence, we obtain
Consider a majorant function of the form
Hence \(Y_{k}\) is a solution of the finitedifference problem
where \(1\leq\mu_{k}\leq3\), \(1\leq k\leq a^{\ast}\).
We represent the solution of system (27) as the sum of the solution of the following subsystems:
where \(1\leq k\leq a^{\ast}\), \(\mu_{k}^{\prime}=0\) when \(k=1\) and \(\vert \mu_{k}^{\prime} \vert \leq c_{6}\frac{h^{4+\lambda}}{k^{2\lambda}}\) when \(k=2,3,\ldots,a^{\ast}\).
By (32), (33), and Lemma 3.2, it follows that
Hence, by taking (33) and (34) into consideration, we have
On the basis of (25), (29), and (35), we have estimation (22). □
Error analysis of the hexagonal blockgrid equations
Let
where \(u_{h}\) is the solution of system (8)(11), and u is the trace of the solution of problem (1), (2) on \(\overline{D} _{\ast}^{h,n}\). It is easy to show that (36) satisfies the system of equations
where \(1\leq m\leq N\), \(1\leq l\leq M\), \(j\in E\), and
Lemma 4.1
Let the boundary functions \(\varphi_{j}\), \(j=1,2,3,4\), in problem (1), (2) satisfy conditions (3), (4). Then
where \(\varphi=\bigcup_{j=1}^{4}\varphi_{j}\).
Proof
The function \(S^{4}(u,\varphi)\) is defined as (3.14) in [8]. Keeping in mind the positioning of the points in \(\omega^{h,n}\), conditions (3), (4), and estimation (4.64) in [14], it follows that the fourth order partial derivatives of the exact solution of problem (1), (2) are bounded on \(D_{T}\). Then estimation (41) follows from the construction of the operator \(S^{4}\). □
Lemma 4.2
There exists a natural number \(n_{0}\) such that for all \(n\geq\max \{ n_{0}, [ \ln^{1+\chi}h^{1} ] +1 \} \), \(\chi>0\) being a fixed number,
Proof
The proof follows by analogy to the proof of Lemma 6.2 in [7]. □
Theorem 4.3
Assume that conditions (3), (4) hold. Then there exists a natural number \(n_{0}\) such that for all \(n\geq\max \{ n_{0}, [ \ln^{1+\chi}h^{1} ] +1 \} \), \(\chi>0\) being a fixed number,
Proof
Consider an arbitrary parallelogram \(D_{l^{\ast}}^{\prime}\) and let \(t_{l^{\ast}j}^{h}=\overline{D}^{\prime}_{l^{\ast}}\cap t_{j}^{h}\). Assume that \(t_{l^{\ast}j}^{h}\neq\emptyset\), \(z_{h}\) is the solution of system (37), and \(r_{h}^{1}\), \(r_{jh}^{2}\), \(r_{h}^{3}\) are defined in the same way as (38)(40) on \(D_{l^{\ast}}^{\prime}\), but are zero on \(\overline{D}_{\ast}^{h,n}\backslash D_{l^{\ast}}^{\prime}\). Hence,
We represent the function \(z_{h}\) as
where
and
Hence by (44)(48), \(z_{h}^{1}\) satisfies the system of equations
where \(1\leq m\leq N\), \(1\leq l\leq M\), \(j\in E\), and the functions \(z_{h}^{k}\), \(k=2,3,4\), are assumed to be known.
As the solution of system (45), \(z_{h}^{2}\), is the error function of the finitedifference solution with step size \(h_{l^{\ast}}\leq h\) of system (15), (16), by (48), the maximum principle and Lemma 3.3, we have
Also, for the solutions of systems (46) and (47), as the operator S has coefficients which are nonnegative and their sum does not exceed 1, by the maximum principle, (48), Lemma 4.1, and Lemma 4.2, we obtain the inequalities
Now we consider the solution of \(v_{h}^{1}\). Taking into consideration (49), the gluing condition of \(D_{l}^{\prime}\), \(l=1,2,\ldots,M\), and \(T_{j}^{2}\), \(j\in E\), for all \(n\geq\max \{ n_{0}, [ \ln^{1+\chi}h^{1} ] +1 \} \) we have the inequality
where \(0<\lambda^{\ast}<1\). By (43), (44), (50), (51), (52), and (53), we have
Hence (42) follows. □
For the approximation of (12), we consider the following theorem.
Theorem 4.4
Let \(u_{h}\) be the solution of the system of equations (8)(11) and let an approximate solution of problem (1), (2) be found on the blocks \(\overline{T}_{j}^{3}\), \(j\in E\), by (12). There is a natural number \(n_{0}\) such that for all \(n\geq\max \{ n_{0}, [ \ln^{1+\chi}h^{1} ] \} \), \(\chi>0\) being a fixed number, the following estimations hold:

For \(\alpha_{j}=1\), \(p\geq1\),
$$ \biggl\vert \frac{\partial^{p}}{\partial x^{pq}\, \partial y^{q}} \bigl( U_{h}(r_{j},\theta _{j})u(r_{j},\theta_{j}) \bigr) \biggr\vert \leq c_{p}h^{4}\quad\textit{on }\overline{T}_{j}^{3}. $$ 
For \(\alpha_{j}=\frac{2}{3},1,2\), \(0\leq p\leq\frac{1}{\alpha_{j}}\),
$$ \biggl\vert \frac{\partial^{p}}{\partial x^{pq}\, \partial y^{q}} \bigl( U_{h}(r_{j},\theta _{j})u(r_{j},\theta_{j}) \bigr) \biggr\vert \leq c_{p}h^{4}r_{j}^{1/\alpha_{j}p}\quad\textit{on }\overline{T}_{j}^{3}. $$ 
For \(\alpha_{j}=\frac{2}{3},2\), \(p>\frac{1}{\alpha_{j}}\),
$$ \biggl\vert \frac{\partial^{p}}{\partial x^{pq}\, \partial y^{q}} \bigl( U_{h}(r_{j},\theta _{j})u(r_{j},\theta_{j}) \bigr) \biggr\vert \leq c_{p}h^{4}/r_{j}^{p1/\alpha_{j}}\quad \textit{on }\overline{T}_{j}^{3}\backslash\dot{\gamma }_{j}, $$
where \(j\in E\), \(0\leq q\leq p\), and \(c_{p}\), \(p=0,1,\ldots\) , are constants independent of \(r_{j}\), \(\theta_{j}\), and h.
Proof
By taking estimation (42) into account, the proof follows by analogy to the proof of Theorem 6.4 in [7]. □
Numerical results
Two examples have been solved in order to test the effectiveness of the proposed method. In Example 5.1, it is assumed that there is a slit in the domain D, thus causing a strong singularity at the origin. The vertex \(\dot{\gamma}_{1}\) containing the singularity has an interior angle of \(\alpha_{1}\pi=2\pi\). The exact solution of this problem is assumed to be known. In Example 5.2, we consider a problem with two singularities. The vertices which contain the singularities have interior angles of \(\alpha_{j}\pi=\frac{2}{3}\pi\), \(j=2,4\). In this example, the exact solution is not known.
After separating the ‘singular’ part in Example 5.1, the remaining part of the domain is covered by 5 overlapping parallelograms, whereas in Example 5.2, the ‘nonsingular’ part of the domain is covered by only two parallelograms. For the solution of the blockgrid equations, Schwarz’s alternating method is used. In each Schwarz iteration the system of equations on the parallelograms are solved by the block GaussSeidel method. The carrier function is constructed for each example, taking into consideration the boundary conditions given on the adjacent sides of the vertices in the ‘singular’ parts. Furthermore, the derivatives are approximated in the ‘singular’ parts for both of the examples.
The results are provided in Tables 15, and Figures 15.
Example 5.1
Consider the open parallelogram \(D= \{ ( x,y ) :\frac{\sqrt{3}}{2}< y<\frac{\sqrt{3}}{2},1 \frac{y}{\sqrt{3}}<x<1\frac{y}{\sqrt{3}} \} \). We assume that there is a slit along the straight line \(y=0\), \(0\leq x\leq1\). Let \(\gamma_{j}\), \(j=1,2,\ldots,7\), be the sides of D, including the ends, enumerated counterclockwise starting from the upper side of the slit (\(\gamma _{0}\equiv\gamma_{7} \)), \(\gamma=\bigcup_{j=1}^{7}\gamma_{j}\), and \(\dot{\gamma}_{j}=\gamma_{j}\cap\gamma_{j1}\) be the vertices of D. Let \(( r,\theta ) \equiv ( r_{1},\theta_{1} ) \) be a polar system of coordinates with pole in \(\dot{\gamma}_{1}\), where the angle θ is taken counterclockwise from the side \(\gamma_{1}\).
We consider the boundary value problem
where \(\varphi_{j}\) is the value of the function \(v ( r,\theta ) =0.5r^{1/2}\sin\frac{\theta}{2}+0.8r^{3/2}\sin \frac{3\theta}{2}+2r^{2}\cos2\theta+2.5r^{3}\cos3\theta+2\theta\) on \(\gamma_{j}\).
As \(\varphi_{0}=2x^{2}+2.5x^{3}+4\pi\) and \(\varphi_{1}=2x^{2}+2.5x^{3}\), we obtain the carrier function in the form
where \(\xi_{2}(r,\theta)=r^{2} ( ( 2\pi\theta ) \cos 2(2\pi\theta)+\ln r\sin2(2\pi\theta) ) /2\pi\) and \(\xi_{3}(r,\theta)=r^{3} ( ( 2\pi\theta ) \cos3(2\pi \theta)+\ln r\sin3(2\pi\theta) ) /2\pi\). The following notation is used in the table of results. Let \(D_{l}^{\prime }\), \(l=1,2,\ldots,5\), be the open overlapping parallelograms, \(D_{NS}=\bigcup_{l=1}^{5}\overline{D}_{l}^{\prime}\) be the ‘nonsingular’ part, and \(D_{S}=\overline{D}\backslash D_{NS} \) denote the ‘singular’ part of D (see Figure 1). In Table 1, the values are obtained in the maximum norm of the difference between the exact and the approximate solutions, for the values of \(h=2^{k}\), \(k=4,5,6,7\), and n, which is the number of quadrature nodes on \(V_{j}\). The order of convergence, \(R_{D}^{m}= \frac{\Vert vv_{2^{m}}\Vert _{D}}{\Vert vv_{2^{(m+1)}}\Vert _{D}}\) has also been included. We also present the error obtained between the derivatives of the exact and the blockgrid solutions \(\epsilon _{h}^{ ( 1 ) }=r^{1/2} ( \frac{\partial u}{\partial x}\frac{\partial U_{h}}{\partial x} ) \) and \(\epsilon_{h}^{ ( 2 ) }=r^{3/2} ( \frac{\partial^{2}u}{\partial x^{2}}\frac{\partial ^{2}U_{h}}{\partial x^{2}} ) \), in the maximum norm, in Tables 2 and 3, respectively. Figures 2 and 3 illustrate the shapes of the derivatives \(\frac{\partial u}{\partial x}\) and \(\frac{\partial^{2}u}{\partial x^{2}}\) of the approximate (a) and the exact (b) solutions. These figures also demonstrate the highly accurate approximation of the derivatives.
Example 5.2
Let P be the open parallelogram \(P= \{ (x,y):0< y<\frac{\sqrt{3}}{2},\frac{y}{\sqrt{3}}<x<1\frac{y}{\sqrt{3}} \} \), let \(\gamma_{j}\), \(j=1,2,3,4\), be the sides of P, including the ends, enumerated counterclockwise starting from left (\(\gamma_{0}\equiv\gamma_{4}\), \(\gamma_{1}\equiv\gamma_{5}\)), \(\gamma=\bigcup_{j=1}^{4}\gamma_{j}\), and \(\dot{\gamma_{j}}=\gamma _{j}\cap\gamma_{j1}\) be the vertices of P. We look at a problem with two corner singularities at the vertices \(\dot{\gamma}_{2}\) and \(\dot{\gamma}_{4}\), where \(\alpha_{j}\pi=\frac{2}{3}\pi\), \(j=2,4\). The two ‘singular’ corners of P are covered by sectors and these areas are denoted by \(P_{S}^{i}\), \(i=1,2\), and two overlapping parallelograms cover the ‘nonsingular’ part of the domain, denoted by \(P_{NS}^{i}\), \(i=1,2\) (see Figure 4).
We consider the boundary value problem
The carrier functions constructed for each singularity are \(Q_{2} ( r_{2},\theta_{2} ) =1\frac{3\theta_{2}}{2\pi}\) and \(Q_{4}(r_{4},\theta_{4})=\frac{3\theta_{4}}{2\pi}\). We have checked the accuracy of the obtained approximate results \(u_{h}\) by looking at the order of convergence using the formula \(\widetilde{R}_{P}^{m}=\frac{\Vert u_{2^{m}}u_{2^{m+1}}\Vert _{P}}{\Vert u_{2^{m1}}u_{2^{m}}\Vert _{P}}\), which corresponds to 2^{4}, for the pairs \((h,n)=(2^{4},80)\), \((2^{5},100)\), \((2^{6},100)\), \((2^{7},90)\). The results are presented in Table 4. Moreover, \(\frac{\partial ^{2}u}{\partial x^{2}}\) has been approximated in the ‘singular’ part, where u is the unknown exact solution of problem (55). The results are presented in Table 5 and illustrated further in Figure 5.
Conclusion
A fourth order square and hexagonal grid version of the blockgrid method, for the solution of the boundary value problem of Laplace’s equation on staircase polygons, with interior angles \(\alpha_{j}\in \{ \frac{1}{2},1,\frac {3}{2},2 \}\), is extended for the polygons with interior angles \(\alpha_{j}\pi\), \(\alpha_{j}\in \{ \frac{1}{3},\frac{2}{3},1,2 \}\), by constructing and justifying the blockhexagonal grid method. Moreover, the smoothness requirement on the boundary functions away from the singular vertices (outside of the ‘singular’ parts) is lowered down from the Hölder classes \(C^{6,\lambda}\), \(0<\lambda<1\), as in [8], to \(C^{4,\lambda}\), \(0<\lambda<1\), which was proved for the 9point scheme on square grids (see [10, 11]).
The proposed version of the BGM can be applied for the mixed boundary value problem of Laplace’s equation on the above mentioned polygons. Furthermore, by this method any order derivatives of the solution can be highly approximated on the ‘singular’ parts, which are difficult to obtain in other numerical methods.
This method can also be used for the solution of the biharmonic equation by representing the problem with two problems for the Laplace and Poisson equations.
References
 1.
Li, ZC: A nonconforming combined method for solving Laplace’s boundary value problems with singularities. Numer. Math. 49(5), 475497 (1986)
 2.
Li, ZC: Combined Methods for Elliptic Problems with Singularities, Interfaces and Infinities. Kluwer Academic, Dordrecht (1998)
 3.
Olson, LG, Georgiou, GC, Schultz, WW: An efficient finite element method for treating singularities in Laplace’s equation. J. Comput. Phys. 96(2), 391410 (1991)
 4.
Xenophontos, C, Elliotis, M, Georgiou, G: A singular function boundary integral method for Laplacian problems with boundary singularities. SIAM J. Sci. Comput. 28(2), 517532 (2006)
 5.
Georgiou, GC, Smyrlis, YS, Olson, L: A singular function boundary integral method for the Laplace equation. Commun. Numer. Methods Eng. 12(2), 127134 (1996)
 6.
Dosiyev, AA: A blockgrid method of increased accuracy for solving Dirichlet’s problem for Laplace’s equation on polygons. Comput. Math. Math. Phys. 34(5), 591604 (1994)
 7.
Dosiyev, AA: The high accurate blockgrid method for solving Laplace’s boundary value problem with singularities. SIAM J. Numer. Anal. 42(1), 153178 (2004)
 8.
Dosiyev, AA, Celiker, E: Approximation on the hexagonal grid of the Dirichlet problem for Laplace’s equation. Bound. Value Probl. 2014, 73 (2014)
 9.
Volkov, EA: An exponentially converging method for solving Laplace’s equation on polygons. Math. USSR Sb. 37(3), 295325 (1980)
 10.
Dosiyev, AA: On the maximum error in the solution of Laplace equation by finite difference method. Int. J. Pure Appl. Math. 7, 229242 (2003)
 11.
Dosiyev, AA, Buranay, SC: A fourth order accurate differenceanalytical method for solving Laplace’s boundary value problem with singularities. In: Tas, K, Machado, JAT, Baleanu, D (eds.) Mathematical Methods in Engineering, pp. 167176. Springer, Berlin (2007)
 12.
Volkov, EA: Block Method for Solving the Laplace Equation and Constructing Conformal Mappings. CRC Press, Boca Raton (1994)
 13.
Samarskii, AA: The Theory of Difference Schemes. Dekker, New York (2001)
 14.
Volkov, EA: Differentiability properties of solutions of boundary value problems for the Laplace equation on a polygon. Tr. Mat. Inst. Steklova 77, 113142 (1965)
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript.
Rights and permissions
Open Access This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.
About this article
Received
Accepted
Published
DOI
Keywords
 hexagonal grid
 Laplace’s equation
 singularity problem
 blockgrid method