English
Related papers

Related papers: On Approximation Spaces and Greedy-type Bases

200 papers

We generalize several theorems of R\'enyi, Parry, Dar\'oczy and K\'atai by characterizing the greedy and quasi-greedy expansions in non-integer bases.

Number Theory · Mathematics 2007-10-17 Claudio Baiocchi , Vilmos Komornik

We show that a (semi-normalized) basis in a Banach space is quasi-greedy with quasi-greedy constant equal to 1 if and only if it is unconditional with suppression-unconditional constant equal to 1.

Functional Analysis · Mathematics 2015-04-20 Fernando Albiac , Jose L. Ansorena

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,…

Functional Analysis · Mathematics 2021-06-01 Fernando Albiac , Jose L. Ansorena , Miguel Berasategui , Pablo M. Berna , Silvia Lassalle

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…

Functional Analysis · Mathematics 2022-08-22 Fernando Albiac , José L. Ansorena , Glenier Bello

In this paper, motivated by the notion of $w$-Property $(A)$ defined in [2], we introduce the notions of $w$-left Property $(A)$ and $w$-right Property $(A)$. We also introduce the notions of $w$-partially greedy basis (using a…

Functional Analysis · Mathematics 2018-09-14 Divya Khurana

For a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space the associated conditionality constants $k_{m}[\mathcal{B}]$ verify the estimate $k_{m}[\mathcal{B}]=\mathcal{O}(\log m)$. Answering a question raised by Temlyakov, Yang,…

Functional Analysis · Mathematics 2017-02-22 Fernando Albiac , José L. Ansorena , Przemysław Wojtaszczyk

We show that, for quasi-greedy bases in Hilbert spaces, the associated conditionality constants grow at most as $O(\log N)^{1-\epsilon}$, for some $\epsilon>0$, answering a question by Temlyakov. We show the optimality of this bound with an…

Functional Analysis · Mathematics 2013-01-22 G. Garrigos , P. Wojtaszczyk

We present various estimates for the Lebesgue constants of the thresholding greedy algorithm, in the case of general bases in Banach spaces. We show the optimality of these estimates in some situations. Our results recover and slightly…

Functional Analysis · Mathematics 2016-06-22 Pablo M. Berná , Gustavo Garrigós , Óscar Blasco

We prove thatthe Banach space $(\oplus_{n=1}^\infty \ell_p^n)_{\ell_q}$, which is isomorphic to certain Besov spaces, has a greedy basis whenever $1\leq p \leq\infty$ and $1<q<\infty$. Furthermore, the Banach spaces $(\oplus_{n=1}^\infty…

Functional Analysis · Mathematics 2009-10-21 S. J. Dilworth , D. Freeman , E. Odell , Th. Schlumprecht

We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…

Statistics Theory · Mathematics 2009-09-29 Andrew R. Barron , Albert Cohen , Wolfgang Dahmen , Ronald A. DeVore

We present convergence estimates of two types of greedy algorithms in terms of the metric entropy of underlying compact sets. In the first part, we measure the error of a standard greedy reduced basis method for parametric PDEs by the…

Numerical Analysis · Mathematics 2024-10-29 Yuwen Li , Jonathan Siegel

We construct for each $0<p\le 1$ an infinite collection of subspaces of $\ell_p$ that extend the example from [J. Lindenstrauss, On a certain subspace of $\ell_{1}$, Bull. Acad. Polon. Sci. S\'er. Sci. Math. Astronom. Phys. 12 (1964),…

Functional Analysis · Mathematics 2019-12-19 Fernando Albiac , José L. Ansorena , Przemysław Wojtaszczyk

Property~(A) is a week symmetry condition that plays a fundamental role in the characterization of greedy-type bases in the isometric case, i.e., when the constants involved in the study of the efficiency of the thresholding greedy…

Functional Analysis · Mathematics 2024-09-10 Fernando Albiac , Jose L. Ansorena , Pablo Berná , Miguel Berasategui

We study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements…

Machine Learning · Statistics 2012-06-05 V. N. Temlyakov

Elton's near unconditionality and quasi-greediness for largest coefficients are two properties of bases that made their appearance in functional analysis from very different areas of research. One of our aims in this note is to show that,…

Functional Analysis · Mathematics 2022-09-09 Fernando Albiac , José L. Ansorena , Miguel Berasategui

We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation times a function of N which depends on the democracy…

Functional Analysis · Mathematics 2012-07-05 Gustavo Garrigós , Eugenio Hernández , Timur Oikhberg

We present new convergence estimates of generalized empirical interpolation methods in terms of the entropy numbers of the parametrized function class. Our analysis is transparent and leads to sharper convergence rates than the classical…

Numerical Analysis · Mathematics 2026-02-24 Yuwen Li

We show that the Lindenstrauss basic sequence in l_1 may be used to construct a conditional quasi-greedy basis of l_1, thus answering a question of Wojtaszczyk. We further show that the sequence of coefficient functionals for this basis is…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , David Mitra

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…

Functional Analysis · Mathematics 2023-07-06 Alessandro Oliaro , Luca Tomatis , Albert R. Valiullin , Artur R. Valiullin

We give criteria for finding the greedy $\beta$-expansion for $1$ for families of Salem numbers that approach a given Pisot number. We show that these expansions are related to the greedy expansion under the Pisot base. This expands on the…

Number Theory · Mathematics 2025-04-16 Kevin G. Hare , Liam Orovec