Lebesgue inequalities for Chebyshev thresholding greedy algorithms (Q2206762)

From MaRDI portal
Revision as of 17:29, 29 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127218617, #quickstatements; #temporary_batch_1722270516152)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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