The interpolating boundary element-free method (IBEFM) is developed in this paper for boundary-only analysis of unilateral problems which appear in variational inequalities. The IBEFM is a direct boundary only meshless method that combines an improved interpolating moving least-square scheme for constructing interpolation functions with boundary integral equations (BIEs) for representing governing equations. A projection operator is used to formulate the BIEs and then the formulae of the IBEFM are obtained for unilateral problems. The convergence of the developed meshless method is derived mathematically. The capability of the method is also illustrated and assessed through some numerical experiments.

1. Introduction

In the past two decades, considerable research effort in the field of computational science and engineering has been directed, both on theoretical and practical bases, into meshless (or meshfree) methods. Compared with the finite element method (FEM) and the boundary element method (BEM), meshless methods eliminate the difficulty of meshing and remeshing the considered computational structure via simply adding or deleting scattered nodes. The moving least square (MLS) [1] is an approximation scheme, which generates continuous functions from unorganized sampled point values. Since the numerical approximation of the MLS starts from scattered nodes instead of meshes, there have many meshless methods based on the MLS scheme. Among them are the diffuse element method, the element-free Galerkin (EFG) method, the h-p meshless method, the meshless local Petrov-Galerkin method, and so on. These meshless methods followed the idea as the FEM, in which the problem domain is discretized.

Boundary integral equations (BIEs) are important and attractive computational tools as they can reduce the dimensionality of the considered problem by one. The MLS scheme has also been used in BIEs. Typical of them are the meshless local boundary integral equation (LBIE) method and the boundary node method (BNM) [2]. These BIEs-based meshless methods have emerged as promising numerical techniques in scientific computing. Nonetheless, since the MLS approximations lack the delta function property, boundary conditions in these meshless methods are difficult to be implemented. The technique used in the BNM doubles the number of both unknowns and system equations. Via combining a variational form of BIEs and the MLS scheme, another technique is developed in the symmetric Galerkin BNM to impose boundary conditions [3, 4]. However, in all these BIEs-based meshless methods, the basic unknown quantities are approximations of nodal variables, and therefore they are indirect methods. Recently, Cheng et al. [57] developed an improved MLS scheme that uses weighted orthogonal polynomials as basis functions. The improved MLS scheme has been introduced into BIEs to develop a direct meshless method, the boundary element-free method (BEFM) [5, 6, 8, 9]. Because the improved MLS scheme still lacks the delta function property, boundary conditions in the BEFM are implemented with constraints.

To avoid the shortcomings of the MLS scheme, Liu and Gu proposed the point interpolation method (PIM) [10] and the radial PIM [11] to construct meshless shape functions. The PIMs have also been used in BIEs. Among them are the boundary PIMs [1214], the hybrid boundary PIMs [15], and the hybrid radial BNM [16, 17]. These meshless methods can exactly satisfy boundary conditions, since their shape functions possess delta function property.

To restore the delta function property of the MLS scheme, Lancaster and Salkauskas [1] further developed an interpolating moving least-square (IMLS) scheme that uses specific singular functions as weight functions. By revising the formula of the IMLS and combining it with BIEs, Ren et al. [18, 19] developed an interpolating boundary element-free method (IBEFM) for 2D problems in potential theory and linear elasticity. In these improved methods, boundary conditions can be imposed with ease. A drawback of the IMLS scheme is that the involved weight function is singular at nodes. The singularity complicates the calculation of the inverse of the singular matrix and thus reduces the computing speed and efficiency.

To overcome the problems in both the MLS scheme and the IMLS scheme, Wang et al. [20, 21] proposed an improved interpolating moving least-square (IIMLS) scheme, an improved interpolating EFG method, and an IBEFM for 2D potential problems. In [22], Li discussed theoretically the properties of the IIMLS shape functions, studied the curve and surface fitting capability of the IIMLS scheme, and extended the IBEFM for 3D potential problems. Compared with the MLS scheme, the IIMLS scheme has the following features. Firstly, its shape function possesses the delta function property, so imposing boundary conditions in the IIMLS-based meshless method is much easier than that in the MLS-based meshless method. Secondly, the weight function used is nonsingular at any point; hence, any weight function used in the MLS scheme can also be used in the IIMLS scheme. Thirdly, the number of unknown coefficients in the trial function of the IIMLS scheme is less than that of the MLS scheme; thus, fewer nodes are required in the influence domain and a higher computational accuracy can be achieved in the IIMLS scheme.

