Abstract

A meshfree method namely, discrete least squares meshless (DLSM) method, is presented in this paper for the solution of elliptic partial differential equations. In this method, computational domain is discretized by some nodes and the set of simultaneous algebraic equations are built by minimizing a least squares functional with respect to the nodal parameters. The least squares functional is defined as the sum of squared residuals of the differential equation and its boundary condition calculated at a set of points called sampling points, generally different from nodal points. A moving least squares (MLS) technique is used to construct the shape functions. The proposed method automatically leads to symmetric and positive-definite system of equations. The proposed method does not need any background mesh and, therefore, it is a truly meshless method. The solutions of several one- and two-dimensional examples of elliptic partial differential equations are presented to illustrate the performance of the proposed method. Sensitivity analysis on the parameters of the method is also carried out and the results are presented.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.