Approximations and expansions Basic notions Concept
Best approximation
Summary
A best approximation of a point from a set in a normed space is a point of nearest to . It is the optimal answer to an approximation problem. Existence, uniqueness and characterization of best approximations are the first questions of approximation theory.
Where this leads
10 pages build on this one.
- Rational approximation
- Uniqueness of best approximation in strictly convex spaces
- Existence of best approximations from finite-dimensional subspaces
- Error of best approximation
- Haar's uniqueness theorem
- Kolmogorov criterion for best approximation
- Chebyshev set
- Approximation theory
- Equioscillation theorem
- Zolotarev polynomials
Further reading
About this page
| Tag | 7N4988HN3P |
|---|---|
| URI | m2://7N4988HN3P |
| Kind | concept |
| Writing | W0 stub |
| MSC | 41A50, 41A65 |
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
Special cases
Used by
- Rational approximation
- Uniqueness of best approximation in strictly convex spaces
- Existence of best approximations from finite-dimensional subspaces
- Error of best approximation
- Haar's uniqueness theorem
- Kolmogorov criterion for best approximation
- Chebyshev set
- Approximation theory
- Equioscillation theorem
- Zolotarev polynomials
Results about this
- Uniqueness of best approximation in strictly convex spaces
- Existence of best approximations from finite-dimensional subspaces
- Haar's uniqueness theorem
- Kolmogorov criterion for best approximation
- Equioscillation theorem