An algorithm for fast Hilbert transform of real functions (Q489778): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10444-014-9345-4 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013719492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for estimating instantaneous frequency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Hilbert Transform on the Real Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel method for computing the Hilbert transform with Haar multiresolution approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing with the Hilbert spline transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5289009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More efficient computation of the complex error function / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10444-014-9345-4 / rank
 
Normal rank

Latest revision as of 19:10, 9 December 2024

scientific article
Language Label Description Also known as
English
An algorithm for fast Hilbert transform of real functions
scientific article

    Statements

    An algorithm for fast Hilbert transform of real functions (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2015
    0 references
    The authors propose an algorithm for the discretization of the Hilbert transform on the real line of the function \( f(x)\) \[ H_{R}f(x)=\frac{1}{\pi} p. v.\int^{\infty}_{- \infty}\frac{f(y)dy}{x-y}, \] using the linear interpolation. The complexity of this algorithm is reduced to \( O(N \log N)\) comparatively with other known methods of complexity \( O( N^{2})\), where \( N \) is a number of grid points.
    0 references
    Hilbert integral transform
    0 references
    linear interpolation
    0 references
    spline interpolation
    0 references
    error estimate
    0 references
    B-spline
    0 references
    fast Fourier transform
    0 references
    discrete trigonometric transform
    0 references
    algorithm
    0 references
    complexity
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references