# A Highly Accurate Regular Domain Collocation Method for Solving Potential Problems in the Irregular Doubly Connected Domains

Authors: Zhao-Qing Wang; Shuchen Li; Yang Ping; Jian Jiang; Teng-Fei Ma
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

Embedding the irregular doubly connected domain into an annular regular region, the unknown functions can be approximated by the barycentric Lagrange interpolation in the regular region. A highly accurate regular domain collocation method is proposed for solving potential problems on the irregular doubly connected domain in polar coordinate system. The formulations of regular domain collocation method are constructed by using barycentric Lagrange interpolation collocation method on the regular domain in polar coordinate system. The boundary conditions are discretized by barycentric Lagrange interpolation within the regular domain. An additional method is used to impose the boundary conditions. The least square method can be used to solve the overconstrained equations. The function values of points in the irregular doubly connected domain can be calculated by barycentric Lagrange interpolation within the regular domain. Some numerical examples demonstrate the effectiveness and accuracy of the presented method.


---

## Body

## 1. Introduction

In physics, mechanics, and other disciplines, Poisson equation or Laplace equation is used as the governing equation to describe electric potential, temperature, and many other physical quantities. The functions satisfying Laplace equation are called potential functions and the problems of electric potential, temperature, and so forth are also known as potential problems. In engineering problems, we need to inevitably solve potential problems in complex regions and the doubly connected domain composed of two closed curves is a typical complex region. Therefore, how to precisely solve potential problems in complex regions is an important issue in the field of numerical calculation.The finite element method (FEM) is an effective numerical method for solving potential problems in complex domains [1, 2]. However, to fit boundaries of complex regions and improve the calculation accuracy, FEM needs to divide dense elements, reducing the computational efficiency. The meshless methods, such as complex variable element-free Galerkin method [3–6], interpolating boundary element-free method [7], improved element-free Galerkin method [8–10], complex variable reproducing kernel particle method [11], and interpolating local Petrov-Galerkin method [12], have been presented to solve the potential and elasticity problems. In these meshless Galerkin methods, background grids are applied in numerical integration for forming the stiffness matrices.Collocation method without element division and numerical integration is a truly meshless method. The collocation method has been widely applied to the field of engineering numerical calculation [13–18]. Spectral collocation method (pseudospectral method) based on the characteristic polynomial interpolation [15, 16] is a high-precision numerical method that achieves high accuracy with fewer nodes. Differential quadrature method (DQM) is also a high-precision collocation method [17, 18]. DQM applies the weighted sum of the unknown function value in the calculating nodes to approximate the derivative value of the unknown function. In two-dimensional problem, spectral collocation method and differential quadrature method adopt the tensor product to construct the approximation functions in rectangular domain. They cannot be directly applied to numerical calculation in geometrically complex regions. Collocation method based on radial basis function interpolation [19, 20] can be directly applied in complex areas. The calculation precision of this method depends on the selection of interpolation parameters that can be obtained only from a great deal of numerical calculation experience.Embedding an irregular domain into a regular region, such as rectangular and disk, it is an effective method for solving boundary value problems of partial differential equation in complex regions [21–23]. We adopt the regular region collocation method to accurately solve the potential problems in irregular multiply connected domain by embedding the complex doubly connected domain into the regular region with polar coordinates (annular region). The barycentric Lagrange interpolation [24], a stabilized and high-precision interpolation method, is applied to discretize complex region boundary conditions. In the regular region, the barycentric interpolation collocation method [25, 26] is used to solve Poisson equations with Dirichlet boundary conditions.The paper is organized as follows. In Section2, we present the computational modeling and formulations of regular domain collocation. In Section 3, some numerical examples are given to illustrate the numerical accuracy of the proposed method, and in Section 4 we draw conclusions.


## 2. Computational Modeling and Formulations

### 2.1. Computational Modeling

Consider the potential problem on irregular domain as shown in Figure1. The doubly connected domain Ω={(r,θ):r1(θ)≤r≤r2(θ),0≤θ≤2π} is composed of the two closed curves Γ1:r=r1(θ) and Γ2:r=r2(θ)(0≤θ≤2π).Figure 1
The doubly connected domain and its regular domain.In system of polar coordinates, the governing equation and boundary conditions of the potential problem are the following:(1)Δu=urr+1rur+1r2uθθ=f(r,θ),(r,θ)∈Ω,(2)u(r1,θ)=g1(θ),0≤θ≤2π,(3)u(r2,θ)=g2(θ),0≤θ≤2π.
In the numerical calculation, the domain Ω is embedded into the annular region composed of circumference Γ3:r=a and Γ4:r=b as shown in Figure 1. In general, let a=min⁡0≤θ≤2π⁡{r1(θ)} and b=max⁡0≤θ≤2π{r2(θ)}.


