Winograd's Fourier transform via circulants

DOI10.1016/0024-3795(82)90217-8zbMATH Open0515.65099OpenAlexW1997901254MaRDI QIDQ1052079FDOQ1052079

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) Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)

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?)
• Is computing with the finite Fourier transform pure or applied mathematics?
• On the inversion of circulant matrices
• On Computing the Discrete Fourier Transform
• Matrix identities of the fast Fourier transform

Cited In (4)

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

This page was built for publication: Winograd's Fourier transform via circulants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1052079)