arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.0460math.FA
收藏

Lebesgue-Type inequalities for quasi-greedy bases

Eugenio Hernández

英文摘要:

We show that for quasi-greedy bases in real Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N-term error of approximation times a constant which depends on the democracy functions and the quasi-greedy constant of the basis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