Date of Award
2017
Document Type
Open Access Thesis
Department
Mathematics
Sub-Department
College of Arts and Sciences
First Advisor
Pencho Petrushev
Abstract
Two algorithms for fast and accurate evaluation of high degree trigonometric polynomials at many scattered points are presented. Both methods rely on highly localized kernels and the Fast Fourier Transform. The first algorithm uses the function values at uniformly distributed grid points and kernels that reproduce trigonometric polynomials, while the second method uses kernels that approximate well the function on the frequency side. Both algorithm are termed Nonequispaced Fast Fourier Transform. The first algorithm is coded in MATLAB and shown to approximate well the function to be evaluated.
Rights
© 2017, David Hughey
Recommended Citation
Hughey, D.(2017). Nonequispaced Fast Fourier Transform. (Master's thesis). Retrieved from https://scholarcommons.sc.edu/etd/4350