Approximation of scattered data using smooth grid functions (Q1899980): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:09, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation of scattered data using smooth grid functions |
scientific article |
Statements
Approximation of scattered data using smooth grid functions (English)
0 references
29 April 1996
0 references
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).
0 references
scattered data approximation
0 references
smoothing
0 references
smooth grid functions
0 references
dense and sparse data
0 references
operator design
0 references
blended operators
0 references