In the theory of variational inequalities [23, 24], a wide class of problems arising in industry, finance, economics, social, pure, and applied sciences give rise to the unilateral problem. The numerical solution of this problem has been frequently dominated by the FEM [2528]. In the unilateral problem, the inequality boundary conditions are nonlinear and complementary ones which modeled threshold phenomena like contact problem, thermostatic device, or semipermeable membranes. As the inequality conditions lie on the unilateral contact boundary and this boundary is of prime interest, BIEs-based methods are ideally suited for the numerical solution. Some applications of the BEM for unilateral problems can be found in [2936].

The present paper develops and employs the IBEFM for boundary-only analysis of unilateral problems. Using a projection operator, the unilateral problem is reacted as a sequence of well-posed bilateral problems. Then, the IBEFM is used iteratively for solving bilateral problems. As a result, only the boundary of the problem domain is discretized by properly scattered nodes. The convergence of the developed meshless method is also derived mathematically.

The following discussion begins with the brief description of the IIMLS scheme in Section 2. In Section 3, a detailed numerical implementation of the IBEFM for unilateral problems is presented. The convergence of this method is included in the next section. Then, numerical results are given in Section 5. Section 6 contains conclusions.

2. The IIMLS Scheme for the IBEFM

Consider a two-dimensional domain bounded by its boundary . In boundary-type meshless methods, only is represented using boundary nodes. The IIMLS scheme in this paper is independently generated on piecewise smooth segments which constitute the boundary naturally. Consequently, the problem of the discontinuity at corners can be avoided.

Let be a given set of basis functions with , where is a curvilinear coordinate on . Before generating shape functions with delta function property, we first construct the following basis functions: where is the coordinate of an evaluation point on , are boundary nodes with influence domains that cover the point , and the point can be either the evaluation point or a nodal point . The function is taken such that Similar to the function used in [20, 21], this function is defined by where may denote any norm, but for reasons of differentiability it is natural to use the Euclidean norm.

For any , to obtain the IIMLS scheme for a given function , we define a new function as where and .

In (1) letting , then using (2), we have . Thus, the local approximation of at can be defined as where and .

The coefficient vector is obtained by minimizing a weighted discrete norm defined as where are weight functions and are unit row vectors with the th component being 1.

The stationarity of with respect to yields where Inserting (7) into (5) yields the local approximation Setting , then from (4) and (9), the global approximation of is where are the IIMLS shape functions, and are defined by (1) as

To generate the IIMLS shape functions, the moment matrix needs to be invertible. As in the MLS scheme [3, 4], a necessary condition for the invertibility of is that there are at least nodes covered in the influence domain of the point . Besides, (5) indicates that the number of the unknown coefficients in the IIMLS scheme is fewer than that in the MLS scheme. As a result, fewer nodes can be chosen in the meshless method formed with the IIMLS scheme compared to that formed with the MLS scheme. Moreover, compared with the IMLS scheme developed in [1, 18, 19], any weight function used in the MLS scheme can also be used in the IIMLS scheme.

We list below some propositions of the IIMLS shape function . The detailed mathematical proof can be found in [22].

Proposition 1. The influence domain of the node is the compact support of , .

Proposition 2. is of delta function properties as

Proposition 3. is of reproducing properties as where is the given basis function.

3. The IBEFM for Unilateral Problems

We consider the unilateral problem in the bounded domain with a smooth boundary . Let , and be mutually disjoint parts of such that , and . Given and , we want to find the solution satisfying where is the normal derivative of and is the unit outward normal to .

We introduce the Sobolev space and the convex cone of admissible functions which satisfy the noninterpenetration on the unilateral contact boundary : Then the unilateral problem (15)-(16) is equivalent to the following variational inequality over [27]: It was proved in [30] that this variational inequality admits a unique solution if and only if or . Besides, let then from Green’s formula it follows that variational inequality (18) may equivalently be formulated as the following boundary variational inequality on : Obviously, the unilateral problem (15)-(16) and variational inequalities (18) and (20) are equivalent.

In the unilateral problem (15)-(16), the inequality boundary conditions (16) are nonlinear and represent the contact with an unilateral boundary obstacle given by the function . In such problems, we need to determine the parts of on which conditions and apply and its remaining parts on which conditions and apply.

