 Research
 Open Access
 Published:
Approximation on the hexagonal grid of the Dirichlet problem for Laplace’s equation
Boundary Value Problems volume 2014, Article number: 73 (2014)
Abstract
The fourth order matching operator on the hexagonal grid is constructed. Its application to the interpolation problem of the numerical solution obtained by hexagonal grid approximation of Laplace’s equation on a rectangular domain is investigated. Furthermore, the constructed matching operator is applied to justify a hexagonal version of the combined BlockGrid method for the Dirichlet problem with corner singularity. Numerical examples are illustrated to support the analysis made.
MSC:35A35, 35A40, 35C15, 65N06, 65N15, 65N22, 65N99.
1 Introduction
When solving PDEs, many approximate methods, such as overlapping versions of domain decomposition, composite grids and different types of combined methods, use the matching operator to connect the subsystems within them. Hence, the approximation of the solutions relies heavily on the order of accuracy of the matching operator, as well as on the order of accuracy of the subsystems. In [1] and [2], the second order matching operator is used to construct and justify the second order composite grid method for solving Laplace’s boundary value problems. In [3], the fourth order matching operator is constructed and used for the fourth order composite grids and in [4] and [5] it is used for the fourth order BlockGrid method. In [6–9], the sixth order matching operator is constructed for the BlockGrid method and it is used for the sixth order composite grids in [10].
In all of the above mentioned papers, the fourth and sixth order matching operators were constructed on the basis of the 9point finite difference solution of Laplace’s equation on square grids. In this paper, the matching operator is constructed for the solution of the Dirichlet problem on a hexagonal grid. In order to approximate the given differential equations at each regular node {P}_{0} on a hexagonal grid, the six equidistant nodes surrounding {P}_{0} are used, and the truncation error obtained is O({h}^{4}). Thus, we obtain the same order of accuracy when using the 7point scheme on the hexagonal grid, as we do when using the 9point scheme on the rectangular grid (see [11]). This has many computational advantages such as (i) the matrix of the system will contain seven diagonals rather than nine and will lead to less use of memory space, (ii) the calculations will require less computational effort and (iii) the algorithm will be easier to implement. Hexagonal grids are favored in many applied problems in dynamical meteorology and dynamical oceanography as well (see [12–14]), due to the benefits a hexagonal grid provides, compared to a rectangular grid.
Even though using a hexagonal grid has the above mentioned advantages, it has not been used before in methods such as composite grids, domain decomposition, and combined methods, as the fourth order matching operator for connecting the subsystems together was not constructed. In this paper, in Section 2, the approximate solution in a hexagonal grid on a rectangular domain is analyzed. In Section 3 a fourth order matching operator is constructed and its application to find the fourth order accurate approximate solution on the closed domain is considered. Section 4 contains the justification of using a hexagonal grid for the solution of Laplace’s equation on a staircase polygon, with the use of the BlockGrid method. This method requires the application of the matching operator constructed in Section 3 and gives an overall fourth order accuracy. Numerical examples are illustrated in Section 5 to support the analysis made.
2 Approximation in the hexagonal grid of the Dirichlet problem on a rectangle
Let \mathrm{\Pi}=\{(x,y):0<x<a,0<y<b\} be a rectangle, {\gamma}_{j}, j=1,2,3,4, be its sides, 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} be the boundary of Π, and let {A}_{j}={\gamma}_{j1}\cap {\gamma}_{j} be the j th vertex. We consider the boundary value problem
where \mathrm{\Delta}={\partial}^{2}/\partial {x}^{2}+{\partial}^{2}/\partial {y}^{2}, {\phi}_{j} is a given function of arclength s taken along γ, and
At the vertices s={s}_{j} ({s}_{j} is the beginning of {\gamma}_{j}), the conjugation conditions
are satisfied.
Let h>0, with a/h\ge 2, b/\sqrt{3}h\ge 2 integers. We assign {\mathrm{\Pi}}^{h} a hexagonal grid on Π, with step size h, defined as the set of nodes
Let {\gamma}_{j}^{h} be the set of nodes on the interior of {\gamma}_{j}, and let {\dot{\gamma}}_{j}^{h}={\gamma}_{j}\cap {\gamma}_{j+1}, {\gamma}^{h}=\bigcup ({\gamma}_{j}^{h}\cup {\dot{\gamma}}_{j}^{h}), {\overline{\mathrm{\Pi}}}^{h}={\mathrm{\Pi}}^{h}\cup {\gamma}^{h}. Also let {\mathrm{\Pi}}^{\ast h} denote the set of nodes whose distance from the boundary γ of \overline{\mathrm{\Pi}} is \frac{h}{2} and {\mathrm{\Pi}}^{0h}={\mathrm{\Pi}}^{h}\mathrm{\setminus}{\mathrm{\Pi}}^{\ast h}.
We consider the system of finite difference equations
where
From formulae (2.9) and (2.10) it follows that the coefficients of the expressions Su(x,y) and {S}_{j}^{\ast}u(x,y) are nonnegative, and their sums do not exceed one. Hence, on the basis of the maximum principle, it follows that the solution of system (2.6)(2.8) exists and it is unique (see [11]).
Everywhere below we will denote constants which are independent of h and of the cofactors on their right by c,{c}_{0},{c}_{1},\dots , generally using the same notation for different constants for simplicity.
Lemma 2.1 Let
and
where {f}_{h}, {\overline{f}}_{h}, {\overline{f}}_{h}^{\ast} and {\overline{\eta}}_{h} are arbitrary grid functions. If the conditions
are satisfied, then
Proof The proof of this lemma is similar to the proof of the comparison theorem (see Ch. 4 in [11]). □
Theorem 2.2 Let u be the solution of problem (2.1), (2.2) and {u}_{h} be the solution of system (2.6)(2.8), then
Proof Let
where u is the trace of the solution of problem (2.1), (2.2) on {\overline{\mathrm{\Pi}}}^{h}, and {u}_{h} is the solution of system (2.6)(2.8). Then, the error function {\u03f5}_{h} satisfies the following system:
where
are the truncation errors of equations (2.6) and (2.7), respectively.
On the basis of conditions (2.3) and (2.4), from Theorem 3.1 in [15] it follows that u\in {C}^{6,\lambda}(\overline{\mathrm{\Pi}}), 0<\lambda <1. Then, by Taylor’s formula, we obtain (see [16])
where
We represent the solution of (2.13)(2.15) as
where
and
By taking the function as {v}_{2}={h}^{4}{c}_{1}{M}_{6}({a}^{2}+{b}^{2}{x}^{2}{y}^{2}) in Lemma 2.1, we obtain
Using Taylor’s formula about each of the points (\frac{h}{2},y)\in {\mathrm{\Pi}}^{\ast h} and from (2.17), we have
On the basis of the maximum principle, we obtain
From (2.19), (2.20), and (2.21) it follows that
□
Remark 2.3 Estimation (2.12) remains true when {E}_{jh}^{\ast}({\phi}_{j}) in system (2.6)(2.8) is replaced by
3 Construction of the fourth order matching operator
Let z=x+iy be a complex variable, and let \mathrm{\Omega}=\{z:z<1\} be a unit circle. For a harmonic function u on Ω with u\in {C}^{4,0}(\overline{\mathrm{\Omega}}), by Taylor’s formula, any point (x,y)\in \mathrm{\Omega} can be represented as
where r=\sqrt{{x}^{2}+{y}^{2}},
By analogy with the idea used in [8], we construct the operator {S}^{4} from the condition that the expression
where {u}_{k}=u({P}_{k}), {P}_{k} is a node of the hexagonal grid {\mathrm{\Pi}}^{h}, gives the exact value of any harmonic polynomial
at each point P\in \mathrm{\Pi}, and
Let {\mathrm{\Pi}}_{0} denote the set of points P\in \mathrm{\Pi} such that all the nodes {P}_{k} to determine the expression {S}^{4}u belong to {\overline{\mathrm{\Pi}}}^{h}, and {\mathrm{\Pi}}_{01} contain the points P, where some of the nodes {P}_{k} emerge through the side {\gamma}_{j}, j=1,2,3,4. We construct the fourth order matching operator {S}^{4} by considering the cases when the point P belongs to one of the sets {\mathrm{\Pi}}_{0} or {\mathrm{\Pi}}_{01}.
Case 1. The point P\in {\mathrm{\Pi}}_{0} lies on the line connecting two neighboring grid nodes (a grid line).
We place the origin of the rectangular system of coordinates on the node {P}_{0} and direct the positive axis of x along the grid line, so that P=P(\delta h,0), 0<\delta \le 1/2, and take the nodes.
First, we find the coefficients {\lambda}_{j}^{\prime}, j=0,1,2,3, such that the representation
is true for the harmonic polynomials Re{z}^{n}, n=0,1,2,3, where u=u(P), {u}_{k}=u({P}_{k}), k=0,1,2,3, z=x+iy. This gives the system
By solving system (3.3) and rearranging (3.2) for u, we obtain the equation
We now take into consideration the nodes {P}_{4}(\frac{h}{2},\frac{\sqrt{3}h}{2}) and {P}_{5}(\frac{h}{2},\frac{\sqrt{3}h}{2}) which are symmetric to the points {P}_{2} and {P}_{3}, respectively, with respect to the xaxis. Since Im{z}^{k}=0, k=1,2,3 for y=0, and odd with respect to y, and Re{z}^{k}, k=0,1,2,3, is even with respect to y, from (3.4) we have
Hence, we obtain the matching operator {S}^{4}, for which the expression
gives the exact value of the harmonic polynomial {F}_{3}(x,y) at the point P, where
It is easy to check that
and
Remark 3.1 When 1/2<\delta <1, the node {P}_{1}, which is closest to P, is taken as the origin.
Case 2. The point P\in {\mathrm{\Pi}}_{0} lies inside a grid cell of the hexagonal grid.
Again, we place the origin of the rectangular system of coordinates at the node {P}_{0} and direct the positive axis of x along the grid line, so that P has the coordinates P(\delta h,\frac{\sqrt{3}h\kappa}{2}), where 0<\delta ,\kappa \le 1/2. We form an artificial grid by taking the following points:
Each of the nodes {P}_{k}^{\prime}, k=0,1,\dots ,5, of the artificial grid falls on a grid line, and for the approximation of P the expression
is used. As {P}_{k}^{\prime}, k=0,1,\dots ,5, all lie on grid lines, each of these points needs to be approximated using the matching operator as follows:
From the distribution of the nodes it becomes obvious that only 17 nodes are needed for this approximation (see Figure 2).
Hence, we form the matching operator as
where {\xi}_{k}, k=0,\dots ,16, are defined by the coefficients obtained earlier and
For the approximation, it is also important to examine the structure of the hexagonal grid. There are two types of triangles in each hexagon, Type A and Type B, as shown in Figure 1.
We consider triangles of Type A with 0<\delta ,\kappa \le 1/2. The nodes used in {S}^{4}u are shown in Figure 2.
In the case 1/2<\delta <1, 0<\kappa \le 1/2, the 17 nodes used have the same distribution as the reflection of the nodes in Figure 2 about the line x=0. In the cases 0<\delta \le 1/2, 1/2<\kappa <1 and 1/2<\delta ,\kappa <1, the nodes for {S}^{4} are defined analogously.
In the case when P falls into a triangle of Type B, we rotate the artificial grids formed for Type A with an angle of 180^{∘}, for all four cases of δ and κ specified earlier.
Case 3. P\in {\mathrm{\Pi}}_{01}, where u={\phi}_{j} on the side {\gamma}_{j}, j=1,2,3,4, and {\phi}_{j}\in {C}^{4,\lambda}({\gamma}_{j}), 0<\lambda <1.
We position the origin of the rectangular system of coordinates on {\gamma}_{j} so that the point P lies on the positive y axis, and the x axis is in the direction of the vertex {A}_{j+1} along {\gamma}_{j}. It is obvious that {\sum}_{k=1}^{3}{b}_{k}Im{z}^{k}=0 if y=0, where z=x+iy. Hence, when the function {\phi}_{j}\in {C}^{4,\lambda}({\gamma}_{j}), 0<\lambda <1, is represented using Taylor’s formula about the point x=0 in the neighborhood z\le 4h of the origin, we define {a}_{k}, k=0,1,2,3, of (3.1) as
We let
for y>0, and keeping in mind that Im{z}^{k} is odd extendable, we complete the definition with \tilde{u}(x,y)=\tilde{u}(x,y) for y<0. Clearly, in the given neighborhood, \tilde{u}(x,y) is equal to the harmonic polynomial {\sum}_{k=1}^{3}{b}_{k}Im{z}^{k}, with an accuracy of O({h}^{4}). To form an expression for the matching operator {S}^{4}\tilde{u}, we use
or
where
Hence using (3.10) or (3.11), with the addition of the term
we have the following representation for the solution u of problem (2.1), (2.2) at any P\in {\mathrm{\Pi}}_{01}
Remark 3.2 We obtain the representation (3.13), with a less number of grid nodes {P}_{j} in (3.10) or (3.11) for the points on the boundary γ of Π.
Let \phi ={\{{\phi}_{j}\}}_{j=1}^{4}. We express the matching operator {S}^{4} as follows:
Theorem 3.3 Let the boundary functions {\phi}_{j}, j=1,2,3,4, in problem (2.1), (2.2) satisfy the conditions
Then
where u is the exact solution of problem (2.1), (2.2).
Proof According to Theorem 3.1 in [15], from conditions (3.15) and (3.16) it follows that u\in {C}^{4,\lambda}(\overline{\mathrm{\Pi}}). Then on the basis of (3.1), (3.5), (3.8), (3.13), and Remark 3.2, we obtain inequality (3.17). □
We define the function {\stackrel{\u02c6}{u}}_{h} as follows:
where {u}_{h} is the solution of the finite difference problem (2.6)(2.8).
Theorem 3.4 Let conditions (2.3) and (2.4) be satisfied. Then the function {\tilde{u}}_{h} is continuous on \overline{\mathrm{\Pi}}, and
where u is the solution of problem (2.1), (2.2).
Proof From the construction of the expression {S}^{4}({u}_{h},\phi ) it follows that {\stackrel{\u02c6}{u}}_{h}={u}_{h} on {\mathrm{\Pi}}^{h}, and {\stackrel{\u02c6}{u}}_{h}={\phi}_{j} on {\gamma}_{j}^{h}, j=1,2,3,4. The continuity of {\stackrel{\u02c6}{u}}_{h} on Π follows from the continuity {S}^{4}({u}_{h},\phi ) on each closed triangle Type A and Type B, and from the equality {\stackrel{\u02c6}{u}}_{h}={u}_{h} on {\mathrm{\Pi}}^{h}. By Remark 3.2 and from the condition {\stackrel{\u02c6}{u}}_{h}={\phi}_{j} on {\gamma}_{j}^{h}, j=1,2,3,4, the continuity of the function {\stackrel{\u02c6}{u}}_{h} on the closed rectangle \overline{\mathrm{\Pi}} follows. By virtue of (2.3) and (2.4) it follows that u\in {C}^{6,\lambda}(\overline{\mathrm{\Pi}}), 0<\lambda <1 (see Theorem 3.1 in [15]). Then, on the basis of (3.6), (3.7), (3.9), (3.11) Theorem 2.2, Theorem 3.3 and (3.18), we obtain
□
4 An application of the matching operator in the BlockGrid method
Let G be an open simply connected staircase polygon, let {\gamma}_{j}, j=1,2,\dots ,N, be its sides, including the ends, and let {\alpha}_{j}\pi, {\alpha}_{j}\in \{\frac{1}{2},1,\frac{3}{2},2\}, be the interior angle formed by the sides {\gamma}_{j1} and {\gamma}_{j} ({\gamma}_{0}={\gamma}_{N}). Furthermore, let s be the arc length measured along the boundary of G in the positive direction and {s}_{j} be the value of s at the vertex {A}_{j}={\gamma}_{j1}\cap {\gamma}_{j}, ({r}_{j},{\theta}_{j}) be a polar system of coordinates with pole in {A}_{j} and the angle {\theta}_{j} taken counterclockwise from the side {\gamma}_{j}.
We consider the boundary value problem
where {\phi}_{j} are given functions, and
Moreover, at the vertices {A}_{j} for {\alpha}_{j}=\frac{1}{2} the conjugation conditions
are satisfied. At the vertices {A}_{j} for {\alpha}_{j}\ne \frac{1}{2} no compatibility conditions for boundary functions are required; in particular the values of {\phi}_{j1} and {\phi}_{j} at these vertices might be different. Additionally, it is required that when {\alpha}_{j}\ne 1/2, the boundary functions on {\gamma}_{j1} and {\gamma}_{j} are given as algebraic polynomials of arclength s measured along γ.
Let E=\{j:{\alpha}_{j}\ne 1/2,j=1,2,\dots ,N\}. We call the vertices {A}_{j}, j\in E, the singular vertices of the polygon G. We construct two fixed block sectors in the neighborhood of {A}_{j}, j\in E, denoted by {T}_{j}^{i}={T}_{j}({r}_{ji})\subset G, 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 function {Q}_{j}({r}_{j},{\theta}_{j}), which has the following properties:

