Bibliographic Details
| Title: |
A direct method and parallel algorithm for general N-dimensional FFT |
| Authors: |
You, Zhaoyong, Li, Lei |
| Publisher Information: |
Zhejiang University Press, Zhejiang |
| Subject Terms: |
Complexity and performance of numerical algorithms, transform matrix, sequential and parallel algorithms, complexity, orthogonal transformation, fast Fourier transform, Numerical methods for discrete and fast Fourier transforms |
| Description: |
Summary: We directly set up an \(N\)-dimensional transform matrix for a kind of general \(N\)-dimensional orthogonal transformation which is widely used. The calculation for the transformation by this matrix is obviously less than that by the usual methods. As application, we give the formulae and the complexity of the sequential and parallel algorithms for the general \(N\)-dimensional direct fast Fourier transform (FFT), as well as the quantity of its calculation. |
| Document Type: |
Article |
| File Description: |
application/xml |
| Access URL: |
https://zbmath.org/123335 |
| Accession Number: |
edsair.c2b0b933574d..d74896c7c17e47b048a3927e41eb7a75 |
| Database: |
OpenAIRE |