Characterization of approximation schemes satisfying Shapiro's Theorem
Classical Analysis and ODEs
2010-03-19 v2 Functional Analysis
Abstract
In this paper we characterize the approximation schemes that satisfy Shapiro's theorem and we use this result for several classical approximation processes. In particular, we study approximation of operators by finite rank operators and n-term approximation for several dictionaries and norms. Moreover, we compare our main theorem with a classical result by Yu. Brundyi and we show two examples of approximation schemes that do not satisfy Shapiro's theorem.
Cite
@article{arxiv.0910.2826,
title = {Characterization of approximation schemes satisfying Shapiro's Theorem},
author = {J. M. Almira},
journal= {arXiv preprint arXiv:0910.2826},
year = {2010}
}
Comments
This paper has been withdrawn by the author because a full revision of it, with new and powerful contents, has been made with the help of another author and now the paper has been transformed in another completely different one which is common work with T. Oikhberg