### 2.2. Computational Formulations

Given a functionv(x) defined on the interval [c,d] and discrete nodes c=x1<x2<⋯<xn=d, the function values on the nodes are vi=v(xi),i=1,2,…,n. The barycentric Lagrange interpolation of the function v(x) on the nodes is [24]
(4)v(x)=∑j=1n(wj/(x-xj))vj∑j=1n(wj/(x-xj)),
where wj=1/∏j≠k(xj-xk),j=0,1,…,n, is barycentric interpolation weight.The barycentric Lagrange interpolation basis function is defined as follows:(5)Lk(x)=wk/(x-xk)∑j=0n(wj/(x-xj)),k=1,2,…,n.
Then, barycentric Lagrange interpolation of the function v(x) can be written as
(6)v(x)=∑j=1nLj(x)vj.
The mth order derivative of function v(x) can be expressed as
(7)v(m)(x):=dmv(x)dxm=∑j=1nLj(m)(x)vj.
So the mth order derivative of function v(x) in the nodes x1,x2,…,xn is
(8)v(m)(xi)=∑j=1nLj(m)(xi)vj=∑j=1nCij(m)vj,i=1,2,…,n,
where Cij(m)=Lj(m)(xi) indicates the mth order derivative value of the jth basis function at ith node. Deriving (5) with respect to x directly, we have
(9)Cij(1)=wj/wixi-xj,j≠i,Cii(1)=-∑j=1,j≠inCij(1).
And the entries Cij(m) can be derived from the following recursion [25, 26]:
(10)Cij(m)=m(Cii(m-1)Cij(1)-Cij(m-1)xi-xj),i≠j,Cii(m)=-∑j=1,j≠inCij(m).As a result, (8) can be written in the following matrix form:
(11)v(m)=C(m)v.
In (11), v(m)=[v1(m),v2(m),…,vn(m)]T and v=[v1,v2,…,vn]T represent the column vector of mth order derivative value and the value of the function v(x) in the nodes, respectively. Matrix C(m) is named as the mth order differentiation matrix of barycentric Lagrange interpolation on nodes x1,x2,…,xn.Embedding the irregular computational regionΩ into a two-dimensional annular domain D={(r,θ):a≤r≤b,0≤θ≤2π},Ω⊂D, let m and n distinct computational nodes a=r1<r2<⋯<rm=b and 0=θ1<θ2<⋯<θn=2π be given in the direction of r and θ, respectively. We can obtain m×n computational nodes of tensor product type, (ri,θj),i=1,2,…,m,j=1,2,…,n, on the domain D. The denoted values of function u(r,θ) in the computational nodes are uij=u(ri,θj),i=1,2,…,m,j=1,2,…,n.The computational nodes and function values can be formed into threem×n-dimensional column vectors as follows:
(12)R=[r1,…,r1,r2,…,r2,…,rm,…,rm]T,Θ=[θ1,…,θn,θ1,…,θn,…,θ1,…,θn]T,U=[u11,…,u1n,u21,…,u2n,…,um1,…,umn]T.The barycentric Lagrange interpolation of the functionu(r,θ) in the computational nodes can be expressed as
(13)u(r,θ)=∑i=1m∑j=1nLi(r)Mj(θ)uij,
where Li(r),Mj(θ) are barycentric Lagrange interpolation basis function on the nodes r1,r2,…,rm and θ1,θ2,…,θn, respectively.From formula (13), (l+k)th partial derivative of the function u(r,θ) with respect to r and θ can be expressed as
(14)∂l+ku∂lr∂kθ=∑i=1m∑j=1nLi(l)(r)Mj(k)(θ)uij,l,k=0,1,2,….
The value of partial derivative in the computational nodes is
(15)upq(l+k):=∂l+ku(rp,θq)∂lr∂kθ=∑i=1m∑j=1nLi(l)(θq)uij,p=1,2,…,m;q=1,2,…,n.
By using the symbols of barycentric interpolation differential matrix C(l),D(k) and matrix tensor product, “⊗”, formula (15) can be rewritten as the matrix form
(16)U(l+k)=(C(l)⊗D(k))U,
where C(l),D(k) indicate lth and kth order barycentric Lagrange interpolation differential matrix in the nodes r1,r2,…,rm and θ1,θ2,…,θn, respectively. Denote C(0)=Im,D(0)=In. Im,In are mth and nth order identity matrix, respectively. U(l+k) is m×n-dimensional column vectors which is consisted of the values of partial derivative uij(l+k)=∂l+ku(ri,θj)/∂lr∂kθ in the nodes (ri,θj),i=1,2,…,m,j=1,2,…,n,
(17)U(l+k)=[u11(l+k),…,u1n(l+k),u21(l+k),…,u2n(l+k),…,um1(l+k),…,umn(l+k)]TBy formula (16), the discrete formula of the Poisson equation (1) can be rewritten as
(18)[(C(2)⊗In)+(1R)(C(1)⊗In)+(1R2)(Im⊗D(2))]U=F.Here,1/R=diag⁡(1/r1,1/r2,…,1/rm)⊗In,1/R2=diag⁡(1/r12,1/r22,…,1/rm2)⊗In; diag is diagonal matrix which is consisted of vector; F=f(r,θ). Equation (18) can be simplified into
(19)LU=F.The boundary conditions (2)-(3) can be discretized by barycentric Lagrange interpolation (13). We arrange m1,m2 points (rib1,θib1),i=1,2,…,m1,(rib2,θib2),i=1,2,…,m2, on the boundaries Γ1,Γ2, respectively. In general, we need m1≥max⁡(m,n),m2≥max⁡(m,n). Hence, boundary conditions (2)-(3) can be interpolated as follows:
(20)u(rib1,θib1)=∑i=1m∑j=1nLi(rib1)Mj(θib1)uij=g1(θib1),∑i=1m∑j=1nLi(rib1)Mj(θib1)uiji=1,2,…,m1,u(rib2,θib2)=∑i=1m∑j=1nLi(rib2)Mj(θib2)uij=g2(θib2),∑i=1m∑j=1nLi(rib2)Mj(θib2)uiji=1,2,…,m2.
Formula (20) can be simplified into
(21)B1U=G1,B2U=G2.For numerical analysis in doubly connected domain, we need some additional conditions to ensure the single-valuedness and smoothness of functionu(r,θ). The additional conditions can be expressed as follows:
(22)u(r,0)=u(r,2π),uθ(r,0)=uθ(r,2π).The first and second conditions in (22) guarantee the single-valuedness and smoothness of function u(r,θ), respectively. Defining two index sets S0={k:Θk=0},S1={k:Θk=2π}, let ImnSi represent a matrix whose rows come from the rows of the (m×n) order identity matrix in accordance with the index set Si(i=1,2); that is, ImnSi=Imn(Si,:), and PmnSi denote a matrix whose rows extract from the rows of the (m×n) matrix Im⊗D(1), in accordance with the index set Si(i=1,2). Using notations defined as above, the additional conditions (22) can be discretized as follows:
(23)(ImnS0-ImnS1)U=0,(PmnS0-PmnS1)U=0.
Equation (23) can be rewritten as
(24)A1U=0,A2U=0.Owing to the additional conditions discretized on the computational nodes, we can use replacement method to apply the additional conditions [25–27]. The rows with index set S0 in matrix L in (19) are replaced by rows of matrix A1, and components with index set S0 in vector F are set to be zeros. The rows with index set S1 in matrix L in (19) are replaced by rows of matrix A2, and components with index set S1 in vector F are set to be zeros. Then, (19) modifies as
(25)L~U=F~.Combining (25) and (21), we obtain a saddle point system:
(26)(L~B1B2)U=(F~G1G2).Using least square method to solve (26), the function value will be gained on the regular domain D. Then, barycentric Lagrange interpolation formula (13) is used to compute the function value in any points on the complex region Ω.