The purpose of this paper is to develop a meshless method for the numerical solution of the unilateral problem (15)-(16), but difficulties arise in the implementation of the unilateral contact conditions (16). To tackle this issue, we define the projection operator by [23, 24, 32, 37] It can be easily verified that the inequality boundary conditions (16) are equivalent to the following condition: where is an arbitrary but fixed positive constant. Then, we define an implicit iterative scheme on as As in [32, 37], the unilateral problem is therefore converted into a sequence of well-posed bilateral problems with straightforward boundary conditions. And then, the IBEFM is used to solve these problems. For this purpose, we check the boundary conditions on . If on some parts of , denoted as , inequality is true, then the boundary condition is imposed as for the next iteration. On the remaining parts of , denoted as , the boundary condition is imposed as Equations (15), (25), and (26) compose the following well-posed bilateral problem: In the following, problem (27) is solved by the IBEFM to obtain and on .

The BIE for the solution of (27) is [38] where is the field point, is the source point, and are fundamental solutions, and is the function of the internal angle that the boundary makes at the point .

From the expression of the approximation function (10), we let where is the number of nodes on the boundary , , , and is the contributions from the boundary node to the evaluation point . In the influence domain of the th node, is the meshless shape function given by (11) and is not equal to zero. Otherwise, is equal to zero.

Substituting (29) into (28) for all boundary nodes yields Thus, we have the following linear algebraic equations: where , , and and are the corresponding coefficient matrices.

To obtain the unknowns at boundary nodes, boundary conditions needed to be imposed. For the convenience of discussion, we assume that the first boundary nodes belong to , the next boundary nodes belong to , and the rest boundary nodes belong to . Then by applying the boundary conditions given on and , we can rewrite (31) as the following block form: where and are given, and , , , and are unknown. Besides, collocating the Robin boundary conditions (26) at nodes yields where . It can be expressed as where with . Substituting (34) into (32) and taking all unknowns to the left side lead to the following linear algebraic equations: Solving (35), we can obtain unknowns , , and . Then inserting into (34), the unknown can be obtained directly.

The IBEFM flow chart for the unilateral problem (15)-(16) can be concluded as follows.

Algorithm 4. Choose a tolerance and set .(1)Select nodes on boundary and compute shape functions.(2)Assume initially that the boundary condition on the unilateral boundary is and then (15) and (36) compose a well-posed problem and are solved together by the IBEFM to obtain on .(3)Determine and by checking the boundary conditions on and then form the boundary value problem (27).(4)Obtain the linear algebra equations (35).(5)Solve (35) and (34) to obtain and for all nodes .(6)Compute the relative error (7)Stop the algorithm if . Otherwise, update to and go to .

In this paper, the allowable tolerance used is . Stop condition of determines the number of iterations.

4. The Convergence of the Developed Meshless Algorithm

The mathematical proof of convergence of some mesh-based numerical algorithms has been established [23, 24, 28, 30, 32, 35]. In this section, a convergence study of the proposed meshless algorithm is carried out.

Lemma 5. Let be the exact solution of the unilateral problem (15)-(16), and let be the sequence generated by Algorithm 4, and then where the duality is defined for functions and as , and the norm is defined as .

Proof. Using Green’s formula leads to Thus applying (16) and (23) yields Therefore,
On the other hand, if on , then (23) indicates ; thus and using yields Otherwise, if on , then applying (23) leads to Briefly, we have Consequently, which completes the proof.

Theorem 6. Under the conditions of Lemma 5,

Proof. According to (39), we obtain Then invoking (38) yields which indicates Besides, the sequence is bounded and Thus, is a Cauchy sequence.
Let be the cluster point of the sequence and the subsequence of converges to , and then satisfies (22). Since (16) and (22) are equivalent, is a solution of the unilateral problem (15)-(16).
In order to prove that is the unique cluster point of , we now assume that is another cluster point and let Because is the cluster point, there exists a positive integer such that Then, for any , applying (51) leads to So, which implies Consequently, the sequence has only one cluster point, and thus we conclude that converges to the exact solution of the unilateral problem (15)-(16).

Theorem 6 indicates that the developed meshless method generates a sequence of strongly convergent approximations.

5. Numerical Experiments

5.1. Spann Problem

In [30], Spann constructed a test problem in an annular domain with an explicitly known solution. The exact solution is where

In this problem, Dirichlet boundary conditions are imposed on the outer circle corresponding to the exact solution, and unilateral boundary conditions are imposed on the inner circle as where and

