Winograd's Fourier transform via circulants

DOI10.1016/0024-3795(82)90217-8zbMath0515.65099OpenAlexW1997901254MaRDI QIDQ1052079

Beresford N. Parlett

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0024-3795(82)90217-8

zbMATH Keywords

discrete Fourier transformreal arithmeticassociated circulant matriceseigenvalue-eigenvector decompositionWinograd's algorithm

Mathematics Subject Classification ID

Factorization of matrices (15A23) Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items

Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms, Circulants, inversion of circulants, and some related matrix algebras, Displacement operator based decompositions of matrices using circulants or other group matrices, Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix identities of the fast Fourier transform
• Is computing with the finite Fourier transform pure or applied mathematics?
• On Computing the Discrete Fourier Transform
• On the inversion of circulant matrices