[Authors]
 V. N. Malozemov and O. V. Prosekov

[Title]
 On the fast Fourier transform of small orders

[AMS Subj-class]
 65T50 Discrete and fast Fourier transforms
 15A23 Factorization of matrices

[Abstract]
 In order to minimize the number of additions when computing
 the discrete Fourier transform, it is proposed to carry out
 a factorization of the matrices of pre-summations
 and post-summations, where each factor contains no more
 than two nonzero entries in each row. Such a factorization
 is not unique, and this allows us to impose additional
 conditions. This paper presents the "perfect" factorizations
 of the discrete Fourier transform matrices of order 3, 4, 5,
 and 6.

[Comments]
 LaTeX, 10 pp., Russian

[Contact e-mail]
 malv@gamma.math.spbu.ru