Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms

DOI10.1016/0024-3795(88)90325-4MaRDI QIDQ1103363zbMATH OpenOpenAlexWikidataFDO

Authors Paul Gader

Publication date 1988

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(88)90325-4

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• Bidiagonal factorization of Fourier matrices and systolic algorithms for computing discrete Fourier transforms
• Parallel Factorizations for Tridiagonal Matrices
• scientific article; zbMATH DE number 3997125
• scientific article; zbMATH DE number 97099
• scientific article; zbMATH DE number 1131691

Cites work

• 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?)
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• 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)

• Displacement operator based decompositions of matrices using circulants or other group matrices
• Interlacing Properties of Tridiagonal Symmetric Matrices with Applications to Parallel Computing
• A parallel scheme of discrete and fast Fourier transforms based on a polynomial representation of the basis.
• A New Representation of FFT Algorithms Using Triangular Matrices
• On the computation of the SVD of Fourier submatrices
• Bidiagonal factorization of Fourier matrices and systolic algorithms for computing discrete Fourier transforms

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)