Full length article: Continuous algorithms in adaptive sampling recovery

Authors:
Dinh Dng
Affiliations:
-
Venue:
Journal of Approximation Theory
Year:
2013

Citing 8
Cited 1

Information-based complexity

Information-based complexity
s-numbers in information-based complexity

Journal of Complexity
An introduction to wavelets

An introduction to wavelets
On the power of adaption

Journal of Complexity
Continuous algorithms in n-term approximation and non-linear widths

Journal of Approximation Theory
Optimal adaptive sampling recovery

Advances in Computational Mathematics
B-spline quasi-interpolant representations and sampling recovery of functions with mixed smoothness

Journal of Complexity
Erratum to: Optimal adaptive sampling recovery

Advances in Computational Mathematics

Full length article: Best m-term trigonometric approximation of periodic functions of several variables from Nikol'skii-Besov classes for small smoothness

Journal of Approximation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study optimal algorithms in adaptive continuous sampling recovery of smooth functions defined on the unit d-cube I^d@?[0,1]^d. Functions to be recovered are in Besov space B"p","@q^@a. The recovery error is measured in the quasi-norm @?@?@?"q of L"q@?L"q(I^d),0d/p, we prove the asymptotic order @n"n(B"p","@q^@a,L"q)@?n^-^@a^/^d.