activity
20182026
collaborators
Showing 2022Show all

6 papers · 1 filter

math.FA2022

Non-linear approximation by -greedy bases

Pablo M. Berná, David González

The theory of greedy-like bases started in 1999 when S. V. Konyagin and V. N. Temlyakov introduced in \cite{KT} the famous Thresholding Greedy Algorithm. Since this year, different…

math.NA2022

Universality for non-linear convex variational problems

Pablo M. Berná, Antonio Falcó

This article introduces an innovative mathematical framework designed to tackle non-linear convex variational problems in reflexive Banach spaces. Our approach employs a versatile…

math.FA2022

Extensions and new characterizations of some greedy-type bases

Miguel Berasategui, Pablo M. Berná, Hung Viet Chu

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

math.FA2022

On Approximation Spaces and Greedy-type Bases

Pablo M. Berná, Hung Viet Chu, Eugenio Hernández

The purpose of this paper is to introduce -Chebyshev-greedy and -partially greedy approximation classes and to study their relation with -approximation spaces, where the l…

math.FA2022

Extensions of democracy-like properties for sequences with gaps

Miguel Berasategui, Pablo M. Berná

In \cite{O2015}, T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps. In this paper, we extend some of the notions that app…

math.FA2022

On some characterizations of greedy-type bases

Pablo M. Berná, Hung Viet Chu

In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. Since then, there have been many interesting and useful characterizations of gre…