Lower bounds for \(n\)-term approximations. (Q1809977)

From MaRDI portal





scientific article; zbMATH DE number 1927783
Language Label Description Also known as
English
Lower bounds for \(n\)-term approximations.
scientific article; zbMATH DE number 1927783

    Statements

    Lower bounds for \(n\)-term approximations. (English)
    0 references
    15 June 2003
    0 references
    Let \(X\) be a real normed space, \(\Phi\subset X\) a subset in \(X\) (a dictionary), and \(f\in X\). The \(n\)-term approximation of an element \(f\) with respect to the dictionary \(\Phi\) is defined as \(e_n(f,\Phi,X)\equiv\inf_{P\in\Sigma_n}\| f-P\|_X\), \(\Sigma_n\equiv\left\{\sum_{j=1}^na_jx_j,a_j\in\mathbb R,x_j\in\Phi\right\}\), \(n\in\mathbb N\). Let \(\mathbb X\) be the `one-parametric family' \[ \mathbb X\equiv\{\chi_t\}_{t\in[0,1]},\quad\chi_t(x)= \begin{cases} 0 &\text{if\quad \(0\leq x<t\),}\\ 1 &\text{if\quad \(t\leq x\leq1\).}\end{cases} \] The author proves that there exists an absolute positive constant \(C\) such that for a complete arbitrary orthonormal system (o.n.s.) \(\Phi\subset L^2(0,1)\) the inequality \(e_n(\mathbb X,\Phi, L^2(0,1))\geq C^{-n}\) holds, \(n\in\mathbb N\). The problem of finding the exact value of \(C\) in this theorem remains open. However, it follows from the proof that this constant is `not too large'. If \(\Phi\) is a uniformly bounded complete o.n.s: \(\Phi = \{\varphi_j\}_{j=1}^\infty\subset L^2(0,1)\), \(\|\varphi_j\|_{L^\infty}(0,1)\leq M\), \(j\in\mathbb N,\) then for \(n\in\mathbb N\) we have \(e_n(\mathbb X,\Phi, L^2(0,1))\geq C_M/\sqrt{n}>0. \) The accuracy of this estimate can be verified by the example of trigonometric systems, for which \(e_n(\mathbb X, T, L^2) \leq Cn^{-1/2}\).
    0 references
    \(n\)-term approximation with respect to orthonormal systems
    0 references
    uniformly bounded complete orthonormal system
    0 references
    lower bound
    0 references
    normed space
    0 references
    function class
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references