An algorithm for fast Hilbert transform of real functions

DOI10.1007/s10444-014-9345-4zbMath1311.65161OpenAlexW2013719492MaRDI QIDQ489778

Omar Maj, Roberto Bilato, 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

complexityalgorithmfast Fourier transformspline interpolationerror estimateB-splinelinear interpolationdiscrete trigonometric transformHilbert integral transform

Mathematics Subject Classification ID

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

Related Items

On a 1D model with nonlocal interactions and mass concentrations: an analytical-numerical approach* ⋮ The Hilbert transform of cubic splines ⋮ On computing the analytic-signal backbone of the unforced harmonic oscillator

Uses Software

• FFTW
• TORIC-SSFPQL

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for estimating instantaneous frequency
• Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems
• On computing with the Hilbert spline transform
• A novel method for computing the Hilbert transform with Haar multiresolution approximation
• The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis
• More efficient computation of the complex error function
• Computing the Hilbert Transform on the Real Line