a truly meshless local petrov-galerkin (mlpg) method is developed for solving 3d elasto-static problems. using the general mlpg concept, this method is derived through the local weak forms of the equilibrium equations, by using test functions, namely, the heaviside function. the moving least squares (mls) are chosen to construct the shape functions, for the mlpg method. the penalty approximatio...

It is a common procedure for scattered data approximation to use local polynomial fitting in the least-squares sense. An important instance is the Moving Least-Squares where the corresponding weights of the data site vary smoothly, resulting in a smooth approximation. In this paper we build upon the techniques presented by Wendland and present a somewhat simpler error analysis of the MLS approx...

We propose a new family of barycentric coordinates that have closed-forms for arbitrary 2D polygons. These coordinates are easy to compute and have linear precision even for open polygons. Not only do these coordinates have linear precision, but we can create coordinates that reproduce polynomials of a set degree m as long as degree m polynomials are specified along the boundary of the polygon....

An alternative to radial basis function interpolation and approximation is the so-called moving least squares method. As we will see below, in this method the approximation Pf to f is obtained by solving many (small) linear systems, instead of via solution of a single – but large – linear system as we did in the previous chapters. To make a connection with the previous chapters we start with th...