A comparison of numerical integration rules for the Meshless Local Petrov-Galerkin method

The meshless local Petrov–Galerkin (MLPG) method is a meshfree procedure for solving partial differential equations. However, the benefit in avoiding the mesh construction and refinement is counterbalanced by the use of complicated non polynomial shape functions with subsequent difficulties, and a potentially large cost, when implementing numerical integration schemes. In this paper we describe and compare some numerical quadrature rules with the aim at preserving the MLPG solution accuracy and at the same time reducing its computational cost.