Conversion of FFT’s to Fast Hartley Transforms
From MaRDI portal
Publication:4727384
DOI10.1137/0907042zbMath0617.65144OpenAlexW1965666210MaRDI QIDQ4727384
Publication date: 1986
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0907042
fast Fourier transformfast Hartley transformFORTRAN programcomplex Fourier transformdecimation, bit reversaltabulation of trigonometric functionstransform economies
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
On a set of matrix algebras related to discrete Hartley-type transforms ⋮ Hartley preconditioners for Toeplitz systems generated by positive continuous functions ⋮ A stable Richardson iteration method for complex linear systems ⋮ Numerical solution of three-dimensional magnetic differential equations ⋮ A pseudospectral method for two-point boundary value problems
This page was built for publication: Conversion of FFT’s to Fast Hartley Transforms
