The essence of invertible frame multipliers in scalability

The purpose of this paper is twofold. The first is to give some new structural results for the invertibility of Bessel multipliers. Secondly, as applications of these results, we provide some conditions regarding the scaling sequence c = { c n } n which can be used in the role of the scalability of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Advances in computational mathematics 2022-06, Vol.48 (3), Article 19
Hauptverfasser: Javanshiri, Hossein, Abolghasemi, Mohammad, Arefijamaal, Ali Akbar
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The purpose of this paper is twofold. The first is to give some new structural results for the invertibility of Bessel multipliers. Secondly, as applications of these results, we provide some conditions regarding the scaling sequence c = { c n } n which can be used in the role of the scalability of a given frame, a notion which has found more and more applications in the last decade. More precisely, we show that positive and strict scalability coincides for all frames Φ = { φ n } n with liminf n ∥ φ n ∥ > 0 which in particular provides some equivalent conditions for positive scalability of certain frames. Moreover, it is our objective to consider the effect of optimal frame bounds on the choice of scalings sequence. Along the way, the scalability of Riesz frames and Riesz bases are completely characterized and some necessary conditions for scalability of a near-Riesz basis are determined depending on its norm properties. Next, we turn our attention to the (c-)scalable bounded frame Φ and our results with the aid of the Feichtinger Conjecture give α and β , depending on the optimal frame bounds of Φ, such that the elements of the scaling sequence c should be chosen from the interval [ α , β ] for all but finitely many n . Finally, we introduce an explicit construction algorithm to produce desired invertible multiplier from the given one which is of interest in its own right.
ISSN:1019-7168
1572-9044
DOI:10.1007/s10444-022-09940-8