Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



The approximation power of moving least-squares

Author: David Levin
Journal: Math. Comp. 67 (1998), 1517-1531
MSC (1991): Primary 41A45; Secondary 41A25
MathSciNet review: 1474653
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: A general method for near-best approximations to functionals on $\mathbb{R}^d$, 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 $\mathbb{R}^d$ is shown to be a $C^\infty$ function, and an approximation order result is proven for quasi-uniform sets of data points.

References [Enhancements On Off] (What's this?)

  • [Ab] F. Abramovici, 1984 The Shepard interpolation as the best average of a set of data, Technical Report, Tel-Aviv University.
  • [BDL] M.D. Buhmann, N. Dyn and D. Levin, 1995 On quasi-interpolation by radial basis functions with scattered centers, Constructive Approximation 11 239-254. MR 96h:41038
  • [BG1] G. Backus and F. Gilbert, 1967 Numerical applications of a formalism for geophysical inverse problems, Geophys. J.R. Astr. Soc. 13 247-276.
  • [BG2] G. Backus and F. Gilbert, 1968 The resolving power of gross Earth data, Geophys. J.R. Astr. Soc. 16 169-205.
  • [BG3] G. Backus and F. Gilbert, 1970 Uniqueness in the inversion of inaccurate gross Earth data, Philos. Trans. Roy. Soc. London, Ser. A, 266 123-192. MR 56:7763
  • [BS] L. Bos and K. Salkauskas, 1989 Moving least-squares are Backus-Gilbert optimal, J. Approx. Theory 59 267-275. MR 91a:41003
  • [DLR] N. Dyn, D. Levin and S. Rippa, 1990 Data dependent triangulation for piecewise linear interpolation, IMA J. Numer. Anal. 10 137-154. MR 91a:65022
  • [Fa1] R. Farwig, 1986 Rate of convergence of Shepard's global interpolation formula, Math. Comp. 46, No. 174, 577-590. MR 88a:65015
  • [Fa2] R. Farwig, 1986 Multivariate interpolation of arbitrarily spaced data by moving least squares methods, J. Comput. Appl. Math. 16 79-93. MR 87j:65013
  • [Fr] R. Franke, 1982 Scattered data interpolation: Tests of some methods, Math. Comp. 38, No. 157, 181-200. MR 82m:65008
  • [FrNi] R. Franke and G. Nielson, 1980 Smooth interpolation of large sets of scattered data, Internat. J. Numer. Methods Engrg. 15 1691-1704. MR 82d:65011
  • [LS] P. Lancaster and K. Salkauskas, 1981 Surfaces generated by moving least squares methods, Math. Comp. 37, no. 155, 141-158. MR 83c:65015
  • [Mc1] D. H. McLain, 1974 Drawing contours from arbitrary data points, Comput. J. 17 318-324.
  • [Mc2] D. H. McLain, 1976 Two dimensional interpolation from random data, Comput. J. 19 178-181. MR 55:4601
  • [Sh] D. Shepard, 1968 A two dimensional interpolation function for irregularly spaced data, Proc. 23th Nat. Conf. ACM, 517-523.

Similar Articles

Retrieve articles in Mathematics of Computation of the American Mathematical Society with MSC (1991): 41A45, 41A25

Retrieve articles in all journals with MSC (1991): 41A45, 41A25

Additional Information

David Levin
Affiliation: School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel

Received by editor(s): September 7, 1995
Received by editor(s) in revised form: September 4, 1996, and March 28, 1997
Article copyright: © Copyright 1998 American Mathematical Society

American Mathematical Society