首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The Thresholding Greedy Algorithm, Greedy Bases, and Duality
Authors:SJ Dilworth  NJ Kalton  Denka Kutzarova and VN Temlyakov
Institution:(1) Department of Mathematics, University of South Carolina, Columbia, SC 29208, USA;(2) Department of Mathematics, University of Missouri-Columbia, Columbia, MO 65211, USA;(3) Institute of Mathematics, Bulgarian Academy of Sciences, Sofia, Bulgaria and Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA;(4) Department of Mathematics, University of South Carolina, Columbia, SC 29208, USA
Abstract:Some new conditions that arise naturally in the study of the Thresholding Greedy Algorithm are introduced for bases of Banach spaces. We relate these conditions to best n-term approximation and we study their duality theory. In particular, we obtain a complete duality theory for greedy bases.
Keywords:Greedy approximation  Greedy bases  Thresholding  Duality
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号