On a fast algorithm for computing the Fourier transform

DOI10.3103/S0027132221030025OpenAlexW3201531384MaRDI QIDQ2666937

A. N. Kostromin, A. A. Aleksashkina, Yuri V. Nesterenko

Publication date: 23 November 2021

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132221030025

zbMATH Keywords

Fourier transformfast algorithmsdiscrete transform

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Computational number theory (11Yxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Fast multiplication of large numbers
• Fast Integer Multiplication Using Modular Arithmetic
• Faster Integer Multiplication
• Faster integer multiplication using plain vanilla FFT primes
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: On a fast algorithm for computing the Fourier transform