Abstract
Abstract
The purpose of this paper is to quantify the size of the Lebesgue constants
$(\boldsymbol {L}_m)_{m=1}^{\infty }$
associated with the thresholding greedy algorithm in terms of a new generation of parameters that modulate accurately some features of a general basis. This fine tuning of constants allows us to provide an answer to the question raised by Temlyakov in 2011 to find a natural sequence of greedy-type parameters for arbitrary bases in Banach (or quasi-Banach) spaces which combined linearly with the sequence of unconditionality parameters
$(\boldsymbol {k}_m)_{m=1}^{\infty }$
determines the growth of
$(\boldsymbol {L}_m)_{m=1}^{\infty }$
. Multiple theoretical applications and computational examples complement our study.
Publisher
Cambridge University Press (CUP)
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Mathematical Physics,Statistics and Probability,Algebra and Number Theory,Theoretical Computer Science,Analysis
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献