论文标题

关于贪婪型基础的某些特征

On some characterizations of greedy-type bases

论文作者

Berná, Pablo M., Chu, Hung Viet

论文摘要

1999年,S。V。Konyagin和V. N. Temlyakov引入了所谓的阈值贪婪算法。从那时起,Banach空间中贪婪的型基础存在许多有趣且有用的特征。在本文中,我们研究并扩展了文献中贪婪和几乎贪婪基础的几种特征。一路上,我们举了各种例子来补充我们的主要结果。此外,我们提出了一种新版本的所谓弱阈值贪婪算法(WTGA),并表明该新算法的收敛性等同于WTGA的收敛性。

In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. Since then, there have been many interesting and useful characterizations of greedy-type bases in Banach spaces. In this article, we study and extend several characterizations of greedy and almost greedy bases in the literature. Along the way, we give various examples to complement our main results. Furthermore, we propose a new version of the so-called Weak Thresholding Greedy Algorithm (WTGA) and show that the convergence of this new algorithm is equivalent to the convergence of the WTGA.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源