Related papers: A remark on approximation with polynomials and gre…
Although the basic idea behind the concept of a greedy basis had been around for some time, the formal development of a theory of greedy bases was initiated in 1999 with the publication of the article [S.~V.~Konyagin and V.~N.~Temlyakov, A…
In [3] it was proved that almost-greedy and semi-greedy bases are equivalent in the context of Banach spaces with finite cotype. In this paper we show this equivalence for general Banach spaces.
Partially greedy bases in Banach spaces were introduced by Dilworth et al. as a strictly weaker notion than the (almost) greedy bases. In this paper, we study two natural ways to strengthen the definition of partial greediness. The first…
In nonlinear greedy approximation theory, bidemocratic bases have traditionally played the role of dualizing democratic, greedy, quasi-greedy, or almost greedy bases. In this article we shift the viewpoint and study them for their own sake,…
One classical result in greedy approximation theory is that almost-greedy and semi-greedy bases are equivalent in the context of Schauder bases in Banach spaces with finite cotype. This result was proved by S. J. Dilworth, N. J. Kalton and…
We characterize the approximation spaces of a broad class of bases - which includes almost greedy bases - in terms of weighted Lorentz spaces. For those bases, we also find necessary and sufficient conditions under which the approximation…
We prove optimal embeddings for nonlinear approximation spaces in terms of weighted Lorentz sequence spaces, with the weights depending on the democracy functions of the basis. As applications we recover known embeddings for $N$-term…
Given a Banach space X and one of its compact sets F, we consider the problem of finding a good n dimensional space X_n \subset X which can be used to approximate the elements of F. The best possible error we can achieve for such an…
The list of known Banach spaces whose linear geometry determines the (nonlinear) democracy functions of their quasi-greedy bases to the extent that they end up being democratic, reduces to $c_0$, $\ell_2$, and all separable…
We use new methods, specific of non-locally convex quasi-Banach spaces, to investigate when the quasi-greedy bases of a $p$-Banach space for $0<p<1$ are democratic. The novel techniques we obtain permit to show in particular that all…
We investigate the problem of improving the greedy-type constant of a basis by means of an equivalent renorming of the ambient Banach space. Our main result shows that if a Banach space admits an unconditional and bidemocratic basis whose…
Greedy expansions with prescribed coefficients have been introduced by V. N. Temlyakov in the frame of Banach spaces. The idea is to choose a sequence of fixed (real) coefficients $\{c_n\}_{n=1}^\infty$ and a fixed set of elements…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
It is known that for a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space $\mathbb{X}$, the associated sequence $(k_{m}[\mathcal{B}])_{m=1}^{\infty}$ of its conditionality constants verifies the estimate…
We continue the study undertaken in \cite{GHN} of left democracy function $h_l(N)=\inf_{#\Lambda=N}\left\|\sum_{n\in \Lambda_N} x_n\right\| $ of an unconditional basis in a Banach space $X$. We provide an example of a basis with $h_l$…
It is known that for a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space $\mathbb{X}$, the associated sequence $(k_{m}[\mathcal{B}])_{m=1}^{\infty}$ of its conditionality constants verifies the estimate…
For the past 25 years, one of the most studied algorithms in the field of Nonlinear Approximation Theory has been the Thresholding Greedy Algorithm. In this paper, we propose new summability methods for this algorithm, generating two new…
The general theory of greedy approximation with respect to arbitrary dictionaries is well developed in the case of real Banach spaces. Recently, some of results proved for the Weak Chebyshev Greedy Algorithm (WCGA) in the case of real…
We prove that the sequence spaces $\ell_p\oplus\ell_q$ and the spaces of infinite matrices $\ell_p(\ell_q)$, $\ell_q(\ell_p)$ and $(\bigoplus_{n=1}^\infty \ell_p^n)_{\ell_q}$, which are isomorphic to certain Besov spaces, have an almost…
In this paper we study greedy approximation in Banach spaces. We discuss a modification of the Weak Chebyshev Greedy Algorithm, in which steps of the algorithm can be executed imprecisely. Such inaccuracies are represented by both absolute…