Discrete least squares meshless method

The discrete least squares meshless (DLSM) method is a meshless method based on the least squares concept. The method is based on the minimization of a least squares functional, defined as the weighted summation of the squared residual of the governing differential equation and its boundary conditions at nodal points used to discretize the domain and its boundaries. While most of the existing meshless methods need background cells for numerical integration, DLSM did not require a numerical integration procedure due to the use of the discrete least squares method to discretize the governing differential equation. A Moving least squares (MLS) approximation method is used to construct the shape function, making the approach a fully least squares-based approach.

Discrete least squares meshless method

The discrete least squares meshless (DLSM) method is a meshless method based on the least squares concept. The method is based on the minimization of a least squares functional, defined as the weighted summation of the squared residual of the governing differential equation and its boundary conditions at nodal points used to discretize the domain and its boundaries. While most of the existing meshless methods need background cells for numerical integration, DLSM did not require a numerical integration procedure due to the use of the discrete least squares method to discretize the governing differential equation. A Moving least squares (MLS) approximation method is used to construct the shape function, making the approach a fully least squares-based approach.