## 2.1. Computational Modeling

Consider the potential problem on irregular domain as shown in Figure1. The doubly connected domain Ω={(r,θ):r1(θ)≤r≤r2(θ),0≤θ≤2π} is composed of the two closed curves Γ1:r=r1(θ) and Γ2:r=r2(θ)(0≤θ≤2π).Figure 1
The doubly connected domain and its regular domain.In system of polar coordinates, the governing equation and boundary conditions of the potential problem are the following:(1)Δu=urr+1rur+1r2uθθ=f(r,θ),(r,θ)∈Ω,(2)u(r1,θ)=g1(θ),0≤θ≤2π,(3)u(r2,θ)=g2(θ),0≤θ≤2π.
In the numerical calculation, the domain Ω is embedded into the annular region composed of circumference Γ3:r=a and Γ4:r=b as shown in Figure 1. In general, let a=min⁡0≤θ≤2π⁡{r1(θ)} and b=max⁡0≤θ≤2π{r2(θ)}.


## 2.2. Computational Formulations

Given a functionv(x) defined on the interval [c,d] and discrete nodes c=x1<x2<⋯<xn=d, the function values on the nodes are vi=v(xi),i=1,2,…,n. The barycentric Lagrange interpolation of the function v(x) on the nodes is [24]
(4)v(x)=∑j=1n(wj/(x-xj))vj∑j=1n(wj/(x-xj)),
where wj=1/∏j≠k(xj-xk),j=0,1,…,n, is barycentric interpolation weight.The barycentric Lagrange interpolation basis function is defined as follows:(5)Lk(x)=wk/(x-xk)∑j=0n(wj/(x-xj)),k=1,2,…,n.
Then, barycentric Lagrange interpolation of the function v(x) can be written as
(6)v(x)=∑j=1nLj(x)vj.
The mth order derivative of function v(x) can be expressed as
(7)v(m)(x):=dmv(x)dxm=∑j=1nLj(m)(x)vj.
So the mth order derivative of function v(x) in the nodes x1,x2,…,xn is
(8)v(m)(xi)=∑j=1nLj(m)(xi)vj=∑j=1nCij(m)vj,i=1,2,…,n,
where Cij(m)=Lj(m)(xi) indicates the mth order derivative value of the jth basis function at ith node. Deriving (5) with respect to x directly, we have
(9)Cij(1)=wj/wixi-xj,j≠i,Cii(1)=-∑j=1,j≠inCij(1).
And the entries Cij(m) can be derived from the following recursion [25, 26]:
(10)Cij(m)=m(Cii(m-1)Cij(1)-Cij(m-1)xi-xj),i≠j,Cii(m)=-∑j=1,j≠inCij(m).As a result, (8) can be written in the following matrix form:
(11)v(m)=C(m)v.
In (11), v(m)=[v1(m),v2(m),…,vn(m)]T and v=[v1,v2,…,vn]T represent the column vector of mth order derivative value and the value of the function v(x) in the nodes, respectively. Matrix C(m) is named as the mth order differentiation matrix of barycentric Lagrange interpolation on nodes x1,x2,…,xn.Embedding the irregular computational regionΩ into a two-dimensional annular domain D={(r,θ):a≤r≤b,0≤θ≤2π},Ω⊂D, let m and n distinct computational nodes a=r1<r2<⋯<rm=b and 0=θ1<θ2<⋯<θn=2π be given in the direction of r and θ, respectively. We can obtain m×n computational nodes of tensor product type, (ri,θj),i=1,2,…,m,j=1,2,…,n, on the domain D. The denoted values of function u(r,θ) in the computational nodes are uij=u(ri,θj),i=1,2,…,m,j=1,2,…,n.The computational nodes and function values can be formed into threem×n-dimensional column vectors as follows:
(12)R=[r1,…,r1,r2,…,r2,…,rm,…,rm]T,Θ=[θ1,…,θn,θ1,…,θn,…,θ1,…,θn]T,U=[u11,…,u1n,u21,…,u2n,…,um1,…,umn]T.The barycentric Lagrange interpolation of the functionu(r,θ) in the computational nodes can be expressed as
(13)u(r,θ)=∑i=1m∑j=1nLi(r)Mj(θ)uij,
where Li(r),Mj(θ) are barycentric Lagrange interpolation basis function on the nodes r1,r2,…,rm and θ1,θ2,…,θn, respectively.From formula (13), (l+k)th partial derivative of the function u(r,θ) with respect to r and θ can be expressed as
(14)∂l+ku∂lr∂kθ=∑i=1m∑j=1nLi(l)(r)Mj(k)(θ)uij,l,k=0,1,2,….
The value of partial derivative in the computational nodes is
(15)upq(l+k):=∂l+ku(rp,θq)∂lr∂kθ=∑i=1m∑j=1nLi(l)(θq)uij,p=1,2,…,m;q=1,2,…,n.
By using the symbols of barycentric interpolation differential matrix C(l),D(k) and matrix tensor product, “⊗”, formula (15) can be rewritten as the matrix form
(16)U(l+k)=(C(l)⊗D(k))U,
where C(l),D(k) indicate lth and kth order barycentric Lagrange interpolation differential matrix in the nodes r1,r2,…,rm and θ1,θ2,…,θn, respectively. Denote C(0)=Im,D(0)=In. Im,In are mth and nth order identity matrix, respectively. U(l+k) is m×n-dimensional column vectors which is consisted of the values of partial derivative uij(l+k)=∂l+ku(ri,θj)/∂lr∂kθ in the nodes (ri,θj),i=1,2,…,m,j=1,2,…,n,
(17)U(l+k)=[u11(l+k),…,u1n(l+k),u21(l+k),…,u2n(l+k),…,um1(l+k),…,umn(l+k)]TBy formula (16), the discrete formula of the Poisson equation (1) can be rewritten as
(18)[(C(2)⊗In)+(1R)(C(1)⊗In)+(1R2)(Im⊗D(2))]U=F.Here,1/R=diag⁡(1/r1,1/r2,…,1/rm)⊗In,1/R2=diag⁡(1/r12,1/r22,…,1/rm2)⊗In; diag is diagonal matrix which is consisted of vector; F=f(r,θ). Equation (18) can be simplified into
(19)LU=F.The boundary conditions (2)-(3) can be discretized by barycentric Lagrange interpolation (13). We arrange m1,m2 points (rib1,θib1),i=1,2,…,m1,(rib2,θib2),i=1,2,…,m2, on the boundaries Γ1,Γ2, respectively. In general, we need m1≥max⁡(m,n),m2≥max⁡(m,n). Hence, boundary conditions (2)-(3) can be interpolated as follows:
(20)u(rib1,θib1)=∑i=1m∑j=1nLi(rib1)Mj(θib1)uij=g1(θib1),∑i=1m∑j=1nLi(rib1)Mj(θib1)uiji=1,2,…,m1,u(rib2,θib2)=∑i=1m∑j=1nLi(rib2)Mj(θib2)uij=g2(θib2),∑i=1m∑j=1nLi(rib2)Mj(θib2)uiji=1,2,…,m2.
Formula (20) can be simplified into
(21)B1U=G1,B2U=G2.For numerical analysis in doubly connected domain, we need some additional conditions to ensure the single-valuedness and smoothness of functionu(r,θ). The additional conditions can be expressed as follows:
(22)u(r,0)=u(r,2π),uθ(r,0)=uθ(r,2π).The first and second conditions in (22) guarantee the single-valuedness and smoothness of function u(r,θ), respectively. Defining two index sets S0={k:Θk=0},S1={k:Θk=2π}, let ImnSi represent a matrix whose rows come from the rows of the (m×n) order identity matrix in accordance with the index set Si(i=1,2); that is, ImnSi=Imn(Si,:), and PmnSi denote a matrix whose rows extract from the rows of the (m×n) matrix Im⊗D(1), in accordance with the index set Si(i=1,2). Using notations defined as above, the additional conditions (22) can be discretized as follows:
(23)(ImnS0-ImnS1)U=0,(PmnS0-PmnS1)U=0.
Equation (23) can be rewritten as
(24)A1U=0,A2U=0.Owing to the additional conditions discretized on the computational nodes, we can use replacement method to apply the additional conditions [25–27]. The rows with index set S0 in matrix L in (19) are replaced by rows of matrix A1, and components with index set S0 in vector F are set to be zeros. The rows with index set S1 in matrix L in (19) are replaced by rows of matrix A2, and components with index set S1 in vector F are set to be zeros. Then, (19) modifies as
(25)L~U=F~.Combining (25) and (21), we obtain a saddle point system:
(26)(L~B1B2)U=(F~G1G2).Using least square method to solve (26), the function value will be gained on the regular domain D. Then, barycentric Lagrange interpolation formula (13) is used to compute the function value in any points on the complex region Ω.


