Lebesgue inequalities for Chebyshev thresholding greedy algorithms (Q2206762): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Created claim: Wikidata QID (P12): Q127218617, #quickstatements; #temporary_batch_1722270516152
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Pablo M. Berná / rank
 
Normal rank
Property / author
 
Property / author: Timur Oikhberg / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Vasile Postolică / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2975218920 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1811.04268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of 1-almost greedy bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional quasi-greedy bases in non-superreflexive Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between almost-greedy and semi-greedy bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of greedy bases in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lebesgue inequalities for the greedy algorithm in general bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded orthonormal system of polygonals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of almost greedy bases in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The thresholding greedy algorithm, greedy bases, and duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lebesgue constants for the weak greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good can a nonhereditary family be? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lebesgue-type inequalities for quasi-greedy bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biorthogonal systems in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4439542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Classification of Biorthogonal Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lebesgue constants for Chebyshev thresholding greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3920145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm and \(m\)-term trigonometric approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best \(m\)-term approximation and greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fejér means of bounded Ciesielski systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm for general biorthogonal systems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127218617 / rank
 
Normal rank

Latest revision as of 17:29, 29 July 2024

scientific article
Language Label Description Also known as
English
Lebesgue inequalities for Chebyshev thresholding greedy algorithms
scientific article

    Statements

    Lebesgue inequalities for Chebyshev thresholding greedy algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 October 2020
    0 references
    The authors give important results and comment on Chebyshev thresholding greedy algorithms by the investigations of the numerical behaviours for the Chebyshevian Lebesgue parameters,under pertinent examples and references.
    0 references
    Chebyshev thresholding greedy algorithm
    0 references
    Chebyshevian Lebesgue parameter
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references