General Haar systems and greedy approximation
The author generalizes the classical dyadic Haar system by replacing the sequence of dyadic points with an arbitrary dense sequence of points in [0,1]. It is proved that for each general Haar system \(H_T\) obtained in this way there exists a permutation of a subsequence of the dyadic Haar system which is equivalent to \(H_T\) in each \(L^p([0,1])\) \((1<p<\infty)\). Furthermore, it is shown that each normalized general Haar system is a greedy base in \(L^p([0,1])\). In addition, a general Haar system is constructed whose tensor products are greedy bases in each \(L^p([0,1]^d)\) \((1<p<\infty\), \(d\in\mathbb{N})\).
- Greedy algorithm with regard to Haar subsystems
- Greedy approximation and the multivariate Haar system
- scientific article; zbMATH DE number 5082668
- Greedy bases in \(L^p\) spaces
- On a greedy algorithm in \(L^{1}(0, 1)\) with regard to subsystems of the Haar system and on \(\omega \)-quasigreedy bases
- scientific article; zbMATH DE number 5082668 (Why is no real title available?)
- Greedy algorithm with regard to Haar subsystems
- Haar problem for sign-sensitive approximations
- scientific article; zbMATH DE number 2016952 (Why is no real title available?)
- On greedy algorithm in \(L^{1}(0, 1)\) by regular Haar system
- Greedy approximation and the multivariate Haar system
- Some new Fourier and Jackson-Nikol'skii type inequalities in unbounded orthonormal systems
- scientific article; zbMATH DE number 6432678 (Why is no real title available?)
- Approximation with greedy basis on the example of Haar system in Lorentz spaces
- divergence of Fourier series in the general Haar system
- Greedy bases for Besov spaces
This page was built for publication: General Haar systems and greedy approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2717571)
