The approximation power of moving least-squares
- 1 October 1998
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 67 (224), 1517-1531
- https://doi.org/10.1090/s0025-5718-98-00974-0
Abstract
A general method for near-best approximations to functionals on , 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 is shown to be a function, and an approximation order result is proven for quasi-uniform sets of data points.Keywords
This publication has 14 references indexed in Scilit:
- On quasi-interpolation by radial basis functions with scattered centresConstructive Approximation, 1995
- Data Dependent Triangulations for Piecewise Linear InterpolationIMA Journal of Numerical Analysis, 1990
- Moving least-squares are Backus-Gilbert optimalJournal of Approximation Theory, 1989
- Multivariate interpolation of arbitrarily spaced data by moving least squares methodsJournal of Computational and Applied Mathematics, 1986
- Rate of Convergence of Shepard's Global Interpolation FormulaMathematics of Computation, 1986
- Scattered Data Interpolation: Tests of Some MethodMathematics of Computation, 1982
- Surfaces Generated by Moving Least Squares MethodsMathematics of Computation, 1981
- Smooth interpolation of large sets of scattered dataInternational Journal for Numerical Methods in Engineering, 1980
- Two Dimensional Interpolation from Random DataThe Computer Journal, 1976
- Uniqueness in the inversion of inaccurate gross Earth dataPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1970