(i)
{Q}_{j}({r}_{j},{\theta}_{j}) is harmonic and bounded on the open sector {T}_{j}^{1};

(ii)
continuous everywhere on {\overline{T}}_{j}^{1} apart from the point {A}_{j}, j\in E when {\phi}_{j1}\ne {\phi}_{j};

(iii)
continuously differentiable on {\overline{T}}_{j}^{1}\mathrm{\setminus}{A}_{j};

(iv)
satisfies the given boundary conditions on {\gamma}_{j1}\cap {\overline{T}}_{j}^{1} and {\gamma}_{j}\cap {\overline{T}}_{j}^{1}, j\in E.
The function {Q}_{j}({r}_{j},{\theta}_{j}) with properties (i)(iv) is given in [17].
Let
where
is the kernel of the Poisson integral for a unit circle.
The approximation of the integral representation given in the following lemma is used to construct an approximate solution of problem (4.1) around the singular vertices {A}_{j}, j\in E.
Lemma 4.1 The solution u of problem (2.1), (2.2) can be represented on {\overline{T}}_{j}^{2}\mathrm{\setminus}{V}_{j}, j\in E, in the form
where {V}_{j} is the curvilinear part of the boundary of the sector {T}_{j}^{2}.
Proof The proof follows from Theorems 3.1 and 5.1 in [17]. □
We define the approximate solution in the whole polygon G by applying a version of the BlockGrid method introduced in [8] (see also [9]).
Let us consider, in addition to the sectors {T}_{j}^{1}, {T}_{j}^{2}, the sectors {T}_{j}^{3} and {T}_{j}^{4}, which are also in the neighborhood of each vertex {A}_{j}, j\in E, of the polygon G, with 0<{r}_{j4}<{r}_{j3}<{r}_{j2}, {r}_{j3}=({r}_{j2}+{r}_{j4})/2 and {T}_{k}^{3}\cap {T}_{l}^{3}=\mathrm{\varnothing}, k\ne l, where k,l\in E. Furthermore, let {G}_{T}=G\mathrm{\setminus}({\bigcup}_{j\in E}{T}_{j}^{4}). We give the description of the BlockGrid method on a hexagonal grid:

