Renorming spaces with greedy bases (Q468457)

Greedy methods are one of the central approaches in approximation theory and applications. For this, greedy bases are required to generate the appropriate approximation sub-spaces of Banach spaces. Greedy or democracy constants are associated with these bases, where for instance the greedy constant is the factor by which the error of the greedy approximation and the smallest possible error differ, and improvements are derived in this article for the constants of such bases.