Moving least squares
Summary
Moving least squares builds a smooth function from scattered data in . At each point it fits a low-degree polynomial to the data by weighted least squares, with weights that favour data points close to . The value of the reconstruction at is the value of this local fit at . As moves, the weights and so the local polynomial change continuously, which gives a smooth global approximation. It is a basic tool of multivariate interpolation and approximation, of surface reconstruction from point clouds and of meshfree methods for differential equations.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | T0JZN6WP5X |
|---|---|
| URI | m2://T0JZN6WP5X |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65D10, 41A63, 65D05 |
| Same as |
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.