This paper is devoted to the acceleration of the convergence of the partial sums of the classical Fourier series for the sufficiently smooth functions. Some universal and adaptive algorithms are constructed and studied. It is shown that the use of a finite number of Fourier coefficients makes it possible exact approximation of a given function from an infinite-dimensional set of quasi-polynomials. In this sense, we call the corresponding essentially nonlinear algorithms as over-convergent.
The proposed algorithms are implemented using Wolfram Mathematica system. Numerical results demonstrate their effectiveness.