Inverse distance weighting
Builds on Multivariate interpolationMetric spaceEuclidean distance
Definition
Let be a metric space, usually with the Euclidean distance. Let be pairwise distinct, let , and let . For and with , put . The inverse distance weighting interpolant of the data is the function given as follows. If is not one of the , then At the data points, for .
Remarks
The interpolant reproduces the data by definition, and it is continuous at each , because as while the other weights stay bounded. Each value is a convex combination of the , so . This scheme is also called Shepard's method. It is the case of constant fits with weight in moving least squares.
Example: on with , data at and at , at the weights are and . So , which lies between and .
Non-example: the plain average with equal weights does not depend on the distances and does not reproduce the data; for the same data it gives at .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean distance concept
- Metric space concept
- Multivariate interpolation concept
- Inverse distance weighting definition
Further reading
About this page
| Tag | 55V8WAJXXJ |
|---|---|
| URI | m2://55V8WAJXXJ |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65D05, 41A05, 41A63 |
| Defines | Inverse distance weighting |
| Uses | Multivariate interpolation, Metric space, Euclidean distance |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.