Best approximation with wavelets in weighted Orlicz spaces (Q639951)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5956833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Best approximation with wavelets in weighted Orlicz spaces |
scientific article; zbMATH DE number 5956833 |
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
0 references
0.9209283590316772
0 references
0.829788863658905
0 references
0.8203920722007751
0 references
0.8154506087303162
0 references
0.8091681599617004
0 references
