Fast Algorithms for Computing the Hilbert Transform of a Given Function with Cubic Splines
Bo Yu , Jiaxin Du , Xiaoxiao Qin
Communications on Applied Mathematics and Computation ›› 2026, Vol. 8 ›› Issue (1) : 324 -337.
It is important to compute the Hilbert transform of a given function defined on a finite interval. In 2013, Micchelli and his collaborators proposed a fast algorithm, which is called the Hilbert spline transform, to calculate the Hilbert transform of a given function on a finite interval with the computational complexity
The Hilbert transform / The Hilbert spline transform / Quasi-interpolation cubic spline approximation / Interpolation cubic spline approximation / Fast algorithm / 41A15 / 44A15 / 65D15
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
Huang, N.E., Shen, Z., Long, S.R., Wu, M.C., Shih, H.H., Zheng, Q., Yen, N.C., Tung, C.C., Liu, H.H.: The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis. Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci. 454(1971), 903–995 (1998) |
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
Shanghai University
/
| 〈 |
|
〉 |