A parallel scheme of discrete and fast Fourier transforms based on a polynomial representation of the basis.

MaRDI QIDQ3430218zbMATH OpenFDO

Authors Ya. E. Romm, S. A. Firsova

Publication date 21 March 2007

Full work available at URL http://mathnet.ru/eng/mm/v18/i11/p3

zbMATH Keywords

algorithmsdiscrete Fourier transformfast Fourier transformFourier series summationparallel computation

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• Publication:4720677
• The Future Fast Fourier Transform?
• Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
• scientific article; zbMATH DE number 3997125

Cited in

(2)

• scientific article; zbMATH DE number 4129953 (Why is no real title available?)
• scientific article; zbMATH DE number 2067903 (Why is no real title available?)

This page was built for publication: A parallel scheme of discrete and fast Fourier transforms based on a polynomial representation of the basis.

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