Best basis selection for approximation in \(L_p\)
type: Item
instance of: scholarly article
title: Best basis selection for approximation in \(L_p\)
zbMATH Open document ID: 1067.41012
author: Guergana Petrova
author: Ronald DeVore
author: V. N. Temlyakov
published in: Foundations of Computational Mathematics
publication date: 2003-08-26T00:00:00Z
review text: This interesting paper on multivariate approximation extends the results of \textit{D.L. Donoho} [Appl. Comput. Harmon. Anal. 1, 100--115 (1993; Zbl 0796.62083)] from \(L_2\) to \(L_p\), \(p\neq 2\). Any extension of approximation results from \(L_2\) to \(L_p\) requires a substitute of the notion of orthonormal bases in \(L_2\). For this purpose, the authors use greedy bases in \(L_p\) (introduced by \textit{S. Konyagin} and \textit{V. Temlyakov} [East J. Approx. 5, 365-379 (1999; Zbl 1084.46509)]) which are democratic and unconditional bases in \(L_p\). In this paper, the authors study the approximation of a function class \({\mathcal F}\) in \(L_p\) by choosing first a basis \(B\) and then using \(n\)-term approximation with the elements of \(B\). Into the competition for best bases, all greedy bases in \(L_p\) are entered. The authors show that if the function class \({\mathcal F}\) is well-oriented with respect to a particular basis \(B\) then, in a certain sense, this basis is the best choice for this type of approximation.
Mathematics Subject Classification ID: 41A30
Mathematics Subject Classification ID: 42C40
Mathematics Subject Classification ID: 46B70
zbMATH DE Number: 1971444
zbMATH Keywords: \(n\)-term approximation
zbMATH Keywords: best basis
zbMATH Keywords: degree of approximation
zbMATH Keywords: greedy basis
zbMATH Keywords: democratic basis
zbMATH Keywords: unconditional basis
zbMATH Keywords: approximation in \(L_p\)
reviewed by: Manfred Tasche
MaRDI profile type: Publication
full work available at URL: s10208-002-0056-8
OpenAlex ID: W2330706847
DOI: 10.1007/S10208-002-0056-8
description: scientific article; zbMATH DE number 1971444