Standard

Fast Fourier transform of small orders. / Malozemov, V. N.; Prosekov, O. V.

In: Vestnik Sankt-Peterburgskogo Universiteta. Ser 1. Matematika Mekhanika Astronomiya, No. 1, 2003, p. 36-45.

Research output: Contribution to journalArticlepeer-review

Harvard

Malozemov, VN & Prosekov, OV 2003, 'Fast Fourier transform of small orders', Vestnik Sankt-Peterburgskogo Universiteta. Ser 1. Matematika Mekhanika Astronomiya, no. 1, pp. 36-45.

APA

Malozemov, V. N., & Prosekov, O. V. (2003). Fast Fourier transform of small orders. Vestnik Sankt-Peterburgskogo Universiteta. Ser 1. Matematika Mekhanika Astronomiya, (1), 36-45.

Vancouver

Malozemov VN, Prosekov OV. Fast Fourier transform of small orders. Vestnik Sankt-Peterburgskogo Universiteta. Ser 1. Matematika Mekhanika Astronomiya. 2003;(1):36-45.

Author

Malozemov, V. N. ; Prosekov, O. V. / Fast Fourier transform of small orders. In: Vestnik Sankt-Peterburgskogo Universiteta. Ser 1. Matematika Mekhanika Astronomiya. 2003 ; No. 1. pp. 36-45.

BibTeX

@article{376e84e7f8644f1dbf3505845b3deb3e,
title = "Fast Fourier transform of small orders",
abstract = "Each factor contains no more than two nonzero entries in each row. Such a factorization is not unique, and this allows to obtain additional conditions. The perfect factorizations of the discrete Fourier transform matrices of third, fourth, fifth and sixth orders. The fast Fourier transform is based on factorization of the discrete Fourier transform matrix into the product of three matrices: the pre-summation matrix, the diagonal matrix and the post-summation matrix.",
author = "Malozemov, {V. N.} and Prosekov, {O. V.}",
note = "Copyright: Copyright 2008 Elsevier B.V., All rights reserved.",
year = "2003",
language = "русский",
pages = "36--45",
journal = "ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. МАТЕМАТИКА. МЕХАНИКА. АСТРОНОМИЯ",
issn = "1025-3106",
publisher = "Издательство Санкт-Петербургского университета",
number = "1",

}

RIS

TY - JOUR

T1 - Fast Fourier transform of small orders

AU - Malozemov, V. N.

AU - Prosekov, O. V.

N1 - Copyright: Copyright 2008 Elsevier B.V., All rights reserved.

PY - 2003

Y1 - 2003

N2 - Each factor contains no more than two nonzero entries in each row. Such a factorization is not unique, and this allows to obtain additional conditions. The perfect factorizations of the discrete Fourier transform matrices of third, fourth, fifth and sixth orders. The fast Fourier transform is based on factorization of the discrete Fourier transform matrix into the product of three matrices: the pre-summation matrix, the diagonal matrix and the post-summation matrix.

AB - Each factor contains no more than two nonzero entries in each row. Such a factorization is not unique, and this allows to obtain additional conditions. The perfect factorizations of the discrete Fourier transform matrices of third, fourth, fifth and sixth orders. The fast Fourier transform is based on factorization of the discrete Fourier transform matrix into the product of three matrices: the pre-summation matrix, the diagonal matrix and the post-summation matrix.

UR - http://www.scopus.com/inward/record.url?scp=2542573896&partnerID=8YFLogxK

M3 - статья

AN - SCOPUS:2542573896

SP - 36

EP - 45

JO - ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. МАТЕМАТИКА. МЕХАНИКА. АСТРОНОМИЯ

JF - ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. МАТЕМАТИКА. МЕХАНИКА. АСТРОНОМИЯ

SN - 1025-3106

IS - 1

ER -

ID: 73934586