This article is cited in 1 paper

Mathematics

On a fast algorithm for computing the Fourier transform

A. A. Aleksashkina^a, A. N. Kostromin^b, Yu. V. Nesterenko<sup>b

a</sup> Keldysh Institute of Applied Mathematics of Russian Academy of Sciences, Moscow
^b Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: This paper describes fast non-recursive algorithms for direct and inverse Fourier transforms and their new justifications.

Key words: Fourier transform, discrete transform, fast algorithms.

UDC: 511.12

Received: 22.11.2020

 English version: Moscow University Mathematics Bulletin, Moscow University Mеchanics Bulletin, 2021, 76:3, 123–128

Bibliographic databases:

• 
• 
• 
•