The best m-term approximation with respect to polynomials with constant coefficients

DOI10.1007/S10476-017-0302-6MaRDI QIDQ682149zbMATH OpenOpenAlexFDO

Authors Oscar Blasco, Pablo M. Berná

Publication date 13 February 2018

Published in Analysis Mathematica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.07250

zbMATH Keywords

\(m\)-term approximationthresholding greedy algorithmweight-greedy basis

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Abstract: In this paper we show that that greedy bases can be defined as those where the error term using $m$-greedy approximant is uniformly bounded by the best $m$-term approximation with respect to polynomials with constant coefficients in the context of the weak greedy algorithm and weights.

Recommendations

• scientific article; zbMATH DE number 1959425
• Greedy approximation and the multivariate Haar system
• On the m-term approximation in L^1(0, 1) in the Haar system
• scientific article; zbMATH DE number 2016952
• Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
• Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
• Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems
• Characterization of 1-greedy bases
• scientific article; zbMATH DE number 2065342
• Some remarks on nonlinear approximation with Schauder bases

Cites work

• scientific article; zbMATH DE number 1959425 (Why is no real title available?)
• A remark on greedy approximation in Banach spaces.
• Characterization of 1-almost greedy bases
• Characterization of 1-greedy bases
• Characterization of greedy bases in Banach spaces
• Greedy algorithm for general biorthogonal systems
• Greedy approximation
• Multiresolution approximations and wavelet bases of weighted \(L^p\) spaces
• Renorming spaces with greedy bases
• Restricted non-linear approximation in sequence spaces and applications to wavelet bases and interpolation
• Restricted nonlinear approximation
• The Haar wavelet characterization of weighted Herz spaces and greediness of the Haar wavelet basis
• The Haar wavelets and the Haar scaling function in weighted \(L^p\) spaces with \(A^{dy,m}_p\) weights
• The best \(m\)-term approximation and greedy algorithms
• The thresholding greedy algorithm, greedy bases, and duality
• Wavelets, Orlicz spaces, and greedy bases

Cited in

(6)

• Condition of coincidence between greedy approximations and \(m\)-term ones
• Generalized polynomial approximation providing the best reference
• A remark on approximation with polynomials and greedy bases
• Weight-almost greedy bases
• The weighted property (A) and the greedy algorithm
• Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems

This page was built for publication: The best \(m\)-term approximation with respect to polynomials with constant coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682149)