Article ID Journal Published Year Pages File Type
4643360 Journal of Computational and Applied Mathematics 2006 13 Pages PDF
Abstract
The classical smoothing data problem is analyzed in a Sobolev space under the assumption of white noise. A Fourier series method based on regularization endowed with generalized cross validation is considered to approximate the unknown function. This approximation is globally optimal, i.e., the mean integrated squared error reaches the optimal rate in the minimax sense. In this paper the pointwise convergence property is studied. Specifically, it is proved that the smoothed solution is locally convergent but not locally optimal. Examples of functions for which the approximation is subefficient are given. It is shown that optimality and superefficiency are possible when restricting to more regular subspaces of the Sobolev space.
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Authors
, ,