Approximations and expansions Best approximation and Chebyshev systems Concept
Least squares approximation
Summary
Least squares approximation replaces a function by the element of a given finite-dimensional family that is closest in a mean square sense. It is the best approximation in an inner product space, so it is the orthogonal projection onto the family. Unlike the uniform best approximation, it is found by solving a linear system, and an orthogonal basis makes it explicit. It is the function version of the least squares method for linear systems.
Further reading
About this page
| Tag | 2QV28WYQTQ |
|---|---|
| URI | m2://2QV28WYQTQ |
| Kind | concept |
| Writing | W0 stub |
| MSC | 41A10, 65D10, 41A50 |
| Specializes | Best approximation |
| 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.