Numerical Analysis: A fast fourier transform algorithm for real-valued series

DOI10.1145/364096.364118MaRDI QIDQ5551899zbMATH OpenOpenAlexFDO

Authors G. D. Bergland

Publication date 1968

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/364096.364118

zbMATH Keywords

numerical analysis

Cited in

(7)

• Fast mixed-radix real Fourier transforms
• Direct methods for the solution of the discrete Poisson equation: some comparisons
• Sine transform based preconditioners for symmetric Toeplitz systems
• Direct methods for the solution of Poisson's equation on a staggered grid
• Efficient algorithms for the discrete Gabor transform with a long FIR window
• An efficient generalized least squares algorithm for periodic trended regression with autoregressive errors
• Carousel: fully homomorphic encryption with bootstrapping over automorphism group

This page was built for publication: Numerical Analysis: A fast fourier transform algorithm for real-valued series

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