Greedy Algorithms and Best m-term Approximation with Respect to Biorthogonal Systems
01 January 2001
(Title was originally Greedy Algorithms and Best m-term Approximation with Respect to Minimal Systems) The paper extends upon previous work by Temlyakov on comparing the error of certain greedy algorithms with that of best m-term approximation with respect to a minimal system in a Banach space X. An abstract set of conditions is given which covers upper and lower bounds and applies to almost all previously considered special cases. We give also some new examples concerning L sub (inf) and BMO approximation.