Greedy Algorithm for General Biorthogonal Systems Original Research Article

We consider biorthogonal systems in quasi-Banach spaces such that the greedy algorithm converges for each x∈X (quasi-greedy systems). We construct quasi-greedy conditional bases in a wide range of Banach spaces. We also compare the greedy algorithm for the multidimensional Haar system with the optimal m-term approximation for this system. This substantiates a conjecture by Temlyakov.