Exact computation in numerical linear algebra: The discrete Fourier transform

MaRDI QIDQ2776695zbMATH OpenFDO

Authors Peter K. Sweby, J. A. D. W. Anderson

Publication date 11 April 2002

zbMATH Keywords

discrete Fourier transformencodingrational affine transformationsrational rotationstotal trigonometric functionstransrational numbers

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 5521053
• scientific article; zbMATH DE number 3862403
• scientific article; zbMATH DE number 4100583
• Rapid Computation of the Discrete Fourier Transform
• Fast and numerically stable algorithms for discrete cosine transforms

Cited in

(6)

• Exact discretization by Fourier transforms
• Applications of the generalized Fourier transform in numerical linear algebra
• Bidiagonal factorization of Fourier matrices and systolic algorithms for computing discrete Fourier transforms
• scientific article; zbMATH DE number 5521053 (Why is no real title available?)
• Vector computation of the discrete Fourier transform
• scientific article; zbMATH DE number 1979263 (Why is no real title available?)

This page was built for publication: Exact computation in numerical linear algebra: The discrete Fourier transform

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