The best m-term approximation and greedy algorithms

@article{Temlyakov1998TheBM,
  title={The best m-term approximation and greedy algorithms},
  author={Vladimir N. Temlyakov},
  journal={Adv. Comput. Math.},
  year={1998},
  volume={8},
  pages={249-265}
}
Two theorems on nonlinear m-term approximation in L p , 1 < p < 1, are proved in this paper. The rst one (Theorem 2.1) says that if a basis := f I g I is L p-equivalent to the Haar basis then near best m-term approximation to any f 2 L p can be realized by the following simple greedy type algorithm. Take the expansion f = P I c I I and form a sum of m terms… CONTINUE READING