# Element-Free Galerkin Method Based on Block-Pulse Wavelets Integration for Solving Fourth-Order Obstacle Problem

Authors: Muhammad Azam; Khalid Parvez; Muhammad Omair
Journal: Journal of Applied Mathematics
 (2013)

---

## Abstract

We introduce improved element-free Galerkin method based on block pulse wavelet integration for numerical approximations to the solution of a system of fourth-order boundary-value problems associated with obstacle, unilateral, and contact problems. Moving least squares (MLS) approach is used to construct shape functions with optimized weight functions and basis. Numerical results for test problems are presented in this article to elaborate the pertinent features for the proposed technique. Comparison with existing techniques shows that our proposed method based on integration technique provides better approximation at reduced computational cost.


---

## Body

## 1. Introduction

Variational inequality theory has turned out to be an effective and potential tool for solution of mathematical models for obstacle, unilateral and contact problems. These problems arise in study of fluid flow through porous media, elasticity, transportation, optimal control, nonlinear optimization, and operations research [1–4]. The area of obstacle problems arising in fluid flow through porous media and elasticity forms an significant basis for the applications of variational inequalities. It has been revealed by Kikuchi and Oden [5] that the problem of equilibrium of elastic bodies in contact with a rigid frictionless foundation can be studied in the structure of variational inequalities. In a variational inequalities formulation, the location of the free boundary becomes an intrinsic part of the solution, and no special techniques are needed to locate it. Various numerical methods were employed to solve such type of problems [1–4]. If the obstacle is known, then the variational inequalities can be characterized by a system of differential equations by using the penalty function method of Lewy and Stampacchia [6]. In this paper, we apply element-free Galerkin method based on block pulse functions to develop a numerical method for obtaining smooth approximations to the solution of a system of fourth-order obstacle boundary-value problems of the type as follows:
(1)u(4)={f(x),a≤x≤c,g(x)u(x)+f(x)+r,c≤x≤d,f(x),d≤x≤b.
With boundary conditions, consider
(2)u(a)=u(b)=α1,u′′(a)=u′′(b)=α2,u(c)=u(d)=β1,u′′(a)=u′′(b)=β2,
where f and g are continuous functions on [a,b] and [c,d], respectively. The parameters r, αi, and βi (i=1,2) are real constants and the continuity conditions of u,u′′ at c and d.This problem was solved by many authors using different order of polynomial and nonpolynomial spline. Papamichael and Worsey [4] and Khalifa and Noor [3], have developed first- and second-order methods for solving such type of boundary value problems. Siraj-ul-Islam et al. [7] have established and analyzed smooth approximations for second, third, and fourth order linear/nonlinear boundary-value problems.Galerkin-finite element method is one of the most popular well-developed methods, has been extensively used in the computational mechanics, due to its robustness, versatility, and convenience. However, the finite element method has inherent problems such as locking and poor derivative solutions [8]. FEM requires considerable amount of labor and time in generation of a predefined mesh/remesh of the problem domain. In structural analysis, the stresses calculated employing FEM algorithms are discontinuous and less accurate. When large deformations are analyzed, distortions in elements cause loss in solution accuracy in the case of large deformations [9]. Other numerical techniques such as the BEM (boundary element method) is limited by the availability of the infinite space fundamental solution for (at least the highest linear) differential operator of the problem.The physical phenomena modeled by fourth-order obstacle boundary value problems are complicated, particularly, when they involve complex materials (e.g., viscoelastic materials with poisson ratio nearly 0.5) and where load is highly oscillatory. In conventional displacement-based approaches like finite element method (FEM), the interpolation of displacement requiresc1 continuity to ensure the convergence of FEM procedure for 4th order boundary value problems. This interpolation involves very intricate shape functions. These shape functions occupy large number of degrees of freedom in every element, including nodal rotations, displacement and so forth. For detailed discussion for solving such problems, the reader is referred to works [10] and references therein.Improved element-free Galerkin (EFG) method provides an alternative choice of numerical tools which presents an attractive option in solution of such problems due to its flexibility in the absence of nodal interconnectivity. A meshfree (or meshless) method is a method used to establish system algebraic equations for the whole problem domain without the use of a predefined mesh for the domain discretization [9]. Several meshless techniques have been developed, for example, the “diffuse element method” [11] the “element-free Galerkin (EFG)” method [12] “meshless local Petrov-Galerkin (MLPG)” method [8], the “smooth particle hydrodynamics (SPH)” method, the “reproducing Kernel particle” method [13] “boundary node” method [14, 15] “boundary point interpolation” methods [16] and so forth [8].


## 2. Numerical Technique

Meshfree method has been applied to physical problems using Gaussian weight function. Moving least square method is used to generate the shape functions. Galerkin weak form of the boundary value problem is formulated to give the system equations. Penalty/Lagrange method is used to impose the boundary conditions. Numerical integration of the system equation has been performed using block-pulse function.


### 2.1. Meshless Shape Function

Shape functions for meshless techniques need to satisfy certain conditions such as adherence to partition of unity (∑i=1nΦI(x)=1), compact domain of influence, and adapting to randomness of nodes, to name a few. Computational efficiency is significantly affected by choice of shape function.MLS. Moving least square (MLS) scheme was developed by mathematicians for interpolation, data fitting, and surface construction. Meshless techniques maintain the local character of the numerical implementation, by using a local interpolation to represent the trial function with the fictitious values of the unknown variable at some randomly located nodes. The local interpolation techniques generally used are MLS, partition of unity method, reproducing kernel particle method, hp clouds, Shepard function, and so forth. The moving least squares (MLSs) approximation has reasonably high accuracy and can be generalized to work with n-dimensional problems. It provides continuous approximation for the field function over the entire problem domain [9, 17].Here, moving least square (MLS) scheme is considered to interpolate the field variable. MLS approximationuh(x) of a field variable function u(x) is defined as
(3)uh(x)=∑j=0mpj(x)aj(x)=pT(x)a(x)∀x∈Ω,
where m = number of terms in the basis, pj(x) = polynomial basis function,  aj(x) = nonconstant coefficients, and pT(x)=[p1(x),p2(x),…,pm(x)].p
T
(
x
) is a complete monomial basis vector of order m; a(x) is a vector containing coefficients: aj(x), j=1,2,3,…,m. The unknown coefficients of approximation are computed by minimizing the difference between the local approximation at a point xI and the nodal parameter uI for the node I: uI=u(xI).Here the sample pointxI may be a nodal point under consideration or a quadrature point. The support of the nodal point xI is usually taken to be a circle of radius rI, centered at xI. The weighted residual functional is evaluated as
(4)J=∑i=1nw(x-xI)(uh(x)-uI)2,
where w(x-xI) is weight function associated with the node I calculated at point x. w(x-xI)>0 for all points x in the support domain of node I, and
(5)uh(xI)=pT(xI)a(x).
Minimization of weighted residual functional results in
(6)A(x)a(x)=B(x)u,
where A(x) is a non-singular matrix.
(7)a(x)=A-1(x)B(x)u,u=[u1,u2,…,un]T.
The weight moment matrix A(x) is
(8)A(x)=PTWP=∑i=1nw(x-xI)p(xI)pT(xI),B(x)=PTW,
where P is
(9)P=[pT(x1)pT(x2)⋯pT(xn)]W is the weight function matrix:
(10)W=[w(x-x1)⋯0⋮⋱⋮0⋯w(x-xn)].
The following Gaussian weight function is used in the present study:(11)w(x-xI)=exp(-αc(x-xI)2).
Shape perimeter (αc) substantially affects the accuracy of the solution. Weight function for different values of shape parameters and its derivatives are illustrated in Figures 1 and 2 respectively.Figure 1
Weight function in the support domain.Figure 2
Derivatives of weight function in the support domain.Obtain valuea(x) from (7), and substituting in (5)
(12)uh(x)=ΦT(x)·u=∑I=1nϕ(xI)uI∀x∈Ω,Φ(x) is the nodal shape function
(13)Φ(x)=[ϕ1(x),ϕ2(x),…,ϕn(x)].
For any node I,
(14)ΦI(x)=pT(x)(A(-1)(x)B(x))I.
Transform the strong form of obstacle boundary value problems into symmetric variational or weak form as follows:
(15)∫ab(a(x)d4udx4+g(x)u(x)-f(x))vdx=0,
where u is the trial function and v is the test function. We get the following linear equation system after employing “Integration by parts” technique and by using the shape functions and boundary conditions
(16)∫ab(a(x)Φ′′(Φ′′)T+k(x)ΦΦT)dxu^=∫abfΦdx,Ku^=F,K=∫ab(a(x)Φ′′(Φ′′)T+k(x)ΦΦT)dx,F=∫abfΦdx.
Solving the system of equation, we get that u^ nodal fictitious values are obtained. Required numerical solution can be determined by multiplication of nodal fictitious values and shape functions Φ:
(17)u=u^Φ.


### 2.2. EFG

Element-free Galerkin (EFG) technique was introduced by Belytschko et al. [12]. EFG results in generation of nodes with variable interconnectivity, thus providing huge flexibility in discretization. Solution is expanded on a basis of MLS shape functions instead of piecewise polynomial basis as in case of the Finite element method. System equations are formulated using Galerkin weak form whereas integration is performed using background cells. EFG is conforming due to the use of consistent and compatible shape functions [9].


### 2.3. Block-Pulse Function-Based Integration

The accuracy of numerical approximation is dependent on the integration technique. Quadrature rule is commonly used for numerical integration. In this method, interpolating polynomials are employed to find weights for nodes in the domain. Conventional Gaussian quadrature scheme involves large number of points for accurate numerical solution. In other numerical integration techniques such as Newton-Cotes quadrature rule, fine discretization leads to erroneous results due to high degree of polynomial interpolation [18]. Accuracy of Gaussian quadrature rule depends on the selection of nodes and corresponding weights. Method of undetermined coefficients may be used for quadrature rule which requires tabulation of nodes and weights before numerical integration.In order to avoid these difficulties, Block-Pulse functions (BPF) have been used in this study to find numerical solution of system integral equations. Wavelet transforms were primarily developed for signal analysis, but they have also been used in applications like image compression, data compression, de-noising data and numerical approximation. Various types of wavelets include Battle-Lemarie, B-spline, Chebyshev, Daubechies, Legendre and Block-Pulse functions [18].Numerical Integration based on wavelets is becoming popular in recent years [18]. In this study, Block-Pulse functions have been used due to their suitable properties and exceptional performance in numerical integration [18]. Their performance particularly, in approximation of highly oscillatory and improper integral is more accurate as compared to existing method in literature [18–23].Block-Pulse wavelet is one of the simplest wavelet. BPF withm number of sets is defined as [18]:
(18)ϕi(t)={1for(i-1)Tm≤t<iTm0otherwise.
Here t∈[0,T] and i=1,2,…,m and h=T/m.Let us consider the integrand∫abg(x)dx, for x=(b-a)t+a, we get:
(19)∫abg(x)dx=(b-a)∫01g((b-a)t+a)dt.Theorem 1.
The integral can be approximated as [18]
(20)∫01g(t)dt≈1m∑i=1mgi.Proof.
Consider(21)∫01g(t)dt≈∑i=1mgi∫01ϕi(t)dt=1m∑i=1mgi.
To calculate the coefficients gi we consider the nodal points,
(22)tk=2k-12m,k=1,2,…,m.
The equation can be discretized to give
(23)g(tk)=∑i=1mgiϕi(tk)=gk,k=1,2,…,m.
Thus the integral can be approximated based on m-set block-pulse function as
(24)∫01g(t)dt≈1m∑i=1mg(2i-12m)
or
(25)∫abg(x)dx≅b-am∑i=1mg(a+(b-a)(2i-1m)).
Optimal weights are calculated using built-in procedure in terms of wavelets. There is no need for tabulation of weights, and no intermediate technique is required for integration. BPF-based integration eliminates the need for quadrature nodes. Integrands are treated explicitly without solving nonlinear system which results from unknown nodes and weights.


### 2.4. Consistency

A numerical method is called convergent if it approaches the exact solution as the discretization is refined. Consistency and stability guarantee convergence. The choice of monomial basis vectorp(x) influences the consistency of the EFG method. MLS approximation reproduces all components that appear in p(x). EFG method is consistent with order k if all monomials up to order k are included in p(x) [24]. If k=1, this implies that p(x) is linear complete and if k=2, p(x) is quadratic complete, and so forth. For consistency test we consider MLS approximation which reproduces all components of polynomials. Consider
(26)∑I=1nΦIk(x)u(xI)=uk(x)∀x∈Ω,Ifu(x)=1,then∑I=1nΦI(x)=1,Ifu(x)=x,then∑I=1nΦI(x)xI=x.


## 2.1. Meshless Shape Function

Shape functions for meshless techniques need to satisfy certain conditions such as adherence to partition of unity (∑i=1nΦI(x)=1), compact domain of influence, and adapting to randomness of nodes, to name a few. Computational efficiency is significantly affected by choice of shape function.MLS. Moving least square (MLS) scheme was developed by mathematicians for interpolation, data fitting, and surface construction. Meshless techniques maintain the local character of the numerical implementation, by using a local interpolation to represent the trial function with the fictitious values of the unknown variable at some randomly located nodes. The local interpolation techniques generally used are MLS, partition of unity method, reproducing kernel particle method, hp clouds, Shepard function, and so forth. The moving least squares (MLSs) approximation has reasonably high accuracy and can be generalized to work with n-dimensional problems. It provides continuous approximation for the field function over the entire problem domain [9, 17].Here, moving least square (MLS) scheme is considered to interpolate the field variable. MLS approximationuh(x) of a field variable function u(x) is defined as
(3)uh(x)=∑j=0mpj(x)aj(x)=pT(x)a(x)∀x∈Ω,
where m = number of terms in the basis, pj(x) = polynomial basis function,  aj(x) = nonconstant coefficients, and pT(x)=[p1(x),p2(x),…,pm(x)].p
T
(
x
) is a complete monomial basis vector of order m; a(x) is a vector containing coefficients: aj(x), j=1,2,3,…,m. The unknown coefficients of approximation are computed by minimizing the difference between the local approximation at a point xI and the nodal parameter uI for the node I: uI=u(xI).Here the sample pointxI may be a nodal point under consideration or a quadrature point. The support of the nodal point xI is usually taken to be a circle of radius rI, centered at xI. The weighted residual functional is evaluated as
(4)J=∑i=1nw(x-xI)(uh(x)-uI)2,
where w(x-xI) is weight function associated with the node I calculated at point x. w(x-xI)>0 for all points x in the support domain of node I, and
(5)uh(xI)=pT(xI)a(x).
Minimization of weighted residual functional results in
(6)A(x)a(x)=B(x)u,
where A(x) is a non-singular matrix.
(7)a(x)=A-1(x)B(x)u,u=[u1,u2,…,un]T.
The weight moment matrix A(x) is
(8)A(x)=PTWP=∑i=1nw(x-xI)p(xI)pT(xI),B(x)=PTW,
where P is
(9)P=[pT(x1)pT(x2)⋯pT(xn)]W is the weight function matrix:
(10)W=[w(x-x1)⋯0⋮⋱⋮0⋯w(x-xn)].
The following Gaussian weight function is used in the present study:(11)w(x-xI)=exp(-αc(x-xI)2).
Shape perimeter (αc) substantially affects the accuracy of the solution. Weight function for different values of shape parameters and its derivatives are illustrated in Figures 1 and 2 respectively.Figure 1
Weight function in the support domain.Figure 2
Derivatives of weight function in the support domain.Obtain valuea(x) from (7), and substituting in (5)
(12)uh(x)=ΦT(x)·u=∑I=1nϕ(xI)uI∀x∈Ω,Φ(x) is the nodal shape function
(13)Φ(x)=[ϕ1(x),ϕ2(x),…,ϕn(x)].
For any node I,
(14)ΦI(x)=pT(x)(A(-1)(x)B(x))I.
Transform the strong form of obstacle boundary value problems into symmetric variational or weak form as follows:
(15)∫ab(a(x)d4udx4+g(x)u(x)-f(x))vdx=0,
where u is the trial function and v is the test function. We get the following linear equation system after employing “Integration by parts” technique and by using the shape functions and boundary conditions
(16)∫ab(a(x)Φ′′(Φ′′)T+k(x)ΦΦT)dxu^=∫abfΦdx,Ku^=F,K=∫ab(a(x)Φ′′(Φ′′)T+k(x)ΦΦT)dx,F=∫abfΦdx.
Solving the system of equation, we get that u^ nodal fictitious values are obtained. Required numerical solution can be determined by multiplication of nodal fictitious values and shape functions Φ:
(17)u=u^Φ.


## 2.2. EFG

Element-free Galerkin (EFG) technique was introduced by Belytschko et al. [12]. EFG results in generation of nodes with variable interconnectivity, thus providing huge flexibility in discretization. Solution is expanded on a basis of MLS shape functions instead of piecewise polynomial basis as in case of the Finite element method. System equations are formulated using Galerkin weak form whereas integration is performed using background cells. EFG is conforming due to the use of consistent and compatible shape functions [9].


## 2.3. Block-Pulse Function-Based Integration

The accuracy of numerical approximation is dependent on the integration technique. Quadrature rule is commonly used for numerical integration. In this method, interpolating polynomials are employed to find weights for nodes in the domain. Conventional Gaussian quadrature scheme involves large number of points for accurate numerical solution. In other numerical integration techniques such as Newton-Cotes quadrature rule, fine discretization leads to erroneous results due to high degree of polynomial interpolation [18]. Accuracy of Gaussian quadrature rule depends on the selection of nodes and corresponding weights. Method of undetermined coefficients may be used for quadrature rule which requires tabulation of nodes and weights before numerical integration.In order to avoid these difficulties, Block-Pulse functions (BPF) have been used in this study to find numerical solution of system integral equations. Wavelet transforms were primarily developed for signal analysis, but they have also been used in applications like image compression, data compression, de-noising data and numerical approximation. Various types of wavelets include Battle-Lemarie, B-spline, Chebyshev, Daubechies, Legendre and Block-Pulse functions [18].Numerical Integration based on wavelets is becoming popular in recent years [18]. In this study, Block-Pulse functions have been used due to their suitable properties and exceptional performance in numerical integration [18]. Their performance particularly, in approximation of highly oscillatory and improper integral is more accurate as compared to existing method in literature [18–23].Block-Pulse wavelet is one of the simplest wavelet. BPF withm number of sets is defined as [18]:
(18)ϕi(t)={1for(i-1)Tm≤t<iTm0otherwise.
Here t∈[0,T] and i=1,2,…,m and h=T/m.Let us consider the integrand∫abg(x)dx, for x=(b-a)t+a, we get:
(19)∫abg(x)dx=(b-a)∫01g((b-a)t+a)dt.Theorem 1.
The integral can be approximated as [18]
(20)∫01g(t)dt≈1m∑i=1mgi.Proof.
Consider(21)∫01g(t)dt≈∑i=1mgi∫01ϕi(t)dt=1m∑i=1mgi.
To calculate the coefficients gi we consider the nodal points,
(22)tk=2k-12m,k=1,2,…,m.
The equation can be discretized to give
(23)g(tk)=∑i=1mgiϕi(tk)=gk,k=1,2,…,m.
Thus the integral can be approximated based on m-set block-pulse function as
(24)∫01g(t)dt≈1m∑i=1mg(2i-12m)
or
(25)∫abg(x)dx≅b-am∑i=1mg(a+(b-a)(2i-1m)).
Optimal weights are calculated using built-in procedure in terms of wavelets. There is no need for tabulation of weights, and no intermediate technique is required for integration. BPF-based integration eliminates the need for quadrature nodes. Integrands are treated explicitly without solving nonlinear system which results from unknown nodes and weights.


## 2.4. Consistency

A numerical method is called convergent if it approaches the exact solution as the discretization is refined. Consistency and stability guarantee convergence. The choice of monomial basis vectorp(x) influences the consistency of the EFG method. MLS approximation reproduces all components that appear in p(x). EFG method is consistent with order k if all monomials up to order k are included in p(x) [24]. If k=1, this implies that p(x) is linear complete and if k=2, p(x) is quadratic complete, and so forth. For consistency test we consider MLS approximation which reproduces all components of polynomials. Consider
(26)∑I=1nΦIk(x)u(xI)=uk(x)∀x∈Ω,Ifu(x)=1,then∑I=1nΦI(x)=1,Ifu(x)=x,then∑I=1nΦI(x)xI=x.


## 3. Application and Test Problems

We consider the following example fourth-order obstacle boundary value problem (BVP) for findingu such that
(27)u(4)(x)≥=f(x),onΩ=[-1,1],u(x)≥=ψ(x),onΩ=[-1,1],[u(4)(x)-f(x)][u-ψ(x)]=0,onΩ=[-1,1],u(-1)=u(1)=0,u′′(-1)=u′′(1)=0,
where f, a given force acting on the beam and ψ(x), is the elastic obstacle. Now the problem will be discussed in the framework of variational inequality approach. Define set K, as
(28)K={v:v∈H02(Ω):v≥ψ,onΩ}.K is a closed convex set in H02(Ω), (Sobolev space), which is in fact a Hilbert space. It can be easily shown that energy functional associated with the obstacle problem (27) is
(29)I[v]=∫-11{d4udx4-2f(x)}v(x)dx,∀v∈H02(Ω),I[v]=∫-11(d2udx2)2dx-2∫-11f(x)v(x)dx,I[v]=a(u,v)-2(f,v),(30)a(u,v)=∫-11(d2udx2)(d2vdx2)dx,(31)(f,v)=∫-11f(x)v(x)dx,
it can easily proved that the form a(u,v), defined by (30), is bilinear, symmetric, and positive (coercive) and the functional f, is a linear continuous functional [1–3]. Minimum u of the functional I[v] defined by (29) on the closed convex set K in ∈H02(Ω) can be characterized by the variational inequality
(32)a(u,v-u)≥(f,v-u),∀v∈K.
Thus we conclude that the obstacle problem (27) is equivalent to solving variational inequality problem (32). This equivalence has been used to study the existence of a unique of (27); see [1–3], and using the idea of Lewy and Stampacchia, [6] can be written as
(33)u(4)+v{u-ψ}(u-ψ)=f,
where ψ  is the obstacle function and v(t) is a penalty function defined by
(34)v(t)={4t≥00t≺0.
We assume that the obstacle function, ψ(x), is defined by
(35)ψ(x)={-14for-1≤x≤-12,12≤x≤114-12≤x≺12.
From (33)–(35), we obtain the following system of equations
(36)u(4)={ffor-1≤x≤-12,12≤x≤11-4u+f-12≤x≺12.
With the boundary conditions, consider
(37)u(-1)=u(-12)=u(12)=u(1)=0,u′′(-1)=u′′(-12)=u′′(12)=u′′(1)=0.Problem 1.
In this example, we consider system of differential equation (38), when f=0,(38)u(4)={0for-1≤x≤-12,12≤x≤11-4u-12≤x≺12,u(-1)=u(-12)=u(12)=u(1)=0,u′′(-1)=u′′(-12)=u′′(12)=u′′(1)=ε,ε⟶0.
The analytical solution for this boundary value problem is
(39)u(x)={(-23x2-32x2-1312x-14)ε+++++++-1≤x≤-120.5-1ϕ3[ϕ1sin(x)sinh(x)+ϕ2cos(x)cosh(x)]++++++++++++++++++-12≤x≤12(-23x2+32x2-1312x+14)ε+++++++++12≤x≤1,
where ϕ1=sin(1/2)sinh(1/2),  ϕ2=cos(1/2)cosh(1/2),  ϕ3=cos(1)+cosh(1). Numerical and analytical solution of Problem 1 is shown in Figure 3.Figure 3
Numerical and analytical solution plot (16 nodes), with constant basis-Problem1.Problem 2.
Forf=1,
(40)u(4)={1for-1≤x≤-12,12≤x≤12-4u-12≤x≺12.
With the same boundary conditions as in previous example, consider
(41)u(x)={(124x4+18x3+18x2+364x+1192)++++++++++-1≤x≤-120.5-1ϕ3[ϕ1sin(x)sinh(x)+ϕ2cos(x)cosh(x)]++++++++++++++++++-12≤x≤12(124x4-18x3+18x2-364x+1192)++++++++++++12≤x≤1.
Numerical and analytical solution of Problem 2 is shown in Figure 5.Test problems were solved for different number of nodes and constant basis with the help of improved EFG based on numerical integration using Block pulse functions/wavelets (BPF). Figures4 and 6 show the errors in solution of test Problems 1 and 2, respectively. Maximum absolute errors in solution are tabulated and compared with the results of exact solution, which show better accuracy.Figure 4
Max. absolute error plot (16 nodes), constant basis-Problem1.Figure 5
Numerical and analytical solution plot (12 nodes), with constant basis-Problem2.Figure 6
Max. absolute error plot (12 nodes), constant basis-Problem2.


### 3.1. Results and Discussion

Maximum errors obtained using our technique based on block pulse function (BPF) for our test problems are shown in Tables1 and 2. Comparison of maximum absolute errors with exact solution demonstrates the accuracy of our method. Results using quadrature rule-based integration are also calculated to show the performance of BPF-based integration technique. Maximum absolute errors for test problems are shown in Tables 1 and 2. It is clearly seen that integration of system equations using BPF has produced better results as compared with quadrature rule method for numerical integration.Table 1
Observed maximum errors for Problem1, using BPF (25).
Type of basis
Number of nodes
Max. Absolute Error
Our method using BPF100 sets of block pulse functions
Central difference method [1]
Colloc-quintic method [3]
Cubic-spline method [4]
Using quadrature rule with 100 Gauss points
Constant
8
2.853
E
-
6
1.4
E
-
4
3.0
E
-
4
1.9
E
-
5
3.1288
E
-
6
Constant
16
9.949
E
-
7
3.6
E
-
5
7.0
E
-
5
4.8
E
-
6
1.976
E
-
6
Constant
32
9.996
E
-
7
8.9
E
-
6
1.4
E
-
5
1.2
E
-
6
1.971
E
-
6Table 2
Observed maximum errors for Problem2, using BPF (25).
Type of basis
Number of nodes
Max. absolute error
Our method using BPF100 sets of block pulse functions
Central difference method [1]
Quartic spline method [2]
Cubic-spline method [4]
Using quadrature rule with 100 Gauss points
Constant
12
9.894
E
-
7
6.2
E
-
5
1.2
E
-
5
8.4
E
-
6
2.993
E
-
6
Constant
24
9.894
E
-
7
1.6
E
-
5
2.8
E
-
6
2.2
E
-
6
1.970
E
-
6Effect of Integration Points. It has been observed, that the accuracy of meshless computational technique depends upon the size of influence of domain, penalty factor, and Integration points. In this paper, we have studied that the accuracy of numerical method generally improves as we increase the number of integration points; however, if the number of gauss points exceeds some limiting value, it may have some adverse effects on the accuracy. It has been determined that arrangement of background cells and ratio of total number of Gauss points to the total number of nodes, plays very important roles in accuracy. To avoid all these complications to improve the accuracy of the meshless method, we purpose new numerical integration technique as mentioned above.


## 3.1. Results and Discussion

Maximum errors obtained using our technique based on block pulse function (BPF) for our test problems are shown in Tables1 and 2. Comparison of maximum absolute errors with exact solution demonstrates the accuracy of our method. Results using quadrature rule-based integration are also calculated to show the performance of BPF-based integration technique. Maximum absolute errors for test problems are shown in Tables 1 and 2. It is clearly seen that integration of system equations using BPF has produced better results as compared with quadrature rule method for numerical integration.Table 1
Observed maximum errors for Problem1, using BPF (25).
Type of basis
Number of nodes
Max. Absolute Error
Our method using BPF100 sets of block pulse functions
Central difference method [1]
Colloc-quintic method [3]
Cubic-spline method [4]
Using quadrature rule with 100 Gauss points
Constant
8
2.853
E
-
6
1.4
E
-
4
3.0
E
-
4
1.9
E
-
5
3.1288
E
-
6
Constant
16
9.949
E
-
7
3.6
E
-
5
7.0
E
-
5
4.8
E
-
6
1.976
E
-
6
Constant
32
9.996
E
-
7
8.9
E
-
6
1.4
E
-
5
1.2
E
-
6
1.971
E
-
6Table 2
Observed maximum errors for Problem2, using BPF (25).
Type of basis
Number of nodes
Max. absolute error
Our method using BPF100 sets of block pulse functions
Central difference method [1]
Quartic spline method [2]
Cubic-spline method [4]
Using quadrature rule with 100 Gauss points
Constant
12
9.894
E
-
7
6.2
E
-
5
1.2
E
-
5
8.4
E
-
6
2.993
E
-
6
Constant
24
9.894
E
-
7
1.6
E
-
5
2.8
E
-
6
2.2
E
-
6
1.970
E
-
6Effect of Integration Points. It has been observed, that the accuracy of meshless computational technique depends upon the size of influence of domain, penalty factor, and Integration points. In this paper, we have studied that the accuracy of numerical method generally improves as we increase the number of integration points; however, if the number of gauss points exceeds some limiting value, it may have some adverse effects on the accuracy. It has been determined that arrangement of background cells and ratio of total number of Gauss points to the total number of nodes, plays very important roles in accuracy. To avoid all these complications to improve the accuracy of the meshless method, we purpose new numerical integration technique as mentioned above.


## 4. Conclusion

In this study, improved numerical technique “element free Galerkin (EFG) technique using Block-Pulse function-based integration” has been presented. The results obtained by the suggested method for given problems as mentioned ((38) and (40)) exhibit its ability to provide improved solutions. The improved EFG technique showed fast convergence and provided better results at reduced number of nodes, as mentioned in Tables 1 and 2. It has capability of handling of improper, highly oscillatory function. Details of the results are shown the figures and tables.



---

*Source: 308692-2013-10-23.xml*