<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">AM</journal-id><journal-title-group><journal-title>Applied Mathematics</journal-title></journal-title-group><issn pub-type="epub">2152-7385</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/am.2015.61015</article-id><article-id pub-id-type="publisher-id">AM-53302</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Element Free Gelerkin Method for 2-D Potential Problems
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>li</surname><given-names>Rahmani Firoozjaee</given-names></name><xref ref-type="aff" rid="aff1"><sub>1</sub></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><label>1</label><addr-line>Faculty of Civil Engineering Department, Babol University of Technology, Babol, Iran</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>Rahmani@nit.ac.ir</email></corresp></author-notes><pub-date pub-type="epub"><day>07</day><month>01</month><year>2015</year></pub-date><volume>06</volume><issue>01</issue><fpage>149</fpage><lpage>162</lpage><history><date date-type="received"><day>20</day>	<month>November</month>	<year>2014</year></date><date date-type="rev-recd"><day>accepted</day>	<month>2</month>	<year>December</year>	</date><date date-type="accepted"><day>16</day>	<month>January</month>	<year>2015</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  A meshfree method namely, element free Gelerkin (EFG) method, is presented in this paper for the solution of governing equations of 2-D potential problems. The EFG method is a numerical method which uses nodal points in order to discretize the computational domain, but where the use of connectivity is absent. The unknowns in the problems are approximated by means of connectivity-free technique known as moving least squares (MLS) approximation. The effect of irregular distribution of nodal points on the accuracy of the EFG method is the main goal of this paper as a complement to the precedent researches investigated by proposing an irregularity index (II) in order to analyze some 2-D benchmark examples and the results of sensitivity analysis on the parameters of the method are presented.
 
