Approximations and expansions Definition
n-term approximation
Definition
Let be a real or complex normed vector space with norm , and let be a set, called the dictionary. Let be an integer. The set of -term approximants is The error of best -term approximation of is -term approximation is the approximation of elements by elements of , measured by .
Remarks
This is the error of best approximation from the set , which is a union of subspaces and not a subspace. Indeed , but in general . Example: let be a Hilbert space with orthonormal basis and . Keeping the coefficients of largest absolute value gives a best approximant, and is the sum of over the remaining indices. Check: for with , , which is smallest when and carries the largest . Non-example: in with the standard basis, is not in , since it has three nonzero coordinates. When is redundant, the best approximant may be hard to compute, and greedy algorithms are used instead.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Error of best approximation concept
- Normed vector space concept
- n-term approximation definition
Further reading
About this page
| Tag | 3TXY35FR30 |
|---|---|
| URI | m2://3TXY35FR30 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 41A46, 41A65 |
| Defines | n-term approximation |
| Uses | Normed vector space, Error of best approximation |
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.