Math 2.0

Approximations and expansions Definition

n-term approximation

Builds on Normed vector spaceError of best approximation

Definition

Let XX be a real or complex normed vector space with norm ∥⋅∥\norm{\cdot}, and let 𝒟⊆X\mathcal{D} \subseteq X be a set, called the dictionary. Let n≥1n \ge 1 be an integer. The set of nn-term approximants is Σn(𝒟)={∑k=1nckgk:ck scalars, gk∈𝒟}.\Sigma_n(\mathcal{D}) = \set{\textstyle\sum_{k=1}^{n} c_k g_k : c_k \text{ scalars}, \ g_k \in \mathcal{D}} . The error of best nn-term approximation of f∈Xf \in X is σn(f,𝒟)=inf⁡{∥f−g∥:g∈Σn(𝒟)}.\sigma_n(f, \mathcal{D}) = \inf\set{\norm{f - g} : g \in \Sigma_n(\mathcal{D})} . nn-term approximation is the approximation of elements f∈Xf \in X by elements of Σn(𝒟)\Sigma_n(\mathcal{D}), measured by σn(f,𝒟)\sigma_n(f, \mathcal{D}).

Remarks

This is the error of best approximation from the set Σn(𝒟)\Sigma_n(\mathcal{D}), which is a union of subspaces and not a subspace. Indeed Σn+Σn⊆Σ2n\Sigma_n + \Sigma_n \subseteq \Sigma_{2n}, but in general Σn+Σn≠Σn\Sigma_n + \Sigma_n \ne \Sigma_n. Example: let XX be a Hilbert space with orthonormal basis 𝒟=(ej)\mathcal{D} = (e_j) and f=∑jajejf = \sum_j a_j e_j. Keeping the nn coefficients aja_j of largest absolute value gives a best approximant, and σn(f,𝒟)2\sigma_n(f, \mathcal{D})^2 is the sum of ∣aj∣2\abs{a_j}^2 over the remaining indices. Check: for g=∑j∈Scjejg = \sum_{j \in S} c_j e_j with ∣S∣≤n\abs{S} \le n, ∥f−g∥2=∑j∈S∣aj−cj∣2+∑j∉S∣aj∣2\norm{f - g}^2 = \sum_{j \in S} \abs{a_j - c_j}^2 + \sum_{j \notin S} \abs{a_j}^2, which is smallest when cj=ajc_j = a_j and SS carries the largest ∣aj∣\abs{a_j}. Non-example: in ℝ3\R^3 with the standard basis, 3e1+e2+2e33e_1 + e_2 + 2e_3 is not in Σ2\Sigma_2, since it has three nonzero coordinates. When 𝒟\mathcal{D} 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Error of best approximation concept
  2. Normed vector space concept
  3. n-term approximation definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Sparse_approximation
About this page
Tag3TXY35FR30
URIm2://3TXY35FR30
Kinddefinition
WritingW0 stub
MSC41A46, 41A65
Definesn-term approximation
UsesNormed 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.