The Arithmetic Fourier Transform

MaRDI QIDQ6355932zbMATH OpenFDO

Authors J. L. Schiff

Publication date 13 December 2020

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Function theory on the disc (30J99) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16)

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.

This page was built for publication: The Arithmetic Fourier Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355932)