(i)
All singular corners {A}_{j}, j\in E, are separated by the double sectors {T}_{j}^{i}={T}_{j}({r}_{ji}), i=2,3, with {r}_{j3}<{r}_{j2}, {T}_{k}^{2}\cap {T}_{l}^{3}=\mathrm{\varnothing}, k\ne l and k,l\in E. The polygon is covered by overlapping rectangles {\mathrm{\Pi}}_{k}, k=1,2,\dots ,M, and sectors {T}_{j}^{3}, j\in E, such that the distance from {\mathrm{\Pi}}_{k} to a singular point {A}_{j} is greater than {r}_{j4} for all k=1,2,\dots ,M and j\in E.

(ii)
On each rectangle {\mathrm{\Pi}}_{k}, the seven point difference scheme for the approximation of Laplace’s equation on a hexagonal grid is used, with step size {h}_{k}\le h, h is a parameter, and as an approximate solution on {\overline{T}}_{j}^{3}, j\in E, the harmonic function (4.6) is used.

(iii)
We use the matching operator {S}^{4} constructed in Section 3 to connect the subsystems.
For obtaining the numerical solution of the algebraic system of equations (2.1), (2.2), we outline the procedure: Let {\mathrm{\Pi}}_{k}\subset {G}_{T}, k=1,2,\dots ,M, be certain fixed open rectangles with sides {a}_{1k} and {a}_{2k} parallel to the sides of G, and G\subset ({\bigcup}_{k=1}^{M}{\mathrm{\Pi}}_{k})\cup ({\bigcup}_{j\in E}{T}_{j}^{3})\subset G. We use {\eta}_{k} to denote the boundary of the rectangle {\mathrm{\Pi}}_{k}, {V}_{j} is the curvilinear part of the boundary of the sector {T}_{j}^{2} and {t}_{j}=({\bigcup}_{k=1}^{M}{\eta}_{k})\cap {\overline{T}}_{j}^{3}.
The overlapping condition is imposed on the arrangement of the rectangles {\mathrm{\Pi}}_{k}, k=1,2,\dots ,M: any point P lying on {\eta}_{k}\cap {G}_{T}, 1\le k\le M, or located on {V}_{j}\cap G, j\in E, falls inside at least one of the rectangles {\mathrm{\Pi}}_{k(P),}1\le k(P)\le M, where the distance from P to {G}_{T}\cap {\eta}_{k(P)} is not less than some constant {\varkappa}_{0} independent of P. The quantity {\varkappa}_{0} is called the gluing depth of the rectangles {\mathrm{\Pi}}_{k}, k=1,2,\dots ,M.
We introduce the parameter h\in (0,{\varkappa}_{0}/4] and consider a hexagonal grid on {\mathrm{\Pi}}_{k}, k=1,2,\dots ,M, with maximal possible step {h}_{k}\le min\{h,min\{{a}_{1k},{a}_{2k}\}/4\}. Let {\mathrm{\Pi}}_{k}^{h} be the set of nodes on {\mathrm{\Pi}}_{k}, let {\eta}_{k}^{h} be the set of nodes on {\eta}_{k}, and let {\overline{\mathrm{\Pi}}}_{k}^{h}={\mathrm{\Pi}}_{k}^{h}\cap {\eta}_{k}^{h}. We denote the set of nodes on the closure of {\eta}_{k}\cap {G}_{T} by {\eta}_{k0}^{h}, and the set of nodes on {\mathrm{\Pi}}_{k}^{h} whose distance from the boundary {\eta}_{k}\cap {G}_{T} of {\mathrm{\Pi}}_{k} is \frac{h}{2} by {\eta}_{k0}^{\ast h}. We also have {\mathrm{\Pi}}_{k}^{\ast h} denoting the set of nodes whose distance from the boundary {\eta}_{k1} of {\mathrm{\Pi}}_{k} is \frac{h}{2} and {\mathrm{\Pi}}_{k}^{0h}={\mathrm{\Pi}}_{k}^{h}\mathrm{\setminus}({\mathrm{\Pi}}_{k}^{\ast h}\cup {\eta}_{k0}^{\ast h}). Let {t}_{j}^{h} be the set of nodes on {t}_{j}, and let {\eta}_{k1}^{h} be the set of remaining nodes on {\eta}_{k}. We also specify a natural number n\ge [{ln}^{1+\varkappa}{h}^{1}]+1, where \varkappa >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\le m\le n(j). On the arc {V}_{j} we choose the points ({r}_{j2},{\theta}_{j}^{m}), 1\le m\le n(j), and denote the set of these points by {V}_{j}^{n}. Finally, let
Consider the system of equations
where 1\le k,m\le M, j\in E, \phi ={\{{\phi}_{j}\}}_{j=1}^{N}; S{u}_{h}, {S}_{m}^{\ast}{u}_{h} and {E}_{mh}^{\ast}({\phi}_{m}) are defined as equations (2.9), (2.10), and (2.11) in Section 2, respectively.
The solution of the system of equations (4.7)(4.11) is a numerical solution of problem (2.1), (2.2) on {\overline{G}}_{T} (‘nonsingular’ part of the polygon G).
Theorem 4.2 There is a natural number {n}_{0} such that for all n\ge {n}_{0} and h\in (0,\frac{{\varkappa}_{0}}{4}], where {\varkappa}_{0} is the gluing depth, the system of equations (4.7)(4.11) has a unique solution.
Proof Let {v}_{h} be a solution of the system of equations
where 1\le k,m\le M, j\in E. To prove the given theorem, we show that {max}_{{\overline{G}}_{\ast}^{h,n}}{v}_{h}=0. On the basis of the structure of operators S and {S}_{j}^{\ast}, and the forms (3.5), (3.6), (3.7), (3.8), (3.9), and (3.10)(3.11) of the matching operator {S}^{4} and by the maximum principle (see Ch. 4, [11]) it follows that the nonzero maximum value of the function {v}_{h} can be at the points on {\bigcup}_{j\in E}{t}_{j}^{h}. From estimation (2.29) in [18] the existence of the positive constants {n}_{0} and \sigma >0 such that for n\ge {n}_{0}
follows. However, taking (4.14) into account in (4.13) we have that the nonzero maximum value can not be at the points on {\bigcup}_{j\in E}{t}_{j}^{h} either. Since the set {\overline{G}}_{\ast}^{h,n} is connected, from equation (4.12) it follows that {max}_{{\overline{G}}_{\ast}^{h,n}}{v}_{h}=0. □
Let {u}_{h} be the solution of the system of equations (4.7)(4.11). The function
is the approximation of the integral representation (4.6) with the use of the composite midpoint rule. We use the function {U}_{h}({r}_{j},{\theta}_{j}) as an approximate solution of problem (2.1), (2.2) on the closed block {\overline{T}}_{j}^{3}, j\in E (‘singular’ parts of the polygon G).
Let
where {u}_{h} is the solution of system (4.7)(4.11) and u is the trace of the solution of (2.1), (2.2) on {\overline{G}}_{\ast}^{h,n}. On the basis of (2.1), (2.2), (4.7)(4.11), and (4.16), {\u03f5}_{h} satisfies the following difference equations:
where 1\le k,m\le M, j\in E and
Since all the rectangles {\mathrm{\Pi}}_{k}, k=1,2,\dots ,M are located away from the singular vertices {A}_{j}, j\in E of the polygon G, at a distance greater than {r}_{j4}>0 independent of h, by virtue of the conditions (2.3) and (2.4), up to sixth order derivatives of the solution of problem (2.1), (2.2) are bounded on {\bigcup}_{k=1}^{M}{\mathrm{\Pi}}_{k}. Then, by Taylor’s formula, from (4.21) we obtain
Furthermore, as {\omega}^{h,n}\subset {\bigcup}_{k=1}^{M}{\mathrm{\Pi}}_{k} from (4.22) and Theorem 3.3, we have
By analogy to the proof of Lemma 6.2 in [9], it is shown that there exists a natural number {n}_{0}, such that for all n\ge max\{{n}_{0},[{ln}^{1+\varkappa}{h}^{1}]+1\}, \varkappa >0 being a fixed number,
Theorem 4.3 There exists a natural number {n}_{0} such that for all n\ge max\{{n}_{0},[{ln}^{1+\varkappa}{h}^{1}]\}, \varkappa >0 being a fixed number,
Proof The proof follows from estimations (4.23)(4.25) and the principle of maximum by analogy to the proof of Theorem 6.1 in [9]. □
Theorem 4.4 Let {u}_{h} be the solution of the system of equations (4.7)(4.11), and let an approximate solution of problem (2.1), (2.2) be found on blocks {\overline{T}}_{j}^{3}, j\in E, by (4.15). There is a natural number {n}_{0} such that for all n\ge max\{{n}_{0},[{ln}^{1+\varkappa}{h}^{1}]\}, \varkappa >0 being a fixed number, the following estimations hold:
where 0\le q\le p, p=0,1,\dots .
Proof Estimation (4.27) is obtained from the integral representation (4.6) and formula (4.15) by using estimations (4.25) and (4.26). Estimation (4.28) for p=0,1,\dots is obtained by using inequality (4.27) and Lemma 6.12 in [17]. □
5 Numerical results and discussion
To support the theoretical results, numerical examples have been solved in two different domains.
Example 5.1 Approximation in a rectangular domain.
Consider the rectangular domain
with the boundary γ. The hexagonal grid (2.5), denoted {\mathrm{\Pi}}^{h}, is assigned to the grid Π, where {\gamma}^{h} denotes the set of nodes on the boundary γ.
We consider the problem
where
is the exact solution in the rectangular domain.
This example is solved using the incomplete LUdecomposition method (see [19], Ch. 5), and all the calculations are carried out in double precision. As a convergence test, we request the maximum residual error to be 10^{−12}, and as a starting point {v}_{h}=0 is used.
Table 1 gives the values obtained in the maximum norm of the difference between the exact and the approximate solutions, for the values of h={2}^{k}, k=3,4,5,6,7, i.e., {\parallel {\u03f5}_{h}\parallel}_{{\overline{\mathrm{\Pi}}}^{h}}={max}_{{\overline{\mathrm{\Pi}}}^{h}}v{v}_{h}. The ratios {R}_{{\overline{\mathrm{\Pi}}}^{h}}^{m}=\frac{{\parallel v{v}_{{2}^{m}}\parallel}_{{\overline{\mathrm{\Pi}}}^{h}}}{{\parallel v{v}_{{2}^{(m+1)}}\parallel}_{{\overline{\mathrm{\Pi}}}^{h}}} have also been included, where O({h}^{4}) order of accuracy corresponds to 2^{4} of the value {R}_{{\overline{\mathrm{\Pi}}}^{h}}^{m}.
Example 5.2 Less smooth function.
We consider the same problem as in Example 5.1 with the exact solution
which is less smooth than (5.1). The results obtained are consistent with the theoretical results and are summarized in Table 2.
Example 5.3 The matching operator.
Examples of the matching operator have also been considered in the domain Π. The coordinate {P}_{1}(0.55,0.4387) is chosen, where {P}_{1}\in {\mathrm{\Pi}}_{0}. The harmonic function
is assumed to be the exact solution. The result in Table 3 is obtained using h={2}^{4} and demonstrates high accuracy of the above constructed matching operator.
The second coordinate considered demonstrates the accuracy of the approximation of nearboundary points. The point chosen is {P}_{2}(0.195938,0.02), where {P}_{2}\in {\mathrm{\Pi}}_{01}, and equation (3.13) is used for approximation. Again, the harmonic function (5.3) is used as the exact solution. Lastly, a point near one of the corners of the domain {P}_{3}(0.005,0.005) has been considered, where the nodes of evaluation emerge outside of the domain from both adjacent sides of the corner. The function
is used as the exact solution. The results obtained are summarized in Table 4.
Example 5.4 Approximation in an Lshaped domain.
The final example is solved in an Lshaped domain with an angle singularity at the origin, where {\alpha}_{1}\pi =3\pi /2. The domain is defined by
where {\mathrm{\Omega}}_{1}=\{(x,y):0\le x\le 1,\frac{\sqrt{3}}{2}\le y\le 0\}, and is covered by four overlapping rectangles and a sector. The singular part is defined to be the region
where {\mathrm{\Omega}}_{1}^{s}=\{(x,y):0\le x\le \frac{1}{2},\frac{\sqrt{3}}{4}\le y\le 0\}, and the nonsingular part is {\mathrm{\Omega}}^{NS}=\mathrm{\Omega}/{\mathrm{\Omega}}^{S}. The system of BlockGrid equations is solved by Schwarz’s alternating method. The quadrature nodes on the circular arc, whose radius is taken as 0.75, and the overlapping boundaries of the rectangles are renewed after each Schwarz’s iteration. The nodes on the circular arc, the inner boundaries of the overlapping rectangles and the nodes in the set {\bigcup}_{k=1}^{4}{\eta}_{k0}^{\ast h} are renewed using the matching operator constructed above. Since the boundary functions are harmonic polynomials on the sides {\gamma}_{1} and {\gamma}_{0}\equiv {\gamma}_{6}, the nodes whose neighbors emerge outside of the domain from these sides are approximated using the function u{Q}_{1}. Finally, the solution on the singular part is approximated using the integral representation [3, 9].
The problem considered is
where
is the exact solution. Accordingly, the function {Q}_{1}(x,y) used in the integral representation is constructed as
The results in Tables 5 and 6 show the solution for different pairs (h,N), where N is the number of quadrature nodes, h is the mesh size of the hexagonal grid.
6 Conclusions
The fourth order classical 7point scheme on a hexagonal grid is applied on a rectangular domain. This leads to some of the nodes emerging from the two parallel sides while approximating points whose distance from the boundary is \frac{h}{2}. This problem was overcome by devising an approximating equation for nearboundary nodes, which included the use of three inner nodes around the point of evaluation and three points lying on the boundary. The fourth order matching operator has been constructed on the hexagonal grid functions. It is applied to construct a fourth order accurate interpolating function, on the closed rectangle, for the numerical solution of Laplace’s equation on the hexagonal grids. Further, the matching operator and the hexagonal grid approximation in a rectangle are used to obtain and justify the BlockGrid method in solving the Dirichlet problem for Laplace’s equation on staircase polygons.
Numerical examples have been provided as an illustration of the theoretical results mentioned above.
The matching operator constructed can be applied to many other forms of domain decomposition or combined methods. It will also be an interesting study to extend the approximation of the methods to using mixed or Neumann boundary conditions.
References
Volkov EA: Method of composite meshes for finite and infinite domain with a piecewisesmooth boundary. Tr. Mat. Inst. Steklova 1968, 96: 117148.
Volkov EA: On the method of composite meshes for Laplace’s equation on polygons. Tr. Mat. Inst. Steklova 1976, 140: 68102.
Dosiyev AA: A fourth order accurate composite grids method for solving Laplace’s boundary value problems with singularities. Comput. Math. Math. Phys. 2002, 42(6):832849.
Dosiyev AA, Buranay SC: A fourth order accurate differenceanalytical method for solving Laplace’s boundary value problem with singularities. In Mathematical Methods in Engineers. Edited by: Tas K, Machado JAT, Baleanu D. Springer, Berlin; 2007:167176.
Dosiyev AA, Buranay SC:A fourthorder blockgrid method for solving Laplace’s equation on a staircase polygon with boundary functions in {C}^{k,\lambda}. Abstr. Appl. Anal. 2013., 2013: Article ID 864865 10.1155/2013/864865
Dosiyev AA, Buranay SC, Subasi D: The highly accurate blockgrid method in solving Laplace’s equation for nonanalytic boundary condition with corner singularity. Comput. Math. Appl. 2012, 64: 612632.
Dosiyev AA: A blockgrid method for increasing accuracy in the solution of the Laplace equation on polygons. Russ. Acad. Sci. Dokl. Math. 1992, 45(2):396399.
Dosiyev AA: A blockgrid method of increased accuracy for solving Dirichlet’s problem for Laplace’s equation on polygons. Comput. Math. Math. Phys. 1994, 34(5):591604.
Dosiyev AA: The high accurate blockgrid method for solving Laplace’s boundary value problem with singularities. SIAM J. Numer. Anal. 2004, 42(1):153178. 10.1137/S0036142900382715
Volkov EA, Dosiyev AA: A high accurate composite grid method for solving Laplace’s boundary value problems with singularities. Russ. J. Numer. Anal. Math. Model. 2007, 22(3):291307.
Samarskii AA: The Theory of Difference Schemes. Dekker, New York; 2001.
Ničkovic S, Gavrilov MB, Tošic IA: Geostrophic adjustment on hexagonal grids. Mon. Weather Rev. 2002, 130(3):668683. 10.1175/15200493(2002)130<0668:GAOHG>2.0.CO;2
Majewski D, Liermann D, Prohl P, Ritter B, Buchhold M, Hanisch T, Paul G, Wergen W, Baumgardner J: The operational global icosahedralhexagonal gridpoint model GME: description and highresolution tests. Mon. Weather Rev. 2002, 130(2):319338. 10.1175/15200493(2002)130<0319:TOGIHG>2.0.CO;2
Sadourny R, Morel P: A finitedifference approximation of the primitive equations for a hexagonal grid on a plane. Mon. Weather Rev. 1969, 97(6):439445. 10.1175/15200493(1969)097<0439:AFAOTP>2.3.CO;2
Volkov EA: On differentiability properties of solutions of boundary value problems for the Laplace and Poisson equations on a rectangle. Proc. Steklov Inst. Math. 1965, 77: 101126.
Kantorovich LV, Krylov VI: Approximate Methods of Higher Analysis. Noordhoff, Groningen; 1958.
Volkov EA: Block Method for Solving the Laplace Equation and Constructing Conformal Mappings. CRC Press, Boca Raton; 1994.
Volkov EA: An exponentially converging method for solving Laplace’s equation on polygons. Math. USSR Sb. 1980, 37(3):295325. 10.1070/SM1980v037n03ABEH001954
Smith GD: Numerical Solution of Partial Differential Equations: Finite Difference Methods. Oxford University Press, Oxford; 1985.
Author information
Authors and Affiliations
Corresponding author
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.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Dosiyev, A.A., Celiker, E. Approximation on the hexagonal grid of the Dirichlet problem for Laplace’s equation. Bound Value Probl 2014, 73 (2014). https://doi.org/10.1186/16872770201473
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/16872770201473
Keywords
 Laplace’s equation
 Dirichlet boundary value problem
 hexagonal grids
 matching operator
 interpolation for harmonic functions
 singularity
 BlockGrid method