Moving least squares
Builds on Weighted least squaresPolynomials in several variablesEuclidean distance
Definition
Let and , and let be the space of polynomials in variables of total degree at most . Let be pairwise distinct, let , and let be a weight function. For , let minimise the weighted least squares error over , where is the Euclidean norm. The moving least squares approximation of the data is the function , defined at every where this minimiser is unique.
Remarks
The minimiser is unique when the points with include a unisolvent set for . In general only approximates the data; singular weights, such as in the example below, make it interpolate. If the data come from a polynomial in , then reproduces that polynomial.
Example: and for , with , at a point that is not a data point. Then is the constant , where . Extended by the data values at the data points, this is inverse distance weighting.
Non-example: with constant weights the fit is an ordinary least squares fit. It gives the same polynomial at every , so the result is one global polynomial. The dependence of the weights on , the "moving" feature, is lost.
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
- Polynomials in several variables concept
- Weighted least squares concept
- Moving least squares definition
Further reading
About this page
| Tag | 9HWTPQHHZK |
|---|---|
| URI | m2://9HWTPQHHZK |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65D10, 41A63, 65D05 |
| Defines | Moving least squares |
| Uses | Weighted least squares, Polynomials in several variables, 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.