NAOct 7, 2009
Derivation of an upper bound of the constant in the error bound for a near best m-term approximationWolfgang Karcher, Hans-Peter Scheffler, Evgeny Spodarev
In the paper "The best m-term approximation and greedy algorithms" (V. N. Temlyakov), an error bound for a near best m-term approximation of a function g in L^p([0,1]^d) is provided, using a basis L^p-equivalent to the Haar system, where p is greater than one and less than infinity and d is a natural number. The bound includes a constant C(p) that is not given explicitly. The goal of this paper is to find an upper bound of the constant for the Haar system.