PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 1981Mathematics of Computation2,488 citationsOpen Access

Surfaces generated by moving least squares methods

PLPeter LancasterKŠK. Šalkauskas

Key Points

Key points are not available for this paper at this time.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Lancaster et al. (1981) studied this question.

synapsesocial.com/papers/69e7ccd6f291c16dced6e64ehttps://doi.org/10.1090/s0025-5718-1981-0616367-1
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Smooth interpolation of large sets of scattered data1980 · 484 citations
  2. 2Moving Weighted Least-Squares Methods1979 · 25 citations
  3. 3Shepard's Method of "Metric Interpolation" to Bivariate and Multivariate Interpolation1978 · 52 citations
  4. 4Higher order compatible triangular finite elements1974 · 20 citations
  5. 5A two-dimensional interpolation function for irregularly-spaced data1968 · 5,093 citations