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

DOI10.1016/0024-3795(88)90325-4zbMATH Open0645.65097OpenAlexW1965533562WikidataQ114215322 ScholiaQ114215322MaRDI QIDQ1103363FDOQ1103363

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

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

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• Winograd's Fourier transform via circulants
• The Relationship Between Two Fast Fourier Transforms
• Title not available (Why is that?)
• 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

Cited In (6)

• A New Representation of FFT Algorithms Using Triangular Matrices
• 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 parallel scheme of discrete and fast Fourier transforms based on a polynomial representation of the basis.
• 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)