10 citations · 18 across the 15 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.FA2020
Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
Miguel Berasategui, Silvia Lassalle
We introduce and study the notion of weak semi-greedy systems -which is inspired in the concepts of semi-greedy and Branch semi-greedy systems and weak thresholding sets-, and prov…
math.FA2020
Strong partially greedy bases and Lebesgue-type inequalities
Miguel Berasategui, Pablo M. Berná, Silvia Lassalle
In this paper we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgu…