Skip to main content
Article thumbnail
Location of Repository

The approximation power of moving least-squares

By David Levin

Abstract

Abstract. A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented by the Backus-Gilbert approach. It is shown that the method works very well for interpolation, smoothing and derivatives ’ approximations. For the interpolation problem this approach gives Mclain’s method. The method is near-best in the sense that the local error is bounded in terms of the error of a local best polynomial approximation. The interpolation approximation in Rd is shown to be a C ∞ function, and an approximation order result is proven for quasi-uniform sets of data points. 1

Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.192.4293
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ams.org/journals/mc... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.