Approximation of scattered data using smooth grid functions (Q1899980): Difference between revisions

The authors present a three-stage scheme for constructing smooth grid functions approximating data defined over scattered point sets in \(\mathbb{R}^s\). A section with consistent examples is included dealing with: dense and sparse data, operator design, blended operators. The authors present the main advantage (the generality and the method is easily to be implemented) and the main disadvantages (the approximant does not depend continuously on the data and the method becomes time consuming as the grid space is reduced).