Best approximation with wavelets in weighted Orlicz spaces (Q639951)

From MaRDI portal
Revision as of 12:13, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Best approximation with wavelets in weighted Orlicz spaces
scientific article

    Statements

    Best approximation with wavelets in weighted Orlicz spaces (English)
    0 references
    11 October 2011
    0 references
    The author studies the efficiency of wavelet greedy algorithms in the weighted Orlicz space \(L^\Phi(w)\) defined for functions in \(\mathbb{R}^d\). In particular, she shows that wavelets bases are greedy in \(L^\Phi(w)\) if and only if this space coincides with \(L^p(w)\), for some \(1<p<\infty\) (admissible wavelets bases are not democratic in weighted Orlicz spaces).
    0 references
    greedy algorithm
    0 references
    non-linear approximation
    0 references
    weighted Orlicz spaces
    0 references
    approximation spaces
    0 references
    weighted Besov spaces
    0 references

    Identifiers

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