Optimal adaptive sampling recovery

DSpace/Manakin Repository

Optimal adaptive sampling recovery

Show simple item record


dc.contributor.author Dung, D.
dc.date.accessioned 2011-05-05T03:25:55Z
dc.date.available 2011-05-05T03:25:55Z
dc.date.issued 2011
dc.identifier.citation Volume: 34 Issue: 1 Page : 1-41 vi
dc.identifier.issn 10197168
dc.identifier.uri http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/6596
dc.description.abstract We propose an approach to study optimal methods of adaptive sampling recovery of functions by sets of a finite capacity which is measured by their cardinality or pseudo-dimension. Let W ?? Lq, 0 < q ?? ??, be a class of functions on Id. For B a subset in Lq, we define a sampling recovery method with the free choice of sample points and recovering functions from B as follows. For each f ?? W we choose n sample points. This choice defines n sampled values. Based on these sampled values, we choose a function from B for recovering f. The choice of n sample points and a recovering function from B for each f ?? W defines a sampling recovery method SB n by functions in B. vi
dc.language.iso en vi
dc.publisher Advances in Computational Mathematics vi
dc.subject Adaptive sampling recovery vi
dc.subject B-spline vi
dc.subject Besov space vi
dc.subject Quasi-interpolant wavelet representation vi
dc.title Optimal adaptive sampling recovery vi
dc.type Article vi

Files in this item

Files Size Format View
26.pdf 50.71Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account