Conversion of FFT’s to Fast Hartley Transforms
- 1 April 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 7 (2) , 624-638
- https://doi.org/10.1137/0907042
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Discrete Hartley transformJournal of the Optical Society of America, 1983
- Vectorizing the FFTs**This chapter was written while the author was visiting the Scientific Computing Division at the National Bureau of Standards.Published by Elsevier ,1982
- Principles and capabilities of 3-D, E-M particle simulationsJournal of Computational Physics, 1980
- Stable Methods for Evaluating the Points cos(iπ/n)IMA Journal of Applied Mathematics, 1975
- Inversion of the Helmholtz (or Laplace-Poisson) operator for slab geometryJournal of Computational Physics, 1973
- Numerical Analysis: A fast fourier transform algorithm for real-valued seriesCommunications of the ACM, 1968
- Algorithm 279: Chebyshev quadratureCommunications of the ACM, 1966
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- A More Symmetrical Fourier Analysis Applied to Transmission ProblemsProceedings of the IRE, 1942