Asymptotic methods in statistical theory
Asymptotic methods in statistical theory
Fast Fourier transforms for nonequispaced data
SIAM Journal on Scientific Computing
Fast Fourier transforms for non-equispaced data
Fast Fourier transforms for non-equispaced data
A regularization method for discrete Fourier polynomials
SPOA VII Proceedings of the seventh Spanish symposium on Orthogonal polynomials and applications
Recent results on the regularization of Fourier polynomials
Applied Mathematics and Computation
Convergence for the regularized inversion of Fourier series
Journal of Computational and Applied Mathematics
The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms
SIAM Journal on Scientific Computing
Adaptive wavelet series estimation in separable nonparametric regression models
Statistics and Computing
Modern Applied Statistics with S
Modern Applied Statistics with S
Hi-index | 7.29 |
The approximation of a function affected by noise in several dimensions suffers from the so-called "curse of dimensionality". In this paper a Fourier series method based on regularization is developed both for uniform and random design when a restriction on the complexity of the curve such as additivity is considered in order to circumvent the problem. Optimal convergence theorems are stated and numerical experiments are shown on several test problems available in the literature together with comparisons with alternative methods.