A comparison of numerical integration rules for the meshless local Petrov–Galerkin method
- 216 Downloads
The meshless local Petrov–Galerkin (MLPG) method is a mesh-free 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.
KeywordsMeshless methods Meshless local Petrov–Galerkin method Numerical integration rules
Unable to display preview. Download preview PDF.
- 5.Atluri, S.N., Shen, S.: The Meshless Method (MLPG) for Domain and BIE Discretizations. Tech Science, Forsyth, GA (2004)Google Scholar
- 9.Cools, R., Kim, K.: A survey of known and new cubature formulas for the unit disk. Report TW 300, Katholieke Universiteit Leuven, Department of Computer Science (2000)Google Scholar
- 14.Ferronato, M., Mazzia, A., Pini, G., Gambolati, G.: Accuracy and performance of meshless local Petrov–Galerkin methods in 2-D elastostatic problems. JP J. Solids Struct. 1, 35–59 (2007)Google Scholar