论文标题
算术傅立叶变换
The Arithmetic Fourier Transform
论文作者
论文摘要
算术傅立叶变换是用于计算傅立叶系列和泰勒系列系数的数值公式。它在速度和效率方面与快速的傅立叶变换竞争，仅需要附加操作，并且可以通过并行处理执行。船尾与质数定理有一些深厚的联系，并且在本说的文章中讨论了其丰富的历史。
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.
