scientific article; zbMATH DE number 2065342
Let \(\Psi=\{\psi_k\}_{k=1}^\infty\) be a subset of a Banach space \(X\). Given an element \(f \in X\) and a natural number \(m\), one may consider the \(m\)-term approximation problem: find \(g=\sum a_k\psi_k\) with at most \(m\) non-zero coefficients \(a_k\) giving a good approximation to \(f\). The paper deals with the case when \(\Psi\) is a basis for \(X\). In this case the Thresholding Greedy Algorithm can be applied, in which one starts with the expansion \(f=\sum_{k=1}^\infty c_k\psi_k\) and retains \(m\) terms with the largest norms \(\| c_k\psi_k\| \) dropping the rest. The element obtained in this way is denoted by \(G_m(f, \Psi)\). Let \[ \sigma_m(f, \Psi)=\inf \| f -\sum a_k\psi_k \| , \] where the infimum is taken over all linear combinations \(\sum a_k\psi_k\) with \(\leq m\) non-zero coefficients. Obviously, \[ \sigma_m(f, \Psi)\leq \| f-G_m(f, \Psi)\| , \] and when \(\Psi\) is an orthogonal basis in a Hilbert space, the two quantities are equal. A basis is called greedy if \[ \| f-G_m(f, \Psi)\| \leq C \sigma_m(f, \Psi), \] with \(C\) independent of \(f\), \(m\). Relations between the notions of greedy, unconditional, and the so-called democratic bases are discussed. Two concrete bases are treated in detail: the trigonometric system \(\{e^{ikx}\}_{k \in Z^d}\) in \(L_p(T^d)\) and wavelets in \(L_p(0,1)\). The paper is mainly a survey of recent known results in the area, although some new results with proofs are also given. For the entire collection see [Zbl 1028.00020].
- Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
- Greedy approximations with regard to bases
- scientific article; zbMATH DE number 2016952
- A remark on greedy approximation in Banach spaces.
- The best m-term approximation and greedy algorithms
- Nonlinear methods of approximation
- Best basis selection for approximation in \(L_p\)
- Universal bases and greedy algorithms for anisotropic function classes
- Entropy, universal coding, approximation, and bases properties
- Quasi-greedy bases for sequences with gaps
- A remark on approximation with polynomials and greedy bases
- Greedy approximation with regard to non-greedy bases
- Condition of coincidence between greedy approximations and \(m\)-term ones
- A remark on greedy approximation in Banach spaces.
- Results on non-linear approximation for wavelet bases in weighted function spaces
- scientific article; zbMATH DE number 1959425 (Why is no real title available?)
- Greedy approximation and the multivariate Haar system
- Some remarks on nonlinear approximation with Schauder bases
- Greedy approximations with regard to bases
- Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems
- Non-linear approximation by $1$-greedy bases
- The thresholding greedy algorithm versus approximations with sizes bounded by certain functions f
- The best m-term approximation with respect to polynomials with constant coefficients
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459975)
