arXiv · 2012.06963
The Arithmetic Fourier Transform
Abstract
The Arithmetic Fourier Transform is a numerical formulation for computing Fourier series and Taylor series coefficients. It competes with the Fast Fourier Transform in terms of speed and efficiency, requiring only addition operations and can be performed by parallel processing. The AFT has some deep connections with the Prime Number Theorem and its rich history is discussed in this expository article.
Explore related subjects
Keep this discovery
Joel L. Schiff. 2020-12-13. The Arithmetic Fourier Transform. https://arxiv.org/abs/2012.06963
Cite the original work for its findings. Save a collection to share your selection of sources.