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 O(n log n), where the spline knots were chosen to be the midpoints of sampling points. A natural question is that, whether or not the spline knots can be chosen to be the same as the sampling points. This paper gives a positive answer to this question. Besides, the analytic expression of the Hilbert transform of B-splines of any order is also established. Furthermore, the problem of how to choose spline coefficients, using the quasi-interpolation method or interpolation method, is also considered, although both make sure an optimal approximation order. Several interesting numerical examples are implemented and compared with most of the existing methods. Numerical results show that the proposed algorithm has a relatively high computational accuracy as well as a relatively low computational complexity.
Bo Yu
,
Jiaxin Du
,
Xiaoxiao Qin
. Fast Algorithms for Computing the Hilbert Transform of a Given Function with Cubic Splines[J]. Communications on Applied Mathematics and Computation, 2026
, 8(1)
: 324
-337
.
DOI: 10.1007/s42967-024-00440-8
[1] Abd-el-Malek, M.B., Hanna, S.S.: The Hilbert transform of cubic splines. Commun. Nonlinear Sci. Numer. Simul. 80, 104983 (2020)
[2] Bilato, R., Maj, O., Brambilla, M.: An algorithm for fast Hilbert transform of real functions. Adv. Comput. Math. 40(5), 1159-1168 (2014)
[3] Chen, D.R.: On the cardinal spline interpolation corresponding to infinite order differential operators. Acta Math. Sinica 10(3), 315-324 (1994)
[4] Chen, Q., Huang, N., Riemenschneider, S., Xu, Y.: A B-spline approach for empirical mode decompositions. Adv. Comput. Math. 24(1), 171-195 (2006)
[5] Chui, C.K.: An Introduction to Wavelets. Academic Press, London (1992)
[6] Chui, C.K., Wang, J.Z.: Quasi-interpolation functionals on spline spaces. J. Approx. Theory 76(3), 303-325 (1994)
[7] Fan, X., Zuo, M.J.: Gearbox fault detection using Hilbert and wavelet packet transform. Mech. Syst. Signal Process. 20(4), 966-982 (2006)
[8] Feldman, M.: Hilbert transform in vibration analysis. Mech. Syst. Signal Process. 25(3), 735-802 (2011)
[9] Hahn, S.L.: Hilbert Transforms in Signal Processing. Artech House, Boston (1996)
[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] King, F.W.: Hilbert Transforms, vol. 1. Cambridge University Press, New York (2009)
[12] Liu, C., Chen, C.L., Wang, D., Liu, Y., Wang, S.Y., Zhang, L.: Seismic dip estimation based on the two-dimensional Hilbert transform and its application in random noise attenuation. Appl. Geophys. 12(1), 55-63 (2015)
[13] Luo, Y., Al-Dossary, S., Marhoon, M., Alfaraj, M.: Generalized Hilbert transform and its applications in geophysics. Leading Edge 22(3), 198-202 (2003)
[14] Marple, L.: Computing the discrete-time “analytic’’ signal via FFT. IEEE Trans. Signal Process. 47(9), 2600-2603 (1999)
[15] Micchelli, C.A., Xu, Y., Yu, B.: On computing with the Hilbert spline transform. Adv. Comput. Math. 38(3), 623-646 (2013)
[16] Powell, M.J.D.: Approximation Theory and Methods. Cambridge University Press, New York (1981)
[17] Whittaker, K.A., Keaveney, J., Hughes, I.G., Adams, C.S.: Hilbert transform: applications to atomic spectra. Phys. Rev. A 91(3), 032513 (2015)
[18] Zhou, C., Yang, L., Liu, Y., Yang, Z.: A novel method for computing the Hilbert transform with Haar multiresolution approximation. J. Comput. Appl. Math. 223(2), 585-597 (2009)
