Adaptive node moving refnement in discrete least squares meshless method using charged system search

Discrete least squares meshless (dlsm) method has been used for thesolution of dierent problems ranging from solid to uid mechanics problems. in dlsmmethod the locations of discretization points are random. therefore, the error of the initialsolution is rather high. in this paper, an adaptive node moving renement in dlsmmethod is presented using the charged system search (css) for optimum analysis ofelasticity problems. the css algorithm is eectively utilized to obtain suitable locationsof the nodes. the css is a multi-agent optimization technique based on some principlesof physics and mechanics. each agent, called a charged particle (cp), is a sphere withuniform charge density that can attract other cps by considering the tness of the cp.to demonstrate the eectiveness of the proposed method, some benchmark examples withavailable analytical solutions are used. the results show an excellent performance of thecss for adaptive renement in meshless method.