As in [30], the parameters are chosen as and in computation. Our discretization includes 64 boundary nodes on each circle. The exact solution and the numerical solution for on the unilateral contact boundary are presented in Figure 1. The results for are presented in Figure 2. In these figures, we use the parameterization . From these figures, we can see that the numerical solutions are in excellent agreement with the exact solutions.

To study the convergence, the relative error norms of on obtained by the IBEFM are plotted in Figure 3 in log-log scale. In this figure, the results of the Galerkin boundary element method (GBEM) [30], the boundary element-linear complementary method (BE-LCM) [34], and the boundary element-projection iterative method (BE-PIM) [35] are also given for comparison. It is shown that the error of the IBEFM is the least. Besides, the convergence rate obtained from the GBEM, the BE-LCM, the BE-PIM, and the IBEFM is found to be 1.11, 1.01, 1.84, and 2.00, respectively.

The corresponding number of iterations is shown in Table 1, from which we can see that the number of iterations of the IBEFM and the BE-PIM is little influenced by the number of boundary nodes and is less than that of the GBEM and the BE-LCM. Besides, Table 2 gives the corresponding CPU times. We can find that CPU times of the IBEFM are less than both the BE-LCM and the BE-PIM. As a result, the computing speed and efficiency of the IBEFM are higher than those of the GBEM, the BE-LCM and the BE-PIM.

5.2. Groundwater Flow Problem

The problem solved here is a groundwater flow problem related to percolation in gently sloping beaches [25]. This problem can be formulated as a free boundary problem for the pressure. In the saturated region, the pressure is a harmonic function satisfying or where is a known function depicting the surface profile. Clearly, the numerical solution of this problem relies on .

We consider two cases of surface profiles given in [25, 30]

The numerical results are plotted in Figure 4. In this analysis, 32 boundary nodes are used to discretize per side of the domain. The first profile yields only one separation point, while the second profile yields four separation points. There are no exact solutions available in the literature to verify the developed meshless method for such a complex problem. However, we can observe that the results are in good agreement with those given in [25, 30].

In order to investigate the convergence of the IBEFM, the problem is solved by choosing different numbers of boundary nodes. Since the exact solution of the problem is not known, the error is estimated by substituting the exact solutions with some selected approximate values which can be computed by more boundary nodes. In this work, we obtain these approximate values by using 4096 boundary nodes. Figure 5 plots the log-log plot of the relative error norms of on with respect to the number of nodes. It can be seen that, as the number of nodes increases, the error becomes smaller. Besides, the experimental convergence rate for and is 2.02 and 2.15, respectively. Therefore, the experimental convergence rate is very high and approximate to 2.

6. Conclusion

A novel boundary-type meshless method, the IBEFM, is developed in this paper for solving unilateral problems arising from variational inequalities. The IBEFM is based on BIEs discretized with the IIMLS scheme that only uses a group of arbitrarily distributed boundary nodes. In this numerical algorithm, the nonlinear inequality boundary conditions are incorporated into the iterative scheme naturally, and boundary conditions can be imposed with ease. Convergence proof of this meshless method has been provided mathematically. The proof shows that this method generates a sequence of strongly convergent approximations.

Some numerical examples have been given to validate the capacity of the method. For all examples, a convergent solution has been gained. The numerical results have verified the accuracy, convergence and effectiveness of the IBEFM. The experimental convergence rate is very high and approximate to 2. The errors and CPU times were compared to those obtained by the BEMs. These comparisons show that the IBEFM provides monotonic convergence and high accuracy results with low computational expenses.

Initial numerical results from the IBEFM, applied to 2D unilateral problems, are encouraging. The numerical experiments indicate that the developed meshless method has not only the higher convergence rate and computational precision but also the less CPU times than the BEMs presented in [34, 35]. Besides, due to its considerable flexibility in mesh generation and relative ease in implementation, this method has tremendous potential for efficiently solving 3D problems and problems with complex domains to take the full advantages of the meshless concept. Nevertheless, more research work is required.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.


This work was supported by the National Natural Science Foundation of China under Grant no. 11101454, the Educational Commission Foundation of Chongqing of China under Grant no. KJ130626, the Natural Science Foundation Project of CQ CSTC under Grant no. cstc2013jcyjA30001, and the Program of Chongqing Innovation Team Project in University under Grant no. KJTD201308.