Answers are grounded in this paper and cite their sources.
A general method for near-best approximations to functionals on R d 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 R d R^d is shown to be a C ∞ C^∞ function, and an approximation order result is proven for quasi-uniform sets of data points.
No takes yet. Share an insight, caveat, or question.
David Levin (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: