Math 2.0

Numerical analysis Definition

Moving least squares

Builds on Weighted least squaresPolynomials in several variablesEuclidean distance

Definition

Let d≥1d \ge 1 and m≥0m \ge 0, and let Πm\Pi_m be the space of polynomials in dd variables of total degree at most mm. Let x1,…,xN∈ℝdx_1, \dots, x_N \in \R^d be pairwise distinct, let f1,…,fN∈ℝf_1, \dots, f_N \in \R, and let θ ⁣:[0,∞)→[0,∞)\theta \colon [0, \infty) \to [0, \infty) be a weight function. For x∈ℝdx \in \R^d, let px∈Πmp_x \in \Pi_m minimise the weighted least squares error ∑i=1Nθ(∥x−xi∥) (p(xi)−fi)2\sum_{i=1}^{N} \theta(\norm{x - x_i}) \, \bigl(p(x_i) - f_i\bigr)^2 over p∈Πmp \in \Pi_m, where ∥⋅∥\norm{\cdot} is the Euclidean norm. The moving least squares approximation of the data is the function f^(x)=px(x)\hat f(x) = p_x(x), defined at every xx where this minimiser is unique.

Remarks

The minimiser is unique when the points xix_i with θ(∥x−xi∥)>0\theta(\norm{x - x_i}) > 0 include a unisolvent set for Πm\Pi_m. In general f^\hat f only approximates the data; singular weights, such as in the example below, make it interpolate. If the data come from a polynomial in Πm\Pi_m, then f^\hat f reproduces that polynomial.

Example: m=0m = 0 and θ(r)=r−p\theta(r) = r^{-p} for r>0r > 0, with p>0p > 0, at a point xx that is not a data point. Then pxp_x is the constant ∑iθifi/∑iθi\sum_i \theta_i f_i / \sum_i \theta_i, where θi=θ(∥x−xi∥)\theta_i = \theta(\norm{x - x_i}). Extended by the data values at the data points, this is inverse distance weighting.

Non-example: with constant weights θ=1\theta = 1 the fit is an ordinary least squares fit. It gives the same polynomial px=pp_x = p at every xx, so the result is one global polynomial. The dependence of the weights on xx, 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Euclidean distance concept
  2. Polynomials in several variables concept
  3. Weighted least squares concept
  4. Moving least squares definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Moving_least_squares
About this page
Tag9HWTPQHHZK
URIm2://9HWTPQHHZK
Kinddefinition
WritingW0 stub
MSC65D10, 41A63, 65D05
DefinesMoving least squares
UsesWeighted 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.