Existence of the best \(n\)-term approximants for structured dictionaries

DOI10.1007/S00013-012-0406-YzbMath1253.41022OpenAlexW2140988847MaRDI QIDQ444118

Paweł Bechler

Publication date: 13 August 2012

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00013-012-0406-y

zbMATH Keywords

framesBessel inequalitybest approximationsnonlinear approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Cites Work

• Localized frames are finite unions of Riesz sequences
• Frames containing a Riesz basis and approximation of the frame coefficients using finite-dimensional methods
• On Lebesgue-type inequalities for greedy approximation
• Frames, Riesz bases, and discrete Gabor/wavelet expansions
• Stable recovery of sparse overcomplete representations in the presence of noise
• Sparse representations in unions of bases
• Greedy approximation
• Perturbations of Banach Frames and Atomic Decompositions
• A Class of Nonharmonic Fourier Series
• An introduction to frames and Riesz bases

This page was built for publication: Existence of the best \(n\)-term approximants for structured dictionaries