Greedy algorithm and \(m\)-term trigonometric approximation
From MaRDI portal
Publication:1281675
DOI10.1007/S003659900090zbMath0931.42002OpenAlexW2003782981MaRDI QIDQ1281675
Publication date: 14 February 2000
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003659900090
Trigonometric approximation (42A10) Best approximation, Chebyshev systems (41A50) Approximation by other special function classes (41A30)
Related Items (45)
Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces ⋮ Lebesgue constants for Chebyshev thresholding greedy algorithms ⋮ Lebesgue-type inequalities in greedy approximation ⋮ Efficiency of weak greedy algorithms for \(m\)-term approximations ⋮ New parameters and Lebesgue-type estimates in greedy approximation ⋮ Sparse signal recovery via generalized Gaussian function ⋮ An extrapolation theorem for nonlinear approximation and its applications ⋮ Obituary: Nigel John Kalton, 1946-2010 ⋮ On the divergence of greedy algorithms with respect to Walsh subsystems in \(L\) ⋮ Lebesgue inequalities for the greedy algorithm in general bases ⋮ Lebesgue-type inequalities for quasi-greedy bases ⋮ Democratic systems of translates ⋮ Weak thresholding greedy algorithms in Banach spaces ⋮ Lorentz spaces and embeddings induced by almost greedy bases in superreflexive Banach spaces ⋮ Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases ⋮ Adaptive Fourier series---a variation of greedy algorithm ⋮ Greedy approximation with regard to non-greedy bases ⋮ Best trigonometric and bilinear approximations of classes of functions of several variables ⋮ Lebesgue inequalities for Chebyshev thresholding greedy algorithms ⋮ Approximation of classes \(B_{p,\theta}^r\) of periodic functions of one and several variables ⋮ Best \(m\)-term one-sided trigonometric approximation of some function classes defined by a kind of multipliers ⋮ Vector greedy algorithms ⋮ On convergence of greedy algorithm by Walsh system in the space \(C(0, 1)\) ⋮ Multiple Haar basis and \(m\)-term approximations for functions from the Besov classes. I ⋮ A Theory on Non-Constant Frequency Decompositions and Applications ⋮ On the convergence of a weak greedy algorithm for the multivariate Haar basis ⋮ Greedy Algorithms and Rational Approximation in One and Several Variables ⋮ Adaptive algorithms of nonlinear approximation with finite terms ⋮ Divergence of the greedy algorithm in the Faber-Schauder system on a continuum cardinality set ⋮ Best \(m\)-term trigonometric approximation of periodic functions of several variables from Nikol'skii-Besov classes for small smoothness ⋮ Greedy algorithm for general biorthogonal systems ⋮ An example of an almost greedy uniformly bounded orthonormal basis for \(L_p(0,1)\) ⋮ Characterizations of democratic systems of translates on locally compact abelian groups ⋮ Two‐dimensional adaptive Fourier decomposition ⋮ Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems ⋮ Trigonometric quasi-greedy bases for \(L^p(\mathbf T;w)\) ⋮ Simultaneous approximation by greedy algorithms ⋮ Trigonometric bases for matrix weighted \(L_p\)-spaces ⋮ Almost periodic functions and their applications: a survey of results and perspectives ⋮ Results on Non-linear Approximation for Wavelet Bases in Weighted Function Spaces ⋮ Strong partially greedy bases and Lebesgue-type inequalities ⋮ Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries ⋮ Greedy approximation with respect to certain subsystems of the Walsh orthonormal system ⋮ On the convergence of greedy approximants of trigonometric Fourier series ⋮ SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
This page was built for publication: Greedy algorithm and \(m\)-term trigonometric approximation
