Abstract
We study the approximation capability of the orthogonal super greedy algorithm (OSGA) with respect to μ-coherent dictionaries in Hilbert spaces. We establish the Lebesgue-type inequalities for OSGA, which show that the OSGA provides an almost optimal approximation on the first [1/(18μs)] steps. Moreover, we improve the asymptotic constant in the Lebesgue-type inequality of OGA obtained by Livshitz E D.
Funder
National Natural Science Foundation of China
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献