An algorithm for fast Hilbert transform of real functions

DOI10.1007/S10444-014-9345-4zbMATH Open1311.65161OpenAlexW2013719492MaRDI QIDQ489778FDOQ489778

Authors Roberto Bilato, Omar Maj, Marco Brambilla 

Publication date 21 January 2015

Published in Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11858/00-001M-0000-0024-69BE-2

zbMATH Keywords

algorithmcomplexityerror estimatefast Fourier transformB-splinelinear interpolationspline interpolationdiscrete trigonometric transformHilbert integral transform

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical methods for integral transforms (65R10) Numerical methods for discrete and fast Fourier transforms (65T50) Special integral transforms (Legendre, Hilbert, etc.) (44A15)

Recommendations

• A stable and convergent algorithm to evaluate Hilbert transform
• An algorithm for the rapid evaluation of special function transforms
• Fast Hankel transform algorithm
• A dual algorithm for fast calculation of the \(H^ 1_ 0\)-transform
• The Fast Hartley Transform Algorithm
• On a fast algorithm for computing the Fourier transform
• A fast algorithm for computing the Hankel transform of order 1
• Hilbert transforms using fast Fourier transforms
• scientific article; zbMATH DE number 3956396
• Fast Algorithms for Polynomial Time-Frequency Transforms of Real-Valued Sequences

Cites Work

• scientific article; zbMATH DE number 914800 (Why is no real title available?)
• scientific article; zbMATH DE number 274399 (Why is no real title available?)
• A novel method for computing the Hilbert transform with Haar multiresolution approximation
• Algorithms for estimating instantaneous frequency
• Computing the Hilbert Transform on the Real Line
• More efficient computation of the complex error function
• On computing with the Hilbert spline transform
• Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems
• The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis

Cited In (17)

• On computing with the Hilbert spline transform
• A fast Hermite transform
• On computing the analytic-signal backbone of the unforced harmonic oscillator
• Computing the Hilbert Transform on the Real Line
• Simultaneous approximation of Hilbert and Hadamard transforms on bounded intervals
• A novel method for computing the Hilbert transform with Haar multiresolution approximation
• A fast algorithm for computing the Hankel transform of order 1
• Hilbert transforms using fast Fourier transforms
• Fast Hankel transform algorithm
• A method for the practical evaluation of the Hilbert transform on the real line
• On a 1D model with nonlocal interactions and mass concentrations: an analytical-numerical approach*
• Multi-domain spectral approach for the Hilbert transform on the real line
• A stable and convergent algorithm to evaluate Hilbert transform
• A numerical scheme for doubly nonlocal conservation laws
• Computing the Hilbert transform in wavelet bases on adaptive grids
• Computing the Hilbert transform and its inverse
• The Hilbert transform of cubic splines

Uses Software

• FFTW
• TORIC-SSFPQL

This page was built for publication: An algorithm for fast Hilbert transform of real functions

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