Author/Authors :
Bernard Delyon، نويسنده , , Anatoli Juditsky، نويسنده ,
Abstract :
We consider fast algorithms of wavelet decomposition of a functionfwhen discrete observations off(supp f⊆[0, 1]d) are available. The properties of the algorithms are studied for three types of observation design which ford=1 can be described as follows: the regular design, when the observationsf(xi) are taken on the regular gridxi=i/N,i=1, …, N; the case of a jittered regular grid, when it is only known that for all 1⩽i⩽N,i/N⩽xi
Journal title :
Journal of Approximation Theory
Journal title :
Journal of Approximation Theory