Fourierova a Čebyševova aproximace

Abstract

This bachelor's thesis deals with numerical approximation of functions by polynomial interpolation, approximation by Chebyshev polynomials, least squares method and Fourier approximation. The work presents theoretical foundations of each method, analyses their properties and points out their interrelations. Furthermore, efficient algorithms for computing approximations using Chebyshev polynomials and Fourier series with time complexity O(n log n) are derived.