## 3. Numerical Results

In this section, we present some numerical experiments to verify the methods developed in the earlier sections. The method is validated by employing exact solutions with known boundary conditions and evaluating the computational errors. The computational programs compile using Matlab. The overconstrained equation (22) is solved by backslash operator, “∖”, in Matlab.In numerical analysis, the second kind Chebyshev points on the interval[-1,1] [26, 27], tk=-cos⁡(kπ/n),k=0,1,2,…,n, are adopted as type of computational nodes. Let x=(b+a)/2+t(b-a)/2; then, the Chebyshev point tk on the interval [-1,1] can be transformed as computational nodes xk on the arbitrary interval [a,b]. For the assessment of computational accuracy and the beauty of drawing, 1000 points are arranged on the domain Ω and their function value is calculated by the barycentric Lagrange interpolation. The absolute error and relative error of numerical computation are defined, respectively, as
(27)Ea=∥Uc-Ue∥∞,Er=∥Uc-Ue∥2∥Ue∥2,
where Uc, Ue are vectors of numerical computational values and analytical solution, respectively.Example 1.
Consider the doubly connected domain composed of two concentric circles. The radii of internal and external circles arer1=0.5 and r2=2, respectively. This is a regular domain. Boundary conditions are determined by analytical solution u(r,θ)=50+50ln⁡r/ln⁡2. In this case, f(r,θ)=0.
The absolute error and relative error with the different number of computational nodes in radial and ring direction are listed in Table1. Due to the fact that the solution is independent of the variable θ, the nodes number in ring direction does not affect the computational errors. It can be seen from Table 1 that when the nodes number in radius direction is increased, the computational errors are decreased. Figure 2(a) shows the relations of nodes number and computational errors with Chebyshev points. For comparison, we solve this problem under equidistant points, whose relations of nodes number and computational errors are shown in Figure 2(b). It can be seen from Figure 2 that the numerical accuracy of the Chebyshev points is higher than the equidistant points. When the nodes number is larger, we find that the solution is unstable using equidistant nodes.Table 1
Computational error of regular domain collocation method under different number of nodes in Example1.
m
n
Absolute error
Relative error
9
15
8.5738
×
10
-
4
4.9203
×
10
-
6
9
21
8.5738
×
10
-
4
4.9203
×
10
-
6
11
15
6.5263
×
10
-
5
3.4685
×
10
-
7
11
21
6.5263
×
10
-
5
3.4685
×
10
-
7
15
15
4.3571
×
10
-
7
2.1605
×
10
-
9
19
15
4.1151
×
10
-
9
1.6389
×
10
-
11
23
15
4.0905
×
10
-
9
7.5697
×
10
-
1
2
31
15
6.2059
×
10
-
9
1.6639
×
10
-
11The relations of nodes number and computational errors with different types of nodes. (a) Chebyshev point; (b) equidistant nodes.
(a)
(b)Example 2.
Consider the doubly connected domain composed of the kite external curver=(0.6cos⁡θ+0.3cos⁡2θ-0.2)2+(0.6sinθ)2 and the bean internal curve r=(0.5+0.2cos⁡θ+0.1sin2θ)/(1.5+0.7cos⁡θ). The radii of internal and external circles are a=0.2 and b=0.9, respectively, as shown in Figure 3.
Boundary conditions are determined by analytical solutionu(r,θ)=r2cos⁡2θ. In this case, f(r,θ)=0. On regular region and doubly connected domain, the distribution of the compute nodes is shown in Figure 4.
The absolute error and relative error with the different number of computational nodes in radial and ring direction are listed in Table2. From Table 2, adopting 9 radial nodes and 31 circular nodes, the absolute error and relative error reach 10-12 orders of magnitude. The calculation accuracy of the proposed method is very excellent. If we increase the number of computational nodes, the calculation accuracy still remains the high precision. The distribution of absolute error on the computing node is shown in Figure 5. Figure 6 depicts the image of numerical solutions on irregular domain.
In another highly accurate numerical method, the collocation Trefftz method, the absolute error ofu is 10-12 orders of magnitude through 546 iterations under parameter m=15 and a stopping criterion 10-15 [14]. The numerical precision of the proposed method in this paper is the same as the highly accurate collocation Trefftz method.Table 2
Computational error of regular domain collocation method under different number of nodes in Example2.
m
n
Absolute error
Relative error
9
15
1.4678
×
10
-
3
8.2523
×
10
-
4
9
21
8.5082
×
10
-
8
4.6690
×
10
-
8
9
31
7.0509
×
10
-
12
3.6625
×
10
-
1
2
9
41
2.1288
×
10
-
11
1.0692
×
10
-
11
11
15
9.2872
×
10
-
4
5.8960
×
10
-
4
11
21
2.6053
×
10
-
7
1.3558
×
10
-
7
11
31
7.0704
×
10
-
11
3.0779
×
10
-
11
11
41
5.400
×
10
-
11
3.1968
×
10
-
11Figure 3
The doubly connected domain and its regular domain in Example2.Distribution of computational nodes on regular and doubly connected domains in Example2. (a) Distribution of computational nodes; (b) distribution of interpolating nodes in postprocessing.
(a)
(b)Figure 5
The error distribution of nodes using regular domain collocation method in Example2.Figure 6
The image of numerical solutions on irregular domain in Example2.Example 3.
Consider the doubly connected domain composed of the epitrochoid external curver=26-10cos⁡4θ and the bean internal curve r=(2.5+cos⁡θ+0.5sin2θ)/(1.5+0.7cos⁡θ). The radii of internal and external circles are a=1.25 and b=6, respectively, as shown in Figure 7.
Boundary conditions are determined by analytical solutionu(r,θ)=ercos⁡θcos⁡(rsinθ). In this case, f(r,θ)=0. Adopting 16 radial nodes and 61 circular nodes, the absolute error and relative error are 1.0008×10-5 and 6.2942 × 10−8, respectively. The distribution of the compute node error is shown in Figure 8. Figure 9 depicts the image of numerical solutions on irregular domain.Figure 7
The doubly connected domain and its regular domain in Example3.Figure 8
The error distribution of nodes using regular domain collocation method in Example3.Figure 9
The image of numerical solutions on irregular domain in Example3.Example 4.
Consider the eccentric annular region composed of the external eccentric circler=cos⁡θ+cos⁡2θ+21/4 and the internal circumference r=1. The radii of internal and external circles area=1 and b=3.5, respectively, as shown in Figure 10.
Boundary conditions are determined by analytical solutionu(r,θ)=r2(cos⁡2θ+sin2θ). In this case, f(r,θ)=0. Adopting 9 radial nodes and 31 circular nodes, the absolute error and relative error reach 1.0233 × 10−9 and 3.7942 × 10−11 order of magnitude, respectively. The distribution of the compute node error is shown in Figure 11. Figure 12 depicts the image of numerical solutions on irregular domain.Figure 10
The doubly connected domain and its regular domain in Example4.Figure 11
The error distribution of nodes using regular domain collocation method in Example4.Figure 12
The image of numerical solutions on irregular domain in Example4.Example 5.
Consider the doubly connected domain composed of the external ellipsex2/100+y2/64=1 and the internal ellipse x2/25+y2/4=1. The radii of internal and external circles area=2 and b=10, respectively, as shown in Figure 13.
Boundary conditions are determined by analytical solutionu(r,θ)=4r2cos⁡2θ+3r2cos⁡θsinθ-2rsinθ+8. In this case, f(r,θ)=8. Adopting 11 radial nodes and 31 circular nodes, the absolute error and relative error reach 5.6604 × 10−8 and 4.1297 × 10−11 order of magnitude, respectively. The distribution of the compute node error is shown in Figure 14. Figure 15 depicts the image of numerical solutions on irregular domain.Figure 13
The doubly connected domain and its regular domain in Example5.Figure 14
The error distribution of nodes using regular domain collocation method in Example5.Figure 15
The image of numerical solutions on irregular domain in Example5.


## 4. Conclusions

Regular domain collocation method is an effective method to solve the potential problem on doubly connected domain of complex boundary and has the very high calculation precision. Barycentric interpolation collocation method can be applied to solve the boundary value problem of differential equations on irregular region by regular domain collocation method. So the application scope of barycentric interpolation collocation method is expanded.The key problem is how to discrete and impose boundary conditions in the regular domain collocation method. Using barycentric Lagrange interpolation method, a stabilized, high-precision interpolation method, we can accurately and conveniently discretize boundary conditions on irregular boundary. Numerical calculation indicates that if the boundary point is less than the maximum of the radial nodes and circular nodes, the resulting coefficient matrix of algebraic equation is not column full rank. As a result, we cannot get numerical solution.Regular domain collocation method proposed in this paper can be directly applied to solve the differential equation boundary value problem on the irregular simply connected region.



---

*Source: 397327-2014-04-23.xml*