Recent results on the regularization of Fourier polynomials (Q1805260): Difference between revisions

The authors have proved elsewhere [Numer. Algorithms 5, No. 1-4, 419-424 (1993; Zbl 0806.65144)] that the regularized Fourier polynomials obtained by using the convolution of the given function \(f\) with uniform probability density or with Gaussian probability density are the same as the ones obtained by minimizing a certain functional, essentially involving \(f\), the Fourier polynomial and suitable weights. It is shown in the paper that the foregoing approach could be extended to a fairly wide class of convolution kernels. A characterization of this class is also obtained.