{'fraction_non_alphanumeric': 0.01818181818181818, 'fraction_numerical': 0.005194805194805195, 'mean_word_length': 6.138888888888889, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Sinc Approximation of Multidimensional Hilbert Transform and Its Applications

Many science and engineering applications require computing Hilbert transform. Sinc approximation is an efficient algorithm for computing one-dimensional (1D) Hilbert transform. In this paper, we develop Sinc approximation for computing multidimensional Hilbert transform and analyze its convergence rate. We apply our method to two applications: detecting edges of 2D images, and pricing discretely monitored barrier options and calculating survival probabilities in two-asset/three-asset models where the prices follow exponential Levy processes. Extensive numerical experiments confirm the efficiency of Sinc approximation for computing 2D and 3D Hilbert transforms in these applications.