Approximations and expansions Definition
Best approximation
Builds on Normed vector spaceInfimum
Definition
Let be a normed vector space, let be nonempty, and let . A point is a best approximation of from if Equivalently, , an infimum that is attained at .
Remarks
Example: in with the Euclidean norm, let be the horizontal axis and . For one has , with equality only at , so is the best approximation.
Non-example: in , let and . The infimum of over is , but no attains it, so has no best approximation from .
Other names are nearest point and, in the uniform norm, minimax approximation. The set of best approximations of from can be empty, a single point, or larger.
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
- Normed vector space concept
- Set bounded above definition
- Infimum definition
- Best approximation definition
Further reading
About this page
| Tag | XEEZ2MQ6XM |
|---|---|
| URI | m2://XEEZ2MQ6XM |
| Kind | definition |
| Writing | W0 stub |
| MSC | 41A50, 41A65 |
| Defines | Best approximation |
| Uses | Normed vector space, Infimum |
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.