On the approximation order of triangular Shepard interpolation (Q2794709)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the approximation order of triangular Shepard interpolation |
scientific article; zbMATH DE number 6554296
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the approximation order of triangular Shepard interpolation |
scientific article; zbMATH DE number 6554296 |
Statements
On the approximation order of triangular Shepard interpolation (English)
0 references
11 March 2016
0 references
triangular Shepard interpolation
0 references
bivariate interpolation
0 references
scattered data approximation
0 references
triangulation
0 references
triangle-based weight functions
0 references
quadratic approximation order
0 references
By the Shepard interpolation, a bivariate function \(f:{\mathbb R}^2 \to {\mathbb R}\) can be reconstructed as a normalized blend of its values \(f(x_j)\) at scattered distinct points \(x_j \in {\mathbb R}^2\) \((j=1,\dots,n)\), using the inverse distance to the scattered points as point-based weight functions.NEWLINENEWLINEApplying a triangulation of the scattered points and triangle-based weight functions, the triangular Shepard operator is an extension of the classical Shepard operator, which interpolates all data and reproduces linear polynomials. The authors show that this triangular Shepard operator has quadratic approximation order, which is confirmed by numerical tests.
0 references