Abstract
An analysis of moving least squares (m.l.s.) methods for smoothing and interpolating scattered data is presented. In particular, theorems are proved concerning the smoothness of interpolants and the description of m.l.s. processes as projection methods. Some properties of compositions of the m.l.s. projector, with projectors associated with finiteelement schemes, are also considered. The analysis is accompanied by examples of univariate and bivariate problems.
Cite
CITATION STYLE
Lancaster, P., & Salkauskas, K. (1981). Surfaces generated by moving least squares methods. Mathematics of Computation, 37(155), 141–158. https://doi.org/10.1090/s0025-5718-1981-0616367-1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.