Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
From MaRDI portal
A method, called minimal-variable oblique elimination is developed for implementing parallel computation of discrete Fourier transforms on linear, or mesh-connected, arrays of processors. Before explicit describing this factorization, the author discusses necessary and sufficient conditions for its practice and proves then the applicability of this technique to compute discrete Fourier transforms of all orders. Complexity in the computation is also estimated.
Recommendations
Cites work
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 3140885 (Why is no real title available?)
- scientific article; zbMATH DE number 3880785 (Why is no real title available?)
- scientific article; zbMATH DE number 3829220 (Why is no real title available?)
- scientific article; zbMATH DE number 3907805 (Why is no real title available?)
- scientific article; zbMATH DE number 3928865 (Why is no real title available?)
- scientific article; zbMATH DE number 3658896 (Why is no real title available?)
- scientific article; zbMATH DE number 3688765 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1208927 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Matrix identities of the fast Fourier transform
- Parallel calculation of a linear mapping on a computer network
- Parallel realization of permutations over trees
- The Implementation of Fast Radix 2 Transforms on Array Processors
- The Relationship Between Two Fast Fourier Transforms
- Winograd's Fourier transform via circulants
Cited in
(6)- A parallel scheme of discrete and fast Fourier transforms based on a polynomial representation of the basis.
- Bidiagonal factorization of Fourier matrices and systolic algorithms for computing discrete Fourier transforms
- Interlacing Properties of Tridiagonal Symmetric Matrices with Applications to Parallel Computing
- A New Representation of FFT Algorithms Using Triangular Matrices
- On the computation of the SVD of Fourier submatrices
- Displacement operator based decompositions of matrices using circulants or other group matrices
This page was built for publication: Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103363)
