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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 00:25, 5 March 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