|
Matematicheskoe modelirovanie, 1990, Volume 2, Number 4, Pages 88–96
(Mi mm2357)
|
|
|
|
Computational methods and algorithms
On parallel calculations for discrete Fourier transformation
V. A. Leus Institute of Mathematics, Siberian Branch of USSR Academy of Sciences
Abstract:
The problem of asymptotic estimate of the time complexity of numerical Fourier transformation is considered. The conditions are found under which a well known estimation may be achieved. It is shown that a contradiction between FFT and DFT under these conditions is not reasonable.
Received: 25.11.1989
Citation:
V. A. Leus, “On parallel calculations for discrete Fourier transformation”, Matem. Mod., 2:4 (1990), 88–96
Linking options:
https://www.mathnet.ru/eng/mm2357 https://www.mathnet.ru/eng/mm/v2/i4/p88
|
Statistics & downloads: |
Abstract page: | 434 | Full-text PDF : | 256 | References: | 1 | First page: | 1 |
|