The Charged System Search Algorithm for Adaptive Node Moving Refinement in Discrete Least-Squares Meshless Method

Abstract

Discrete Least Squares Meshless (DLSM) method has been used for the solution of different problems ranging from solid to fluid mechanics problems. In the DLSM method, the locations of discretization points are random. Therefore, the error of the initial solution is rather high. In this chapter, an adaptive node moving refinement in the DLSM method is presented using the Charged System Search (CSS) for optimum analysis of elasticity problems. The CSS Physics inspired algorithm is effectively utilized to obtain suitable locations of the nodes. To demonstrate the effectiveness of the proposed method, some benchmark examples with available analytical solutions are used. The results show an excellent performance of the CSS for adaptive refinement in the meshless method.