Best approximation with wavelets in weighted Orlicz spaces (Q639951): Difference between revisions

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).