</p></abstract><kwd-group><kwd>Element Free Galerkin (EFG) Method</kwd><kwd> Potential Problems</kwd><kwd> Moving Least Squares Approximation</kwd><kwd> Irregular Distribution of Nodal Points</kwd><kwd> Irregularity Index</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Partial differential equations arise in connection with various physical and geometrical problems in which the functions involved depend on two or more independent variables, usually on time t and on one or several space variables [<xref ref-type="bibr" rid="scirp.53302-ref1">1</xref>] . A potential problem is one of the most important partial differential equations in engineering mathematics, because it occurs in connection with gravitational fields, electrostatics fields, steady-state heat conduction, incompressible fluid flow, and other areas [<xref ref-type="bibr" rid="scirp.53302-ref1">1</xref>] .</p><p>Mesh based numerical methods, such as finite element method (FEM) and boundary element method (BEM), have been the primary numerical techniques in engineering computations. In spite of the positive points of the finite element method, it still suffers from high preprocessing time, low accuracy of stresses, difficulty in incorporating adaptivity and it is also not an ideal tool for certain classes of problems, e.g. large deformations, material damage, crack growth, and moving boundaries [<xref ref-type="bibr" rid="scirp.53302-ref2">2</xref>] [<xref ref-type="bibr" rid="scirp.53302-ref3">3</xref>] . Therefore, meshless or meshfree methods are an ideal choice for these problems, because only a set of nodes is required for the problem domain discretization.</p><p>In the past few decades, a variety of new meshless methods have been developed, including the smoothed particle hydrodynamics (SPH) method [<xref ref-type="bibr" rid="scirp.53302-ref4">4</xref>] , the finite point method (FPM) [<xref ref-type="bibr" rid="scirp.53302-ref5">5</xref>] , the diffuse element method (DEM) [<xref ref-type="bibr" rid="scirp.53302-ref6">6</xref>] , the element free Galerkin (EFG) method [<xref ref-type="bibr" rid="scirp.53302-ref7">7</xref>] , the point interpolation method (PIM) [<xref ref-type="bibr" rid="scirp.53302-ref8">8</xref>] , the hp clouds method [<xref ref-type="bibr" rid="scirp.53302-ref9">9</xref>] , the partition of unity method (PUM) [<xref ref-type="bibr" rid="scirp.53302-ref10">10</xref>] , the meshless local Petrov-Galerkin (MLPG) method [<xref ref-type="bibr" rid="scirp.53302-ref11">11</xref>] , the local point interpolation method (LPIM) [<xref ref-type="bibr" rid="scirp.53302-ref12">12</xref>] , the discrete least squares meshless (DLSM) method [<xref ref-type="bibr" rid="scirp.53302-ref13">13</xref>] , the boundary point interpolation method (BPIM) [<xref ref-type="bibr" rid="scirp.53302-ref14">14</xref>] , and the meshless method with boundary integral equations [<xref ref-type="bibr" rid="scirp.53302-ref15">15</xref>] - [<xref ref-type="bibr" rid="scirp.53302-ref18">18</xref>] .</p><p>Recently several meshless methods are proposed in order to solve potential problems. The improved EFG method [<xref ref-type="bibr" rid="scirp.53302-ref19">19</xref>] based on the improved MLS approximation is used to solve 2-D potential problems. The method of fundamental solution (MFS), in which the desingularization technique is used to regularize the singularity and hyper singularity of the kernel functions, is applied to solve potential problems [<xref ref-type="bibr" rid="scirp.53302-ref20">20</xref>] . The discrete least squares meshless method with extra Gauss points is suggested for the solution of elliptic partial differential equations [<xref ref-type="bibr" rid="scirp.53302-ref21">21</xref>] . Singh and Singh used EFG method to solve 2-D potential flow problems [<xref ref-type="bibr" rid="scirp.53302-ref22">22</xref>] with regular distribution of nodal points.</p><p>The element free Galerkin (EFG) method that was developed by Belytschko et al. [<xref ref-type="bibr" rid="scirp.53302-ref7">7</xref>] , is one of the most commonly used meshless methods and is based on the earlier version of diffuse element method [<xref ref-type="bibr" rid="scirp.53302-ref6">6</xref>] . In the EFG method, moving least squares (MLS) shape functions are used for the approximation of the field variables [<xref ref-type="bibr" rid="scirp.53302-ref23">23</xref>] ; a background cell is used for numerical integration and Lagrange multipliers or penalty method is used for the imposition of essential boundary conditions.</p><p>The element free Galerkin method is presented in this paper to solve potential problems, and the effect of irregularity distribution of nodal points by using a proposed irregularity index (II) that was not considered in the previous researches for the EFG method, is investigated. In what follows, the construction of MLS shape functions is first explained. EFG method for discretization of the governing differential equation is then explained. Several 2-D potential problems are solved using the proposed method; sensitivity analysis on the parameters of the proposed method is also carried out, and the results are presented.</p></sec><sec id="s2"><title>2. MLS Approximation</title><sec id="s2_1"><title>2.1. MLS Interpolants Function</title><p>MLS is a very important component of the element free Galerkin (EFG) method for the approximation of the field variables. The MLS approximation u<sup>h</sup> of a scalar function u at point x is given as</p><disp-formula id="scirp.53302-formula200"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x6.png"  xlink:type="simple"/></disp-formula><p>where P(x) is a polynomial basis function of the spatial coordinates, m is the number of monomial terms in the basis function, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x7.png" xlink:type="simple"/></inline-formula> is a vector of coefficients given by</p><disp-formula id="scirp.53302-formula201"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x8.png"  xlink:type="simple"/></disp-formula><p>The polynomial basis function P(x) is built from Pascal’s triangle and pyramid for 2- and 3-D problems, respectively. In 2-D problems, linear and quadratic basis functions are given as</p><disp-formula id="scirp.53302-formula202"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x9.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.53302-formula203"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x10.png"  xlink:type="simple"/></disp-formula><p>The unknown coefficients in Equation (1) can be found by minimizing the following weighted least squares method.</p><disp-formula id="scirp.53302-formula204"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x11.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x12.png" xlink:type="simple"/></inline-formula> is the weight function of node <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x13.png" xlink:type="simple"/></inline-formula> at a point x which for simplicity it will be stated as<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x14.png" xlink:type="simple"/></inline-formula>.</p><p>Equation (5) using vector notation can be written as:</p><disp-formula id="scirp.53302-formula205"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x15.png"  xlink:type="simple"/></disp-formula><p>The minimum of J with respect to <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x16.png" xlink:type="simple"/></inline-formula> is found by</p><disp-formula id="scirp.53302-formula206"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x17.png"  xlink:type="simple"/></disp-formula><p>This leads to the following system of linear equations</p><disp-formula id="scirp.53302-formula207"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x18.png"  xlink:type="simple"/></disp-formula><p>Here <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x19.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x20.png" xlink:type="simple"/></inline-formula> are <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x21.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x22.png" xlink:type="simple"/></inline-formula> matrices, respectively, and are given as</p><disp-formula id="scirp.53302-formula208"><label>(9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x23.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.53302-formula209"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x24.png"  xlink:type="simple"/></disp-formula><p>And U is <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x25.png" xlink:type="simple"/></inline-formula> vector and is given as</p><disp-formula id="scirp.53302-formula210"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x26.png"  xlink:type="simple"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x27.png" xlink:type="simple"/></inline-formula>can be found using Equation (8);</p><disp-formula id="scirp.53302-formula211"><label>(12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x28.png"  xlink:type="simple"/></disp-formula><p>Putting <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x29.png" xlink:type="simple"/></inline-formula> from Equation (12) into Equation (1) leads to</p><disp-formula id="scirp.53302-formula212"><label>(13)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x30.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x31.png" xlink:type="simple"/></inline-formula> is a vector of shape functions. The first derivative of the shape functions with respect to the spatial coordinates is also required for the numerical implementation and is given as</p><disp-formula id="scirp.53302-formula213"><label>(14)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x32.png"  xlink:type="simple"/></disp-formula><p>where</p><disp-formula id="scirp.53302-formula214"><label>(15)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x33.png"  xlink:type="simple"/></disp-formula><p>and the index after the comma is a spatial derivative.</p></sec><sec id="s2_2"><title>2.2. Weight Function</title><p>Weight function is an important part of the MLS approximation. There are no predefined rules to select the weight function for a particular application, but the weight function that could be used for meshless methods should have the following properties:</p><p>1) Its value should be maximized at the node and decrease with the distance from the node.</p><p>2) Smooth and non-negative.</p><p>3) It should have a compact support, i.e. non-zero over a small neighborhood of a node. This compact support is known as the influence domain of a node (nodal point).</p><p>Influence domain of a nodal point is a very important concept in meshless methods, as it determines the region in which it has influence. The size of influence domain for a node i is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x34.png" xlink:type="simple"/></inline-formula>, where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x35.png" xlink:type="simple"/></inline-formula> is a scaling parameter and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x36.png" xlink:type="simple"/></inline-formula> is determined by searching for enough neighbor nodes such that matrix A in Equation (8) is invertible. In regular distribution of nodal points <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x37.png" xlink:type="simple"/></inline-formula> can be chosen as the distance between two neighboring nodes. In this paper, the cubic spline weight function is used;</p><disp-formula id="scirp.53302-formula215"><label>(16)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x38.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x39.png" xlink:type="simple"/></inline-formula> is the distance between node <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x40.png" xlink:type="simple"/></inline-formula> and point of interest<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x41.png" xlink:type="simple"/></inline-formula>. Weight function derivatives with respect to the spatial coordinates are also required for the shape function derivatives as given in Equation (14) and are given as follows [<xref ref-type="bibr" rid="scirp.53302-ref2">2</xref>] :</p><disp-formula id="scirp.53302-formula216"><label>(17)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x42.png"  xlink:type="simple"/></disp-formula></sec></sec><sec id="s3"><title>3. EFG Method for Potential Problems</title><sec id="s3_1"><title>3.1. 2-D Potential Formulation</title><p>Consider a Poisson’s partial differential equation in a two dimensional domain <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x43.png" xlink:type="simple"/></inline-formula> bounded by<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x44.png" xlink:type="simple"/></inline-formula>;</p><disp-formula id="scirp.53302-formula217"><label>(18)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x45.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x46.png" xlink:type="simple"/></inline-formula> is a source term. On one part of the boundary, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x46.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x47.png" xlink:type="simple"/></inline-formula>is the Dirichlet boundary condition, and on the other part, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x46.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x48.png" xlink:type="simple"/></inline-formula>is the Neumann boundary condition.</p><disp-formula id="scirp.53302-formula218"><label>(19)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x49.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.53302-formula219"><label>(20)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x50.png"  xlink:type="simple"/></disp-formula><p>where n is the outward normal vector to the boundary.</p></sec><sec id="s3_2"><title>3.2. Enforcement of Essential Boundary Condition</title><p>The MLS shape functions do not satisfy the Kronecker delta property, i.e.<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x51.png" xlink:type="simple"/></inline-formula>, and are termed as approximants instead of interpolants. The values obtained from the MLS approximation are therefore, not the same as the nodal values, i.e.<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x52.png" xlink:type="simple"/></inline-formula>, and are known as nodal parameters. This leads to some difficulties in imposition essential boundary condition in contrast to conventional FEM [<xref ref-type="bibr" rid="scirp.53302-ref2">2</xref>] .</p><p>In this paper, the penalty method is used to enforce the essential boundary condition. The use of penalty method produces system of equations of the same dimension that FEM produces for the same number of nodes, and the modified stiffness matrix is still positively defined; moreover, the symmetry and the bandedness of the system matrix are preserved [<xref ref-type="bibr" rid="scirp.53302-ref2">2</xref>] .</p><p>In the EFG method, the essential boundary condition has the form</p><disp-formula id="scirp.53302-formula220"><label>(21)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x53.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x54.png" xlink:type="simple"/></inline-formula> is the prescribed potential on the boundary.</p><p>Consider the problem stated in Equation (18), a penalty factor is applied to penalize the difference between the potential of the MLS approximation and the prescribed potential on the essential boundary [<xref ref-type="bibr" rid="scirp.53302-ref2">2</xref>] . The constrained Galerkin weak form uses the penalty method and with substituting the expression of MLS approximation of Equation (13) can then be posed as</p><disp-formula id="scirp.53302-formula221"><label>(22)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x55.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x56.png" xlink:type="simple"/></inline-formula> is a diagonal matrix of the penalty factor that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x57.png" xlink:type="simple"/></inline-formula> for 2-D case. The penalty factor <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x58.png" xlink:type="simple"/></inline-formula> can be a function of the coordinates, and it can be different from one another. Although in practice the identical constant of a large positive number is assigned for penalty factor, which can be chosen by following method [<xref ref-type="bibr" rid="scirp.53302-ref2">2</xref>]</p><disp-formula id="scirp.53302-formula222"><label>(23)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x59.png"  xlink:type="simple"/></disp-formula><p>The final system of equation of the EFG formulation with penalty method is</p><disp-formula id="scirp.53302-formula223"><label>(24)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x60.png"  xlink:type="simple"/></disp-formula><p>where</p><disp-formula id="scirp.53302-formula224"><label>(25)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x61.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.53302-formula225"><label>(26)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x62.png"  xlink:type="simple"/></disp-formula><p>The additional matrix <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x63.png" xlink:type="simple"/></inline-formula> is the global penalty matrix assembled using the nodal matrix defined by</p><disp-formula id="scirp.53302-formula226"><label>(27)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x64.png"  xlink:type="simple"/></disp-formula><p>And the vector <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x65.png" xlink:type="simple"/></inline-formula> is caused by the essential boundary condition that its nodal vector has the form</p><disp-formula id="scirp.53302-formula227"><label>(28)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x66.png"  xlink:type="simple"/></disp-formula></sec></sec><sec id="s4"><title>4. Irregularity Index (II)</title><p>To demonstrate the efficiency and accuracy of the EFG method in dealing with irregular distribution of nodal points, following irregularity index (II) is proposed in this paper</p><disp-formula id="scirp.53302-formula228"><label>(29)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x67.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x68.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x68.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x69.png" xlink:type="simple"/></inline-formula> are the maximum and minimum distances between nodal points, respectively, that are located in circular local domain such that each local domain includes at least 5 nodal points. The interval of the proposed index is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x68.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x70.png" xlink:type="simple"/></inline-formula>, in which 0 indicates fully irregular and 0.5 indicates fully regular distribution of nodal points.</p></sec><sec id="s5"><title>5. Numerical Examples</title><p>In this section, three 2-D numerical examples are solved to demonstrate the efficiency and accuracy of the proposed method. The effect of irregularity in distribution of nodal points is investigated by using of a proposed irregularity index (II) and the results are compared with the existing analytical solutions.</p><sec id="s5_1"><title>5.1. 2-D Poisson’s Equation with Mixed Boundary Conditions</title><p>Consider the following 2-D Poisson’s equation</p><disp-formula id="scirp.53302-formula229"><label>(30)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x71.png"  xlink:type="simple"/></disp-formula><p>with the following Dirichlet and Neumann boundary conditions</p><disp-formula id="scirp.53302-formula230"><label>(31)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x72.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.53302-formula231"><label>(32)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x73.png"  xlink:type="simple"/></disp-formula><p>the analytical solution of the aforementioned Poisson’s equation is</p><disp-formula id="scirp.53302-formula232"><label>(33)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x74.png"  xlink:type="simple"/></disp-formula><p>The above-mentioned problem is solved using two different sets of 81 distributed nodes. In all of these cases, the polynomial basis function is considered as <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x75.png" xlink:type="simple"/></inline-formula> and the ratio of influence domain is considered 3. The regular and irregular distribution of 81 nodal points for this problem is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref> and <xref ref-type="fig" rid="fig2">Figure 2</xref>. The analytical and EFG solution on a mesh of 81 nodal points with 96 and 1152 Gauss points along x axis are shown in <xref ref-type="fig" rid="fig3">Figure 3</xref> and <xref ref-type="fig" rid="fig4">Figure 4</xref>, respectively, to assess the effect of number of Gauss points on the solution accuracy.</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Nodal distribution on a rectangular domain with II = 0.5</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x76.png"/></fig><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Nodal distribution on a rectangular domain with II = 0.0727</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x77.png"/></fig><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Results obtained by analytical and EFG method at y = 0.2 with 96 Gauss points</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x78.png"/></fig><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Results obtained by analytical and EFG methodat y = 0.2 with 1152 Gauss points</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x79.png"/></fig><p>There are different parameters in the EFG method that affect the obtained results. In this paper a sensitivity analysis is carried out on these parameters. Number of nodal points, number of Gauss points, ratio of influence domain, number of monomial terms in the basis function, and the type of weight function, are the parameters that are analyzed. For the sensitivity analysis the following error norm has been used</p><disp-formula id="scirp.53302-formula233"><label>(34)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x80.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x81.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x82.png" xlink:type="simple"/></inline-formula> is the quantity of analytical solution and numerical solution, respectively. For the sensitivity analysis, one of the parameters is changed while the others are constant. The result of this analysis is shown in Tables 1-10, and the computational time is presented.</p><p>The results of <xref ref-type="table" rid="table1">Table 1</xref> indicate that the errors are dramatically reduced with increasing the number of nodal points while they get nearly constant when more nodal points are added. These results are also used to evaluate the convergence rate of the method with respect to nodal points and the results are shown in <xref ref-type="fig" rid="fig5">Figure 5</xref>.</p><p>The results of <xref ref-type="table" rid="table2">Table 2</xref> and <xref ref-type="table" rid="table3">Table 3</xref> quantitatively emphasize the rule of Gauss points on the accuracy of the EFG method and demonstrate high accuracy and low sensitivity of the proposed method in dealing with irregular distribution of nodal points.</p><p>This problem is solved here with different values of irregularity index to present the effect of irregularity distribution of nodal points. This analysis is done by using a proposed index that is shown in <xref ref-type="table" rid="table4">Table 4</xref> and a convergence rate is also demonstrates the obtained results in <xref ref-type="fig" rid="fig6">Figure 6</xref>. These results indicate the convergent behavior of the method as expected.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> The effect of number of nodal points on the error norm with 480 regular Gauss points</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Number of nodal points</th><th align="center" valign="middle" >25</th><th align="center" valign="middle" >36</th><th align="center" valign="middle" >64</th><th align="center" valign="middle" >81</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x83.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" >0.250</td><td align="center" valign="middle" >0.200</td><td align="center" valign="middle" >0.143</td><td align="center" valign="middle" >0.125</td></tr><tr><td align="center" valign="middle" ><sub><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x84.png" xlink:type="simple"/></inline-formula></sub><sub> </sub></td><td align="center" valign="middle" >0.3944</td><td align="center" valign="middle" >0.0730</td><td align="center" valign="middle" >0.0031</td><td align="center" valign="middle" >0.0029</td></tr><tr><td align="center" valign="middle" >CPU TIME (Sec)</td><td align="center" valign="middle" >0.6708</td><td align="center" valign="middle" >0.7800</td><td align="center" valign="middle" >0.8580</td><td align="center" valign="middle" >0.9572</td></tr></tbody></table></table-wrap><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> The effect of number of Gauss points on the error norm with 81 regular nodal points</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Number of Gauss points</th><th align="center" valign="middle" >96</th><th align="center" valign="middle" >320</th><th align="center" valign="middle" >480</th><th align="center" valign="middle" >1152</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x85.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" >0.0153</td><td align="center" valign="middle" >0.0032</td><td align="center" valign="middle" >0.0029</td><td align="center" valign="middle" >0.0022</td></tr><tr><td align="center" valign="middle" >CPU TIME (Sec)</td><td align="center" valign="middle" >0.6084</td><td align="center" valign="middle" >0.7800</td><td align="center" valign="middle" >0.9672</td><td align="center" valign="middle" >1.6848</td></tr></tbody></table></table-wrap><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> The effect of number of Gauss points on the error norm with 81 irregular nodal points</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Number of Gauss points</th><th align="center" valign="middle" >96</th><th align="center" valign="middle" >320</th><th align="center" valign="middle" >480</th><th align="center" valign="middle" >1152</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x86.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" >0.3273</td><td align="center" valign="middle" >0.2289</td><td align="center" valign="middle" >0.1323</td><td align="center" valign="middle" >0.0577</td></tr><tr><td align="center" valign="middle" >CPU TIME (Sec)</td><td align="center" valign="middle" >1.3193</td><td align="center" valign="middle" >2.2932</td><td align="center" valign="middle" >2.3868</td><td align="center" valign="middle" >4.5396</td></tr></tbody></table></table-wrap><table-wrap id="table4" ><label><xref ref-type="table" rid="table4">Table 4</xref></label><caption><title> The effect of irregularity of nodal points on the error norm with 81 irregular nodal points</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Irregularity Index (II)</th><th align="center" valign="middle" >0.5</th><th align="center" valign="middle" >0.0727</th><th align="center" valign="middle" >0.0143</th><th align="center" valign="middle" >0.0012</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x87.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" >0.0002</td><td align="center" valign="middle" >0.0577</td><td align="center" valign="middle" >0.0991</td><td align="center" valign="middle" >0.1907</td></tr><tr><td align="center" valign="middle" >CPU TIME (Sec)</td><td align="center" valign="middle" >1.6848</td><td align="center" valign="middle" >4.5396</td><td align="center" valign="middle" >0.9984</td><td align="center" valign="middle" >1.6068</td></tr></tbody></table></table-wrap><table-wrap id="table5" ><label><xref ref-type="table" rid="table5">Table 5</xref></label><caption><title> The effect of ratio of influence domain on the error norm with 81 regular nodal points</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Ratio of influence domain</th><th align="center" valign="middle" >1.12</th><th align="center" valign="middle" >2</th><th align="center" valign="middle" >3</th><th align="center" valign="middle" >4.8</th><th align="center" valign="middle" >6.4</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x88.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" >0.0112</td><td align="center" valign="middle" >0.0026</td><td align="center" valign="middle" >0.0007</td><td align="center" valign="middle" >0.1156</td><td align="center" valign="middle" >0.6371</td></tr><tr><td align="center" valign="middle" >CPU TIME (Sec)</td><td align="center" valign="middle" >0.3276</td><td align="center" valign="middle" >0.7176</td><td align="center" valign="middle" >1.5912</td><td align="center" valign="middle" >4.4928</td><td align="center" valign="middle" >7.5660</td></tr></tbody></table></table-wrap><table-wrap id="table6" ><label><xref ref-type="table" rid="table6">Table 6</xref></label><caption><title> The effect of ratio of influence domain on the error norm with 81 irregular nodal points</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Ratio of influence domain</th><th align="center" valign="middle" >1.12</th><th align="center" valign="middle" >2</th><th align="center" valign="middle" >3</th><th align="center" valign="middle" >4.8</th><th align="center" valign="middle" >6.4</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x89.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" >0.7114</td><td align="center" valign="middle" >0.1583</td><td align="center" valign="middle" >0.0577</td><td align="center" valign="middle" >0.0134</td><td align="center" valign="middle" >0.0025</td></tr><tr><td align="center" valign="middle" >CPU TIME (Sec)</td><td align="center" valign="middle" >1.2168</td><td align="center" valign="middle" >1.5756</td><td align="center" valign="middle" >4.5396</td><td align="center" valign="middle" >13.3536</td><td align="center" valign="middle" >22.3237</td></tr></tbody></table></table-wrap><table-wrap id="table7" ><label><xref ref-type="table" rid="table7">Table 7</xref></label><caption><title> The effect of number of monomial terms in basis function on the error norm (regular)</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >The number of monomial terms in the basis function</th><th align="center" valign="middle" >0</th><th align="center" valign="middle" >1</th><th align="center" valign="middle" >2</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x90.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" >0.0029</td><td align="center" valign="middle" >0.0007</td><td align="center" valign="middle" >0.0006</td></tr><tr><td align="center" valign="middle" >CPU time (Sec)</td><td align="center" valign="middle" >1.2792</td><td align="center" valign="middle" >1.5912</td><td align="center" valign="middle" >2.3868</td></tr></tbody></table></table-wrap><table-wrap id="table8" ><label><xref ref-type="table" rid="table8">Table 8</xref></label><caption><title> The effect of number of monomial terms in basis function on the error norm (ırregular)</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >The number of monomial terms in the basis function</th><th align="center" valign="middle" >0</th><th align="center" valign="middle" >1</th><th align="center" valign="middle" >2</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x91.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" >0.0267</td><td align="center" valign="middle" >0.0577</td><td align="center" valign="middle" >0.1645</td></tr><tr><td align="center" valign="middle" >CPU time (Sec)</td><td align="center" valign="middle" >3.7284</td><td align="center" valign="middle" >4.5396</td><td align="center" valign="middle" >6.2400</td></tr></tbody></table></table-wrap><table-wrap id="table9" ><label><xref ref-type="table" rid="table9">Table 9</xref></label><caption><title> The effect of the type of weight function on the error norm with 81 regular nodal points</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Type of weight functions</th><th align="center" valign="middle" >Cubic spline</th><th align="center" valign="middle" >Quartic spline</th><th align="center" valign="middle" >Exponential</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x92.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" >0.0006</td><td align="center" valign="middle" >0.0016</td><td align="center" valign="middle" >0.0070</td></tr><tr><td align="center" valign="middle" >CPU time (Sec)</td><td align="center" valign="middle" >2.3868</td><td align="center" valign="middle" >2.4180</td><td align="center" valign="middle" >2.3556</td></tr></tbody></table></table-wrap><table-wrap id="table10" ><label><xref ref-type="table" rid="table1">Table 1</xref>0</label><caption><title> The effect of the type of weight function on the error norm with 81 irregular nodal points</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Type of weight functions</th><th align="center" valign="middle" >Cubic spline</th><th align="center" valign="middle" >Quartic spline</th><th align="center" valign="middle" >Exponential</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x93.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" >0.0577</td><td align="center" valign="middle" >0.1428</td><td align="center" valign="middle" >0.2116</td></tr><tr><td align="center" valign="middle" >CPU time (Sec)</td><td align="center" valign="middle" >4.5396</td><td align="center" valign="middle" >3.2136</td><td align="center" valign="middle" >4.1340</td></tr></tbody></table></table-wrap><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Convergence rate of the method with respect to nodal points</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x94.png"/></fig><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Convergence rate of the method with respect to irregularity index</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x95.png"/></fig><p>The problem is solved again on a mesh of 81 regularly and irregularly distributed of nodal points with different ratio of influence domain and 1152 Gauss points. The effect of this parameter is investigated in <xref ref-type="table" rid="table5">Table 5</xref> and <xref ref-type="table" rid="table6">Table 6</xref>. The values of this ratio in <xref ref-type="table" rid="table6">Table 6</xref> vary in the same way as <xref ref-type="table" rid="table5">Table 5</xref> to have a better comparison between them. The results of <xref ref-type="table" rid="table5">Table 5</xref> demonstrate that the appropriate interval of ratio of influence domain in regular distribution of nodal points is 2 - 3, while it is obvious from <xref ref-type="table" rid="table6">Table 6</xref> that the errors are decreased by increasing this ratio.</p><p>The number of monomial terms in basis function is the other parameter that can affect the performance of the EFG method. In this case, the problem domain is discretized with 81 regular and irregular nodal points with 1152 Gauss points. The ratio of influence domain in <xref ref-type="table" rid="table7">Table 7</xref> and <xref ref-type="table" rid="table8">Table 8</xref> is considered 3 to have a better comparison between them.</p><p>According to the results of <xref ref-type="table" rid="table7">Table 7</xref> and <xref ref-type="table" rid="table8">Table 8</xref>, the errors are diminished by increasing the number of monomial terms in basis function in regular distribution of nodal points, however, this effect is opposite in irregular distribution of nodal points because the higher number of monomial terms, the more nodal points are acquired in a favorable influence domain.</p><p>The other parameter that affects the solution’s accuracy of the EFG method is the type weight function. In order to investigate this effect, the problem domain is discretized again with 81 regular and irregular meshes of nodes with 1152 Gauss points and three types of weight functions that are considered. It is also notable that the ratio of influence domain in both cases is considered 3.</p><p>It can be concluded from <xref ref-type="table" rid="table9">Table 9</xref> and <xref ref-type="table" rid="table1">Table 1</xref>0 in both cases, the solution’s accuracy obtained by cubic spline is more desirable than the other weigh functions.</p></sec><sec id="s5_2"><title>5.2. Poisson’s Equation with Dirichlet Boundary Conditions on a Torus [<xref ref-type="bibr" rid="scirp.53302-ref19">19</xref>]</title><p>The second example is a 2-D Poisson’s equation with Dirichlet boundary conditions on the torus. The equation is</p><disp-formula id="scirp.53302-formula234"><label>(35)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x96.png"  xlink:type="simple"/></disp-formula><p>with the following boundary conditions</p><disp-formula id="scirp.53302-formula235"><label>(36)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x97.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.53302-formula236"><label>(37)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x98.png"  xlink:type="simple"/></disp-formula><p>and the analyticalsolutionofthisproblemis</p><disp-formula id="scirp.53302-formula237"><label>(38)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x99.png"  xlink:type="simple"/></disp-formula><p>here, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x100.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x101.png" xlink:type="simple"/></inline-formula> are assumed. The regular distribution of nodal points is shown in <xref ref-type="fig" rid="fig7">Figure 7</xref>. The above- mentioned problem is solved using two different sets of 460 distributed nodes that are shown in <xref ref-type="fig" rid="fig7">Figure 7</xref> and <xref ref-type="fig" rid="fig8">Figure 8</xref>. The analytical and numerical solutions along r direction at any angle with 460 nodal points are plotted in <xref ref-type="fig" rid="fig9">Figure 9</xref> and the ratio of influence domain is considered 3 for this problem again.</p></sec><sec id="s5_3"><title>5.3. Flow over a Circular Cylinder</title><p>In this section, flow over a circular cylinder is considered. Such a flow can be generated by adding a uniform flow, in the positive x direction to a doublet at the origin directed in the negative x direction. The geometry of the example is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>0 and the governing equation of that is as follows:</p><disp-formula id="scirp.53302-formula238"><label>(39)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x102.png"  xlink:type="simple"/></disp-formula><fig id="fig7"  position="float"><label><xref ref-type="fig" rid="fig7">Figure 7</xref></label><caption><title> Nodal distribution on a tours domain with II = 0.3862</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x103.png"/></fig><fig id="fig8"  position="float"><label><xref ref-type="fig" rid="fig8">Figure 8</xref></label><caption><title> Nodal distribution on a tours domain with II = 0.0114</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x104.png"/></fig><fig id="fig9"  position="float"><label><xref ref-type="fig" rid="fig9">Figure 9</xref></label><caption><title> Results obtained by analytical and EFG method alongr direction at any angle</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x105.png"/></fig><fig id="fig10"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>0</label><caption><title> Flow over acircular cylinder</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x106.png"/></fig><p>and the exact solution is</p><disp-formula id="scirp.53302-formula239"><label>(40)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/15-7402595x107.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/15-7402595x108.png" xlink:type="simple"/></inline-formula> is the fluid’s velocity. Due to the symmetry, only the one-quarter of the problem domain is considered. This domain with its boundary condition is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>1.</p><p>The above-mentioned problem is solved using three different sets of 241 distributions of nodal points with 962 Gauss points. It is notable that the ratio of influence domain in all cases is considered 3 and the distribution of nodal points with different values of irregular index is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>2-14. The analytical and the EFG solutions along y axis are shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>5.</p></sec></sec><sec id="s6"><title>6. Conclusion</title><p>A meshless method namely element free Galerkin (EFG) method is presented in this paper. In order to investigate the performance and accuracy of the method, some 2-D potential problems on regular and irregular distribution</p><fig id="fig11"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>1</label><caption><title> Boundary condition of the flow over a circular cylinder</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x109.png"/></fig><fig id="fig12"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>2</label><caption><title> Nodal distribution of flow over a circular cylinder with II = 0.49999</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x110.png"/></fig><fig id="fig13"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>3</label><caption><title> Nodal distribution of flow over a circular cylinder with II = 0.02323</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x111.png"/></fig><fig id="fig14"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>4</label><caption><title> Nodal distribution of flow over a circular cylinder with II = 0.00289</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x112.png"/></fig><fig id="fig15"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>5</label><caption><title> Results obtained by analytical and EFG method at x = −1.0</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/15-7402595x113.png"/></fig><p>of nodal points by using a proposed irregularity index (II) are analyzed and compared with the exact solution. A sensitivity analysis on the parameters of the EFG method is also carried out. From above analysis, it can be inferred that the errors are dramatically reduced by increasing the number of nodal points and Gauss points while they get nearly constant when more of them are added. It is also notable that the appropriate ratio of influence domain has been found to be 2 - 3 for regular mesh of nodal points, and in irregular mesh of nodal points, the errors are converged by increasing this ratio. Increasing the number of monomial terms in basis function is another factor that can improve the accuracy of the EFG method in regular distribution of nodal points while this effect is contradictory in comparison with irregular distribution of nodal points. The effect of using different type of weight functions is another parameter considered and the results indicate better performance of the method in using cubic spline weight function. Finally, it can be concluded that EFG method can be used to solve problems on irregular mesh of nodes with admissible performance.</p></sec><sec id="s7"><title>NOTES</title></sec></body><back><ref-list><title>References</title><ref id="scirp.53302-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Kreyszig, E. (2010) Advanced Engineering Mathematics. Wiley, Hoboken.</mixed-citation></ref><ref id="scirp.53302-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Liu, G.R. and Gu, Y. (2005) An Introduction to Meshfree Methods and Their Programming, Vol. 1. Springer, Berlin.</mixed-citation></ref><ref id="scirp.53302-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Zhuang, X. (2010) Meshless Methods: Theory and Application in 3D Fracture Modelling with Level Sets. Durham University, Durham.</mixed-citation></ref><ref id="scirp.53302-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Monaghan, J.J. (1988) An Introduction to SPH. Computer Physics Communications, 48, 89-96. 
http://dx.doi.org/10.1016/0010-4655(88)90026-4</mixed-citation></ref><ref id="scirp.53302-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Onate, E., et al. (1996) A Finite Point Method in Computational Mechanics. Applications to Convective Transport and Fluid Flow. International Journal for Numerical Methods in Engineering, 39, 3839-3866. 
http://dx.doi.org/10.1002/(SICI)1097-0207(19961130)39:22&lt;3839::AID-NME27&gt;3.0.CO;2-R</mixed-citation></ref><ref id="scirp.53302-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Nayroles, B., Touzot, G. and Villon, P. (1992) Generalizing the Finite Element Method: Diffuse Approximation and Diffuse Elements. Computational Mechanics, 10, 307-318. http://dx.doi.org/10.1007/BF00364252</mixed-citation></ref><ref id="scirp.53302-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Belytschko, T., Lu, Y.Y. and Gu, L. (1994) Element-Free Galerkin Methods. International Journal for Numerical Methods in Engineering, 37, 229-256. http://dx.doi.org/10.1002/nme.1620370205</mixed-citation></ref><ref id="scirp.53302-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Liu, G.R. and Gu, Y. (2001) A Point Interpolation Method for Two-Dimensional Solids. International Journal for Numerical Methods in Engineering, 50, 937-951.  
http://dx.doi.org/10.1002/1097-0207(20010210)50:4&lt;937::AID-NME62&gt;3.0.CO;2-X</mixed-citation></ref><ref id="scirp.53302-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Liszka, T.J., Duarte, C.A.M. and Tworzydlo, W.W. (1996) hp-Meshless Cloud Method. Computer Methods in Applied Mechanics and Engineering, 139, 263-288. http://dx.doi.org/10.1016/S0045-7825(96)01086-9</mixed-citation></ref><ref id="scirp.53302-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Babuska, I. and Melenk, J.M. (1997) The Partition of Unity Method. International Journal for Numerical Methods in Engineering, 40, 727-758. http://dx.doi.org/10.1002/(SICI)1097-0207(19970228)40:4&lt;727::AID-NME86&gt;3.0.CO;2-N</mixed-citation></ref><ref id="scirp.53302-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Atluri, S. and Zhu, T. (1998) A New Meshless Local Petrov-Galerkin (MLPG) Approach in Computational Mechanics. Computational Mechanics, 22, 117-127. http://dx.doi.org/10.1007/s004660050346</mixed-citation></ref><ref id="scirp.53302-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Gu, Y. and Liu, G.R. (2001) A Local Point Interpolation Method for Static and Dynamic Analysis of Thin Beams. Computer Methods in Applied Mechanics and Engineering, 190, 5515-5528.  
http://dx.doi.org/10.1016/S0045-7825(01)00180-3</mixed-citation></ref><ref id="scirp.53302-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Rahmani Firoozjaee, A. and Afshar, M.H. (2011) Discrete Least Squares Meshless (DLSM) Method for Simulation of Steady State Shallow Water Flows. Scientia Iranica, 18, 835-845. http://dx.doi.org/10.1016/j.scient.2011.07.016</mixed-citation></ref><ref id="scirp.53302-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Gu, Y. and Liu, G. (2002) A Boundary Point Interpolation Method for Stress Analysis of Solids. Computational Mechanics, 28, 47-54. http://dx.doi.org/10.1007/s00466-001-0268-9</mixed-citation></ref><ref id="scirp.53302-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Liew, K., Cheng, Y. and Kitipornchai, S. (2007) Analyzing the 2D Fracture Problems via the Enriched Boundary Element-Free Method. International Journal of Solids and Structures, 44, 4220-4233.  
http://dx.doi.org/10.1016/j.ijsolstr.2006.11.018</mixed-citation></ref><ref id="scirp.53302-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Liew, K., Cheng, Y. and Kitipornchai, S. (2005) Boundary Element-Free Method (BEFM) for Two-Dimensional Elastodynamic Analysis Using Laplace Transform. International Journal for Numerical Methods in Engineering, 64, 1610-1627. http://dx.doi.org/10.1002/nme.1417</mixed-citation></ref><ref id="scirp.53302-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Liew, K., Cheng, Y. and Kitipornchai, S. (2006) Boundary Element-Free Method (BEFM) and Its Application to Two-Dimensional Elasticity Problems. International Journal for Numerical Methods in Engineering, 65, 1310-1332.  
http://dx.doi.org/10.1002/nme.1489</mixed-citation></ref><ref id="scirp.53302-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Liew, K., Sun, Y. and Kitipornchai, S. (2007) Boundary Element-Free Method for Fracture Analysis of 2-D Anisotropic Piezoelectric Solids. International Journal for Numerical Methods in Engineering, 69, 729-749.  
http://dx.doi.org/10.1002/nme.1786</mixed-citation></ref><ref id="scirp.53302-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, Z., Zhao, P. and Liew, K. (2009) Improved Element-Free Galerkin Method for Two-Dimensional Potential Problems. Engineering Analysis with Boundary Elements, 33, 547-554.  
http://dx.doi.org/10.1016/j.enganabound.2008.08.004</mixed-citation></ref><ref id="scirp.53302-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Young, D., Chen, K. and Lee, C. (2005) Novel Meshless Method for Solving the Potential Problems with Arbitrary Domain. Journal of Computational Physics, 209, 290-321. http://dx.doi.org/10.1016/j.jcp.2005.03.007</mixed-citation></ref><ref id="scirp.53302-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Firoozjaee, A.R. and Afshar, M.H. (2009) Discrete Least Squares Meshless Method with Sampling Points for the Solution of Elliptic Partial Differential Equations. Engineering Analysis with Boundary Elements, 33, 83-92.  
http://dx.doi.org/10.1016/j.enganabound.2008.03.004</mixed-citation></ref><ref id="scirp.53302-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Singh, I. and Singh, A. (2009) A Meshfree Solution of Tow-Dimensional Potential Flow Problems. World Academy of Science, Engineering and Technology, International Science Index, 27, 587-597.</mixed-citation></ref><ref id="scirp.53302-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Lancaster, P. and Salkauskas, K. (1981) Surfaces Generated by Moving Least Squares Methods. Mathematics of Computation, 37, 141-158. http://dx.doi.org/10.1090/S0025-5718-1981-0616367-1</mixed-citation></ref></ref-list></back></article>