Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning

DOI10.4310/CIS.2005.V5.N1.A2zbMath1140.65375OpenAlexW2008914219MaRDI QIDQ820192

Antonio Arico, Stefano Serra Capizzano, Manfred Tasche

Publication date: 6 April 2006

Published in: Communications in Information and Systems (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.cis/1149698472

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16)

Related Items (2)

Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms ⋮ A discrete Hartley transform based on Simpson's rule

This page was built for publication: Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning