An algorithm for fast Hilbert transform of real functions (Q489778)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for fast Hilbert transform of real functions |
scientific article; zbMATH DE number 6388525
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for fast Hilbert transform of real functions |
scientific article; zbMATH DE number 6388525 |
Statements
An algorithm for fast Hilbert transform of real functions (English)
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
0.8995929
0 references
0.89833695
0 references
0 references
0.8940273
0 references
0 references
0.8929512
0 references
0.89135647
0 references
0.8886405
0 references