Analysis of Meshfree Galerkin Methods Based on Moving Least Squares and Local Maximum-Entropy Approximation Schemes

Abstract

Over the last two decades, meshfree Galerkin methods have become increasingly popular in solid and fluid mechanics applications. A variety of these methods have been developed, each incorporating unique meshfree approximation schemes to enhance their performance. In this study, we examine the application of the Moving Least Squares and Local Maximum-Entropy (LME) approximations within the framework of Optimal Transportation Meshfree for solving Galerkin boundary-value problems. We focus on how the choice of basis order and the non-negativity, as well as the weak Kronecker-delta properties of shape functions, influence the performance of numerical solutions. Through comparative numerical experiments, we evaluate the efficiency, accuracy, and capabilities of these two approximation schemes. The decision to use one method over the other often hinges on factors like computational efficiency and resource management, underscoring the importance of carefully considering the specific attributes of the data and the intrinsic nature of the problem being addressed.