Universal bases and greedy algorithms for anisotropic function classes
type: Item
instance of: scholarly article
title: Universal bases and greedy algorithms for anisotropic function classes
zbMATH Open document ID: 1025.41009
published in: Constructive Approximation
publication date: 2003-12-02T00:00:00Z
review text: We suggest a three-step strategy to find a good basis (dictionary) for nonlinear \(m\)-term approximation. The first step consists of solving an optimization problem of finding a near best basis for a given function class \(F\), when we optimize over a collection \({\mathbf D}\) of bases (dictionaries). The second step is devoted to finding a universal basis (dictionary) \({\mathcal D}_u\in {\mathbf D}\) for a given pair \(({\mathcal F},{\mathbf D})\) of collections: \({\mathcal F}\) of function classes and \({\mathbf D}\) of bases (dictionaries). This means that \({\mathcal D}_u\) provides near optimal approximation for each class \(F\) from a collection \({\mathcal F}\). The third step deals with constructing a theoretical algorithm that realizes near best \(m\)-term approximation with regard to \({\mathcal D}_u\) for function classes from \({\mathcal F}\). In this paper we work this strategy out in the model case of anisotropic function classes and the set of orthogonal bases. The results are positive. We construct a natural tensor-product-wavelet-type basis and prove that it is universal. Moreover, we prove that a greedy algorithm realizes near best \(m\)-term approximation with regard to this basis for all anisotropic function classes.
Mathematics Subject Classification ID: 41A25
Mathematics Subject Classification ID: 41A46
zbMATH DE Number: 1885734
author: V. N. Temlyakov
reviewed by: László Leindler
MaRDI profile type: Publication
full work available at URL: s00365-002-0514-1
OpenAlex ID: W2048008303
cites work: Q4215356
cites work: Hyperbolic wavelet approximation
cites work: On best continuous methods in \(n\)-term approximation
cites work: Q3704371
cites work: On best \(m\)-term approximations and the entropy of sets in the space \(L^ 1\)
cites work: A remark on greedy approximation in Banach spaces.
cites work: Q4136031
cites work: Q5343579
cites work: Entropy numbers of diagonal operators between symmetric Banach spaces
cites work: Q3965058
cites work: Q4348451
cites work: Nonlinear Kolmogorov widths
cites work: Greedy algorithms with regard to multivariate systems with special structure
cites work: Q3255495
cites work: On unconditional polynomial bases in \(L_ p\) and Bergman spaces
DOI: 10.1007/S00365-002-0514-1
description: scientific article; zbMATH DE number 1885734